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: "consensus halving is ppa complete"
  Abstract: We show that the computational problem CONSENSUS-HALVING is PPA-complete, the first PPA-completeness result for a problem whose definition does not involve an explicit circuit. We also show that an approximate version of this problem is polynomial-time equivalent to NECKLACE SPLITTING, which establishes PPAD-hardness for NECKLACE SPLITTING, and suggests that it is also PPA-complete.

Connected through hyperedge HE-1 (induced by source paper "consenus halving does it ever get easier"):
  with members:
    - "the hairy ball problem is ppad complete"
    - "computing exact solutions of consensus halving and the borsuk ulam theorem"
    - "on the complexity of modulo q arguments and the chevalley warning theorem"
    - "fair and efficient cake division with connected pieces"
    - "the classes ppa k existence from arguments modulo k"
    - "the complexity of splitting necklaces and bisecting ham sandwiches"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"
    - "hardness results for consensus halving"

Connected through hyperedge HE-2 (induced by source paper "computing exact solutions of consensus halving and the borsuk ulam theorem"):
  with members:
    - "approximating the existential theory of the reals"
    - "the complexity of splitting necklaces and bisecting ham sandwiches"
    - "an improved envy free cake cutting protocol for four agents"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"
    - "hardness results for consensus halving"
    - "recognition and complexity of point visibility graphs"
    - "a discrete and bounded envy free cake cutting protocol for four agents"
    - "inapproximability of nash equilibrium"

Connected through hyperedge HE-3 (induced by source paper "the classes ppa k existence from arguments modulo k"):
  with members:
    - "the hairy ball problem is ppad complete"
    - "the complexity of splitting necklaces and bisecting ham sandwiches"
    - "ppp completeness with connections to cryptography"
    - "unique end of potential line"
    - "integer factoring and modular square roots"
    - "on the complexity of finding falsifying assignments for herbrand disjunctions"
    - "the complexity of non monotone markets"
    - "settling the complexity of arrow debreu equilibria in markets with additively separable utilities"

Connected through hyperedge HE-4 (induced by source paper "on the complexity of modulo q arguments and the chevalley warning theorem"):
  with members:
    - "the classes ppa k existence from arguments modulo k"
    - "the complexity of splitting necklaces and bisecting ham sandwiches"
    - "ppp completeness with connections to cryptography"
    - "on the polynomial parity argument complexity of the combinatorial nullstellensatz"
    - "integer factoring and modular square roots"
    - "settling the complexity of computing approximate two player nash equilibria"

Connected through hyperedge HE-5 (induced by source paper "the hairy ball problem is ppad complete"):
  with members:
    - "end of potential line"
    - "the complexity of splitting necklaces and bisecting ham sandwiches"
    - "on the complexity of envy free cake cutting"
    - "reducibility among fractional stability problems"
    - "settling the complexity of computing two player nash equilibria"

Connected through hyperedge HE-6 (induced by source paper "ppp completeness with connections to cryptography"):
  with members:
    - "on the polynomial parity argument complexity of the combinatorial nullstellensatz"
    - "cls new problems and completeness"
    - "a converse to banach s fixed point theorem and its cls completeness"
    - "local max cut in smoothed polynomial time"
    - "integer factoring and modular square roots"
    - "settling the complexity of computing approximate two player nash equilibria"
    - "number balancing is as hard as minkowski s theorem and shortest vector"
    - "on the complexity of nash equilibria in anonymous games"

Connected through hyperedge HE-7 (induced by source paper "the complexity of splitting necklaces and bisecting ham sandwiches"):
  with members:
    - "end of potential line"
    - "on the polynomial parity argument complexity of the combinatorial nullstellensatz"
    - "computational social choice and computational complexity bffs"
    - "integer factoring and modular square roots"
    - "hardness results for consensus halving"
    - "settling the complexity of computing approximate two player nash equilibria"
    - "on the complexity of nash equilibria in anonymous games"
    - "inapproximability of nash equilibrium"

Connected through hyperedge HE-8 (induced by source paper "communication complexity of cake cutting"):
  with members:
    - "the query complexity of cake cutting"
    - "combinatorial auctions do need modest interaction"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"
    - "waste makes haste bounded time algorithms for envy free cake cutting with free disposal"
    - "hardness results for consensus halving"
    - "communication complexity for algorithm designers"
    - "welfare maximization with limited interaction"
    - "a stable marriage requires communication"

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.CC(Computational Complexity)