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 "the power of sherali adams relaxations for general valued csps"):
  Abstract: We give a precise algebraic characterization of the power of Sherali--Adams relaxations for solvability of valued constraint satisfaction problems (CSPs) to optimality. The condition is that of bounded width, which has already been shown to capture the power of local consistency methods for decision CSPs and the power of semidefinite programming for robust approximation of CSPs. Our characterization has several algorithmic and complexity consequences. On the algorithmic side, we show that several novel and well-known valued constraint languages are tractable via the third level of the Sherali--Adams relaxation. For the known languages, this is a significantly simpler algorithm than those previously obtained. On the complexity side, we obtain a dichotomy theorem for valued constraint languages that can express an injective unary function. This implies a simple proof of the dichotomy theorem for conservative valued constraint languages established by Kolmogorov and Živný [J. ACM, 60 (2013), 10], and also a ...

Includes members:
  Member "binarisation for valued constraint satisfaction problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "toward a dichotomy for approximation of h coloring")
  Member "algebraic properties of valued constraint satisfaction problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complexity of boolean surjective general valued csps")
  Member "a reduction from valued csp to min cost homomorphism problem for digraphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "binarisation for valued constraint satisfaction problems")
  Member "the complexity of general valued csps":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the complexity of boolean surjective general valued csps")
  Member "local distribution and the symmetry gap approximability of multiway partitioning problems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimizing item and subgroup configurations for social aware vr shopping")
  Member "robustly solvable constraint satisfaction problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "improved hardness for h colourings of g colourable graphs")
  Member "sum of squares proofs and the quest toward optimal algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sum of squares bounds for the ordering principle")
  Member "half integrality lp branching and fpt algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "parameterized algorithms for milps with small treedepth")

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)