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 "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.

Includes members:
  Member "on the polynomial parity argument complexity of the combinatorial nullstellensatz":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the complexity of modulo q arguments and the chevalley warning theorem")
  Member "computational social choice and computational complexity bffs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complexity of online bribery in sequential elections extended abstract")
  Member "integer factoring and modular square roots":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the classes ppa k existence from arguments modulo k")
  Member "hardness results for consensus halving":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "consenus halving does it ever get easier")
  Member "settling the complexity of computing approximate two player nash equilibria":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "on the complexity of nash equilibria in anonymous games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ppp completeness with connections to cryptography")
  Member "inapproximability of nash equilibrium":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the complexity of interactively learning a stable matching by trial and error")
  Member "on the complexity of finding falsifying assignments for herbrand disjunctions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the classes ppa k existence from arguments modulo k")

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