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 "lasserre integrality gaps for graph spanners and related problems"):
  Abstract: There has been significant recent progress on algorithms for approximating graph spanners, i.e., algorithms which approximate the best spanner for a given input graph. Essentially all of these algorithms use the same basic LP relaxation, so a variety of papers have studied the limitations of this approach and proved integrality gaps for this LP in a variety of settings. We extend these results by showing that even the strongest lift-and-project methods cannot help significantly, by proving polynomial integrality gaps even for $n^{\Omega(\epsilon)}$ levels of the Lasserre hierarchy, for both the directed and undirected spanner problems. We also extend these integrality gaps to related problems, notably Directed Steiner Network and Shallow-Light Steiner Network.

Includes members:
  Member "characterizing demand graphs for fixed parameter shallow light steiner network":
    also connected through other hyperedges:
      (none)
  Member "approximating spanners and directed steiner forest upper and lower bounds":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "graph spanners a tutorial review")
  Member "parallel metric tree embedding based on an algebraic view on moore bellman ford":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "massively parallel algorithms for distance approximation and spanners")
  Member "everywhere sparse spanners via dense subgraphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reducibility and computational lower bounds for problems with planted sparse structure")
  Member "label cover instances with large girth and the hardness of approximating basic k spanner":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "graph spanners a tutorial review")
  Member "rounding semidefinite programming hierarchies via global correlation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "new dependencies of hierarchies in polynomial optimization")
  Member "fault tolerant spanners better and simpler":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "approximate distance oracles subject to multiple vertex failures")
  Member "directed steiner tree and the lasserre hierarchy":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polylogarithmic approximation algorithm for k connected directed steiner tree on quasi bipartite graphs")

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)