human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "on the complexity of finding narrow proofs"):
  Abstract: We study the complexity of the following "resolution width problem": Does a given 3-CNF have a resolution refutation of width k? We prove that the problem cannot be decided in time O(n^((k-3)/12)). This lower bound is unconditional and does not rely on any unproven complexity theoretic assumptions. The lower bound is matched by a trivial upper bound of n^O(k). #R##N#We also prove that the resolution width problem is EXPTIME-complete (if k is part of the input). This confirms a conjecture by Vardi, who has first raised the question for the complexity of the resolution width problem. Furthermore, we prove that the variant of the resolution width problem for regular resolution is PSPACE-complete, confirming a conjecture by Urquhart.

Includes members:
  Member "lower bounds for existential pebble games and k consistency tests":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "constructing hard examples for graph isomorphism")
  Member "pebble games proof complexity and time space trade offs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nullstellensatz size degree trade offs from reversible pebbling")
  Member "width and size of regular resolution proofs":
    also connected through other hyperedges:
      (none)
  Member "clause learning algorithms with many restarts and bounded width resolution":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards a complexity theoretic understanding of restarts in sat solvers")
  Member "towards an optimal separation of space and length in resolution":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "pebble games proof complexity and time space trade offs")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.LO(Logic in Computer Science)