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 "new np hardness results for 3 coloring and 2 to 1 label cover"):
  Abstract: We show that given a 3-colorable graph, it is NP-hard to find a 3-coloring with $(16/17 + \eps)$ of the edges bichromatic. In a related result, we show that given a satisfiable instance of the 2-to-1 Label Cover problem, it is NP-hard to find a $(23/24 + \eps)$-satisfying assignment.

Includes members:
  Member "a new point of np hardness for 2 to 1 label cover":
    also connected through other hyperedges:
      (none)
  Member "rounding semidefinite programming hierarchies via global correlation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "new dependencies of hierarchies in polynomial optimization")
  Member "lasserre hierarchy higher eigenvalues and approximation schemes for quadratic integer programming with psd objectives":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "approximation limits of linear programs beyond hierarchies")
  Member "improved inapproximability results for maximum k colorable subgraph":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the maximum binary tree problem")
  Member "approximation resistant predicates from pairwise independence":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the approximability of presidential type predicates")
  Member "conditional hardness for approximate coloring":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the generalized orthogonality dimension of generalized kneser graphs bounds and applications")

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)