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 modulo q arguments and the chevalley warning theorem"):
  Abstract: We study the search problem class $\mathrm{PPA}_q$ defined as a modulo-$q$ analog of the well-known $\textit{polynomial parity argument}$ class $\mathrm{PPA}$ introduced by Papadimitriou '94. Our first result shows that this class can be characterized in terms of $\mathrm{PPA}_p$ for prime $p$. #R##N#Our main result is to establish that an $\textit{explicit}$ version of a search problem associated to the Chevalley--Warning theorem is complete for $\mathrm{PPA}_p$ for prime $p$. This problem is $\textit{natural}$ in that it does not explicitly involve circuits as part of the input. It is the first such complete problem for $\mathrm{PPA}_p$ when $p \ge 3$. #R##N#Finally we discuss connections between Chevalley-Warning theorem and the well-studied $\textit{short integer solution}$ problem and survey the structural properties of $\mathrm{PPA}_q$.

Includes members:
  Member "the classes ppa k existence from arguments modulo k":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "consenus halving does it ever get easier")
  Member "the complexity of splitting necklaces and bisecting ham sandwiches":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "consenus halving does it ever get easier")
  Member "ppp completeness with connections to cryptography":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the classes ppa k existence from arguments modulo k")
  Member "on the polynomial parity argument complexity of the combinatorial nullstellensatz":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ppp completeness with connections to cryptography")
  Member "consensus halving is ppa complete":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "consenus halving does it ever get easier")
  Member "integer factoring and modular square roots":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the classes ppa k existence from arguments modulo k")
  Member "settling the complexity of computing approximate two player nash equilibria":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "complexity theory game theory and economics the barbados lectures")

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)