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

Includes members:
  Member "distribution independent reliable learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a nearly optimal lower bound on the approximate degree of ac 0")
  Member "dual lower bounds for approximate degree and markov bernstein inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "near optimal lower bounds on the threshold degree and sign rank of ac 0")
  Member "faster private release of marginals on small databases":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the power of factorization mechanisms in local and central differential privacy")
  Member "a note on the quantum collision and set equality problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on finding quantum multi collisions")
  Member "hardness amplification and the approximate degree of constant depth circuits":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "near optimal lower bounds on the threshold degree and sign rank of ac 0")
  Member "a quantum lower bound for distinguishing random functions from random permutations":
    also connected through other hyperedges:
      (none)
  Member "faster algorithms for privately releasing marginals":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "data dependent differentially private parameter learning for directed graphical models")
  Member "strong direct product theorems for quantum communication and query complexity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a new minimax theorem for randomized algorithms")

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)