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 "hypercontractive inequalities via sos and the frankl r odl graph"):
  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 $0   3$". Finally, we also give an SOS proof of (a generalization of) the sharp $(2,q)$-hypercontractive inequality for any even integer $q$.

Includes members:
  Member "hypercontractivity sum of squares proofs and their applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sum of squares bounds for the ordering principle")
  Member "majority is stablest discrete and sos":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "complexity and approximability of parameterized max csps")
  Member "approximability and proof complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficiently learning structured distributions from untrusted batches")
  Member "random 3cnf formulas elude the lovasz theta function":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "average case complexity")
  Member "approximate graph coloring by semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "positive semidefinite programming mixed parallel and width independent")

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)