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 lower bounds for approximate degree and markov bernstein inequalities"
  Abstract: The $\epsilon$-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 $\epsilon$ in the $\ell_\infty$ norm. We prove several lower bounds on this important complexity measure by explicitly constructing solutions to the dual of an appropriate linear program. Our first result resolves the $\epsilon$-approximate degree of the two-level AND-OR tree for any constant $\epsilon > 0$. We show that this quantity is $\Theta(\sqrt{n})$, closing a line of incrementally larger lower bounds. The same lower bound was recently obtained independently by Sherstov using related techniques. Our second result gives an explicit dual polynomial that witnesses a tight lower bound for the approximate degree of any symmetric Boolean function, addressing a question of \v{S}palek. Our final contribution is to reprove several Markov-type inequalities from approximation theory by constructing explicit dual solutions to natural linear programs. These inequalities underly the proofs of many of the best-known approximate degree lower bounds, and have important uses throughout theoretical computer science.

Connected through hyperedge HE-1 (induced by source paper "near optimal lower bounds on the threshold degree and sign rank of ac 0"):
  with members:
    - "a nearly optimal lower bound on the approximate degree of ac 0"
    - "hardness amplification and the approximate degree of constant depth circuits"
    - "strong direct product theorems for quantum communication and query complexity"
    - "the intersection of two halfspaces has high threshold degree"
    - "a note on the sign degree of formulas"
    - "optimal bounds for sign representing the intersection of two halfspaces by polynomials"
    - "a dual polynomial for or"

Connected through hyperedge HE-2 (induced by source paper "approximate degree secret sharing and concentration phenomena"):
  with members:
    - "near optimal lower bounds on the threshold degree and sign rank of ac 0"
    - "a nearly optimal lower bound on the approximate degree of ac 0"
    - "faster private release of marginals on small databases"
    - "hardness amplification and the approximate degree of constant depth circuits"
    - "on the number of iterations for dantzig wolfe optimization and packing covering approximation algorithms"

Connected through hyperedge HE-3 (induced by source paper "lower bounding the and or tree via symmetrization"):
  with members:
    - "strong direct product theorems for quantum communication and query complexity"
    - "the intersection of two halfspaces has high threshold degree"

Connected through hyperedge HE-4 (induced by source paper "improved bounds on fourier entropy and min entropy"):
  with members:
    - "on the fourier entropy influence conjecture for extremal classes"
    - "improved lower bounds for the fourier entropy influence conjecture via lexicographic functions"
    - "nearly optimal separations between communication or query complexity and partitions"
    - "low sensitivity functions from unambiguous certificates"
    - "degree and sensitivity tails of two distributions"
    - "polynomial bounds for decoupling with applications"
    - "almost quadratic gap between partition complexity and query communication complexity"
    - "analysis of boolean functions"

Connected through hyperedge HE-5 (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"
    - "dual polynomials for collision and element distinctness"
    - "distribution independent reliable learning"
    - "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-6 (induced by source paper "a composition theorem for randomized query complexity"):
  with members:
    - "query to communication lifting for bpp"
    - "randomized query complexity of sabotaged and composed functions"
    - "a composition theorem for parity kill number"
    - "improved direct product theorems for randomized query complexity"

Connected through hyperedge HE-7 (induced by source paper "dual polynomials for collision and element distinctness"):
  with members:
    - "distribution independent reliable learning"
    - "faster private release of marginals on small databases"
    - "a note on the quantum collision and set equality problems"
    - "hardness amplification and the approximate degree of constant depth circuits"
    - "a quantum lower bound for distinguishing random functions from random permutations"
    - "faster algorithms for privately releasing marginals"
    - "strong direct product theorems for quantum communication and query complexity"
    - "the intersection of two halfspaces has high threshold degree"

Connected through hyperedge HE-8 (induced by source paper "distribution independent reliable learning"):
  with members:
    - "hardness amplification and the approximate degree of constant depth circuits"
    - "representation approximation and learning of submodular functions using low rank decision trees"
    - "a separation of np and conp in multiparty communication complexity"
    - "optimal bounds for sign representing the intersection of two halfspaces by polynomials"

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)