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: "dual polynomials for collision and element distinctness"
  Abstract: The approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within error $1/3$ in the $\ell_\infty$ norm. In an influential result, Aaronson and Shi (J. ACM 2004) proved tight $\tilde{\Omega}(n^{1/3})$ and $\tilde{\Omega}(n^{2/3})$ lower bounds on the approximate degree of the Collision and Element Distinctness functions, respectively. Their proof was non-constructive, using a sophisticated symmetrization argument and tools from approximation theory. #R##N#More recently, several open problems in the study of approximate degree have been resolved via the construction of dual polynomials. These are explicit dual solutions to an appropriate linear program that captures the approximate degree of any function. We reprove Aaronson and Shi's results by constructing explicit dual polynomials for the Collision and Element Distinctness functions.

Connected through hyperedge HE-1 (induced by source paper "a nearly optimal lower bound on the approximate degree of ac 0"):
  with members:
    - "on szk and pp"
    - "separations in query complexity based on pointer functions"
    - "distribution independent reliable learning"
    - "dual lower bounds for approximate degree and markov bernstein inequalities"
    - "faster private release of marginals on small databases"
    - "hardness amplification and the approximate degree of constant depth circuits"
    - "faster algorithms for privately releasing marginals"
    - "a separation of np and conp in multiparty communication complexity"

Connected through hyperedge HE-2 (induced by source paper "on the power of statistical zero knowledge"):
  with members:
    - "a nearly optimal lower bound on the approximate degree of ac 0"
    - "on szk and pp"
    - "adaptivity vs postselection"
    - "hardness amplification and the approximate degree of constant depth circuits"
    - "verifying computations with streaming interactive proofs"
    - "on arthur merlin games in communication complexity"

Connected through hyperedge HE-3 (induced by source paper "on szk and pp"):
  with members:
    - "adaptivity vs postselection"
    - "annotations for sparse data streams"
    - "verifying computations with streaming interactive proofs"
    - "on arthur merlin games in communication complexity"
    - "bounded independence fools halfspaces"

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)