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 "global cardinality constraints make approximating some max 2 csps harder"):
  Abstract: Assuming the Unique Games Conjecture, we show that existing approximation algorithms for some Boolean Max-2-CSPs with cardinality constraints are optimal. In particular, we prove that Max-Cut with cardinality constraints is UG-hard to approximate within \approx 0.858, and that Max-2-Sat with cardinality constraints is UG-hard to approximate within \approx 0.929. In both cases, the previous best hardness results were the same as the hardness of the corresponding unconstrained Max-2-CSP (\approx 0.878 for Max-Cut, and \approx 0.940 for Max-2-Sat). The hardness for Max-2-Sat applies to monotone Max-2-Sat instances, meaning that we also obtain tight inapproximability for the Max-k-Vertex-Cover problem.

Includes members:
  Member "resolution lower bounds for refutation statements":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "automating resolution is np hard")
  Member "a note on max k vertex cover faster fpt as smaller approximate kernel and improved approximation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a polynomial time approximation schema for maximum k vertex cover in bipartite graphs")
  Member "a dichotomy theorem for nonuniform csps":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "when symmetries are not enough a hierarchy of hard constraint satisfaction problems")
  Member "the proof of csp dichotomy conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal polynomial time compression for boolean max csp")
  Member "analysis of boolean functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "better balance by being biased a 0 8776 approximation for max bisection":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "bisect and conquer hierarchical clustering via max uncut bisection")
  Member "approximating csps with global cardinality constraints using sdp hierarchies":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "new dependencies of hierarchies in polynomial optimization")
  Member "the complexity of global cardinality constraints":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "beyond boolean surjective vcsps")

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)