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 "approximation hardness of graphic tsp on cubic graphs"):
  Abstract: We prove explicit approximation hardness results for the Graphic TSP on cubic and subcubic graphs as well as the new inapproximability bounds for the corresponding instances of the (1,2)-TSP. The proof technique uses new modular constructions of simulating gadgets for the restricted cubic and subcubic instances. The modular constructions used in the paper could be also of independent interest.

Includes members:
  Member "tsp tours in cubic graphs beyond 4 3":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "simple cubic graphs with no short traveling salesman tour")
  Member "new inapproximability bounds for tsp":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a quasi polynomial algorithm for well spaced hyperbolic tsp")
  Member "on approximation lower bounds for tsp with bounded metrics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "characterizing the integrality gap of the subtour lp for the circulant traveling salesman problem")
  Member "approximating graphic tsp by matchings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "simple cubic graphs with no short traveling salesman tour")
  Member "the traveling salesman problem on cubic and subcubic graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "simple cubic graphs with no short traveling salesman tour")
  Member "13 9 approximation for graphic tsp":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reducing path tsp to tsp")

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)