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: "integrality gaps of linear and semi definite programming relaxations for knapsack"
  Abstract: In this paper, we study the integrality gap of the Knapsack linear program in the Sherali- Adams and Lasserre hierarchies. First, we show that an integrality gap of 2 - {\epsilon} persists up to a linear number of rounds of Sherali-Adams, despite the fact that Knapsack admits a fully polynomial time approximation scheme [27,33]. Second, we show that the Lasserre hierarchy closes the gap quickly. Specifically, after t rounds of Lasserre, the integrality gap decreases to t/(t - 1). To the best of our knowledge, this is the first positive result that uses more than a small number of rounds in the Lasserre hierarchy. Our proof uses a decomposition theorem for the Lasserre hierarchy, which may be of independent interest.

Connected through hyperedge HE-1 (induced by source paper "breaking symmetries to rescue sum of squares the case of makespan scheduling"):
  with members:
    - "proximity results and faster algorithms for integer programming using the steinitz lemma"
    - "the power of sum of squares for detecting hidden structures"
    - "sum of squares lower bounds for refuting any csp"
    - "quasi ptas for scheduling with precedences using lp hierarchies"
    - "a nearly tight sum of squares lower bound for the planted clique problem"
    - "polynomial time tensor decompositions with sum of squares"
    - "closing the gap for makespan scheduling via sparsification techniques"
    - "on the hardest problem formulations for the 0 1 lasserre hierarchy"

Connected through hyperedge HE-2 (induced by source paper "on the hardest problem formulations for the 0 1 lasserre hierarchy"):
  with members:
    - "sum of squares lower bounds from pairwise independence"
    - "lower bounds on the size of semidefinite programming relaxations"
    - "analysis of boolean functions"
    - "hypercontractivity sum of squares proofs and their applications"
    - "approximability and proof complexity"
    - "rounding semidefinite programming hierarchies via global correlation"
    - "polynomial integrality gaps for strong sdp relaxations of densest k subgraph"
    - "approximating csps with global cardinality constraints using sdp hierarchies"

Connected through hyperedge HE-3 (induced by source paper "a lasserre lower bound for the min sum single machine scheduling problem"):
  with members:
    - "on the hardest problem formulations for the 0 1 lasserre hierarchy"
    - "sum of squares lower bounds from pairwise independence"
    - "sum of squares lower bounds for planted clique"
    - "a 4 approximation for scheduling on a single machine with general cost function"
    - "approximability and proof complexity"
    - "polynomial integrality gaps for strong sdp relaxations of densest k subgraph"
    - "the geometry of scheduling"

Connected through hyperedge HE-4 (induced by source paper "no small linear program approximates vertex cover within a factor 2 epsilon"):
  with members:
    - "lower bounds on the size of semidefinite programming relaxations"
    - "approximate constraint satisfaction requires large lp relaxations"
    - "on the existence of 0 1 polytopes with high semidefinite extension complexity"
    - "the matching polytope has exponential extension complexity"
    - "approximation limits of linear programs beyond hierarchies"
    - "polynomial integrality gaps for strong sdp relaxations of densest k subgraph"

Connected through hyperedge HE-5 (induced by source paper "approximating unweighted tree augmentation via lift and project part i stemless tap"):
  with members:
    - "approximating unweighted tree augmentation via lift and project part 0 1 8 e approximation for unweighted tap"
    - "a 1 75 lp approximation for the tree augmentation problem"
    - "a simplified 1 5 approximation algorithm for augmenting edge connectivity of a graph from 1 to 2"
    - "directed steiner tree and the lasserre hierarchy"

Connected through hyperedge HE-6 (induced by source paper "approximating unweighted tree augmentation via lift and project part ii"):
  with members:
    - "a simplified 1 5 approximation algorithm for augmenting edge connectivity of a graph from 1 to 2"
    - "directed steiner tree and the lasserre hierarchy"

Connected through hyperedge HE-7 (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"
    - "majority is stablest discrete and sos"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "faster sdp hierarchy solvers for local rounding algorithms"):
  with members:
    - "hypercontractivity sum of squares proofs and their applications"
    - "rounding semidefinite programming hierarchies via global correlation"
    - "optimal column based low rank matrix reconstruction"
    - "approximating csps with global cardinality constraints using sdp hierarchies"
    - "directed steiner tree and the lasserre hierarchy"
    - "approximating sparsest cut in graphs of bounded treewidth"
    - "efficient volume sampling for row column subset selection"

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)