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: "hypercontractive inequalities via sos with an application to vertex cover"
  Abstract: Our main result is a formulation and proof of the reverse hypercontractive inequality in the sum-of-squares (SOS) proof system. As a consequence, we show that for any constant $\gamma > 0$, the $O(1/\gamma)$-round SOS/Lasserre SDP hierarchy certifies the statement "Min-Vertex-Cover(G^n_\gamma) \geq (1-o_n(1))|V|", where G^n_\gamma = (V,E) is the "Frankl--R\"odl graph" with $V = {0,1}^n$ and $(x,y) \in E$ whenever $\dist(x,y) = (1-\gamma)n$. This is despite the fact that $k$ rounds of various LP and SDP hierarchies fail to certify the statement "Min-Vertex-Cover(G^n_\gamma) \geq (1/2 + \eps)|V|" once $\gamma = \gamma(k,\eps) > 0$ is small enough. Finally, we also give an SOS proof of (a generalization of) the sharp $(2,q)$-hypercontractive inequality for any even integer $q$.

Connected through hyperedge HE-1 (induced by source paper "analysis of boolean functions"):
  with members:
    - "improved bounds for the randomized decision tree complexity of recursive majority"
    - "some improvements to total degree tests"
    - "dnf sparsification and a faster deterministic counting algorithm"
    - "hypercontractivity sum of squares proofs and their applications"
    - "majority is stablest discrete and sos"
    - "a satisfiability algorithm for ac 0"
    - "the influence lower bound via query elimination"
    - "fooling functions of halfspaces under product distributions"

Connected through hyperedge HE-2 (induced by source paper "hardness of robust graph isomorphism lasserre gaps and asymmetry of random graphs"):
  with members:
    - "graph isomorphism and the lasserre hierarchy"
    - "practical graph isomorphism ii"
    - "pebble games and linear equations"
    - "hypercontractivity sum of squares proofs and their applications"
    - "approximability and proof complexity"
    - "noise tolerant learning the parity problem and the statistical query model"

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)