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 "extending partial representations of subclasses of chordal graphs"):
  Abstract: Chordal graphs are intersection graphs of subtrees of a tree T. We investigate the complexity of the partial representation extension problem for chordal graphs. A partial representation specifies a tree T' and some pre-drawn subtrees of T'. It asks whether it is possible to construct a representation inside a modified tree T which extends the partial representation (i.e, keeps the pre-drawn subtrees unchanged). #R##N#We consider four modifications of T' and get vastly different problems. In some cases, it is interesting to consider the complexity even if just T' is given and no subtree is pre-drawn. Also, we consider three well-known subclasses of chordal graphs: Proper interval graphs, interval graphs and path graphs. We give an almost complete complexity characterization. #R##N#We further study the parametrized complexity of the problems when parametrized by the number of pre-drawn subtrees, the number of components and the size of the tree T'. We describe an interesting relation with integer partition problems. The problem Partition is used for all NP-completeness reductions. The extension of interval graphs when the space in T' is limited is "equivalent" to the BinPacking problem.

Includes members:
  Member "bounded representations of interval and proper interval graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the classes of interval graphs of limited nesting and count of lengths")
  Member "extending partial representations of interval graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "circle graph isomorphism in almost linear time")
  Member "extending partial representations of circle graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "circle graph isomorphism in almost linear time")
  Member "extending partial representations of proper and unit interval graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "circle graph isomorphism in almost linear time")
  Member "extending partial representations of function graphs and permutation graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "extending upward planar graph drawings")
  Member "simultaneous pq ordering with applications to constrained embedding problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "atomic embeddability clustered planarity and thickenability")

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)