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: "majority is stablest discrete and sos"
  Abstract: The Majority is Stablest Theorem has numerous applications in hardness of approximation and social choice theory. We give a new proof of the Majority is Stablest Theorem by induction on the dimension of the discrete cube. Unlike the previous proof, it uses neither the "invariance principle" nor Borell's result in Gaussian space. The new proof is general enough to include all previous variants of majority is stablest such as "it ain't over until it's over" and "Majority is most predictable". Moreover, the new proof allows us to derive a proof of Majority is Stablest in a constant level of the Sum of Squares hierarchy.This implies in particular that Khot-Vishnoi instance of Max-Cut does not provide a gap instance for the Lasserre hierarchy.

Connected through hyperedge HE-1 (induced by source paper "complexity and approximability of parameterized max csps"):
  with members:
    - "solving maxsat and sat on structured cnf formulas"
    - "tractable answer set programming with weight constraints bounded treewidth is not enough"
    - "guarantees and limits of preprocessing in constraint satisfaction and reasoning"
    - "model counting for formulas of bounded clique width"
    - "a characterization of approximation resistance for even k partite csps"
    - "satisfiability of acyclic and almost acyclic cnf formulas"
    - "backdoors to acyclic sat"
    - "not so easy problems for tree decomposable graphs"

Connected through hyperedge HE-2 (induced by source paper "sos and planted clique tight analysis of mpw moments at all degrees and an optimal lower bound at degree four"):
  with members:
    - "improved sum of squares lower bounds for hidden clique and hidden submatrix problems"
    - "sum of squares lower bounds for sparse pca"
    - "sum of squares lower bounds from pairwise independence"
    - "tight lower bounds for planted clique in the degree 4 sos program"
    - "decomposing overcomplete 3rd order tensors using sum of squares algorithms"
    - "tensor prediction rademacher complexity and random 3 xor"
    - "sum of squares lower bounds for planted clique"
    - "lower bounds on the size of semidefinite programming relaxations"

Connected through hyperedge HE-3 (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"
    - "hypercontractive inequalities via sos with an application to vertex cover"
    - "hypercontractivity sum of squares proofs and their applications"
    - "a satisfiability algorithm for ac 0"
    - "the influence lower bound via query elimination"
    - "fooling functions of halfspaces under product distributions"

Connected through hyperedge HE-4 (induced by source paper "rounding lasserre sdps using column selection and spectrum based approximation schemes for graph partitioning and quadratic ips"):
  with members:
    - "faster sdp hierarchy solvers for local rounding algorithms"
    - "hypercontractivity sum of squares proofs and their applications"
    - "approximability and proof complexity"
    - "rounding semidefinite programming hierarchies via global correlation"
    - "approximating non uniform sparsest cut via generalized spectra"
    - "optimal column based low rank matrix reconstruction"
    - "spectral algorithms for unique games"
    - "near optimal column based matrix reconstruction"

Connected through hyperedge HE-5 (induced by source paper "constant factor lasserre integrality gaps for graph partitioning problems"):
  with members:
    - "a prg for lipschitz functions of polynomials with applications to sparsest cut"
    - "hypercontractivity sum of squares proofs and their applications"
    - "approximability and proof complexity"
    - "polynomial integrality gaps for strong sdp relaxations of densest k subgraph"
    - "reductions between expansion problems"

Connected through hyperedge HE-6 (induced by source paper "hypercontractive inequalities via sos and the frankl r odl graph"):
  with members:
    - "hypercontractivity sum of squares proofs and their applications"
    - "approximability and proof complexity"
    - "random 3cnf formulas elude the lovasz theta function"
    - "approximate graph coloring by semidefinite programming"

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)