human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "beyond q resolution and prenex form a proof system for quantified constraint satisfaction"
  Abstract: We consider the quantified constraint satisfaction problem (QCSP) which is to#N#decide, given a structure and a first-order sentence (not assumed here to be in#N#prenex form) built from conjunction and quantification, whether or not the#N#sentence is true on the structure. We present a proof system for certifying the#N#falsity of QCSP instances and develop its basic theory; for instance, we#N#provide an algorithmic interpretation of its behavior. Our proof system places#N#the established Q-resolution proof system in a broader context, and also allows#N#us to derive QCSP tractability results.

Connected through hyperedge HE-1 (induced by source paper "proof complexity modulo the polynomial hierarchy understanding alternation as a source of hardness"):
  with members:
    - "on qbf proofs and preprocessing"
    - "clause learning algorithms with many restarts and bounded width resolution"
    - "towards understanding and harnessing the potential of clause learning"

Question: Please tell me which class the center node 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)