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 "bounded representations of interval and proper interval graphs"):
  Abstract: Klavik et al. [arXiv:1207.6960] recently introduced a generalization of recognition called the bounded representation problem which we study for the classes of interval and proper interval graphs. The input gives a graph G and in addition for each vertex v two intervals L_v and R_v called bounds. We ask whether there exists a bounded representation in which each interval I_v has its left endpoint in L_v and its right endpoint in R_v. We show that the problem can be solved in linear time for interval graphs and in quadratic time for proper interval graphs. #R##N#Robert's Theorem states that the classes of proper interval graphs and unit interval graphs are equal. Surprisingly the bounded representation problem is polynomially solvable for proper interval graphs and NP-complete for unit interval graphs [Klav\'{\i}k et al., arxiv:1207.6960]. So unless P = NP, the proper and unit interval representations behave very differently. #R##N#The bounded representation problem belongs to a wider class of restricted representation problems. These problems are generalizations of the well-understood recognition problem, and they ask whether there exists a representation of G satisfying some additional constraints. The bounded representation problems generalize many of these problems.

Includes members:
  Member "linear time algorithm for partial representation extension of interval graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "extending partial representations of circle graphs")
  Member "extending partial representations of circle 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 proper and unit interval 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 subclasses of chordal 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")
  Member "simultaneous interval graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "simultaneous representation of proper and unit interval 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.DM(Discrete Mathematics)