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 "recognizing ic planar and nic planar graphs"):
  Abstract: We prove that triangulated IC-planar and NIC-planar graphs can be recognized in cubic time. #R##N#A graph is 1-planar if it can be drawn in the plane with at most one crossing per edge. A drawing is IC-planar if, in addition, each vertex is incident to at most one crossing edge and NIC-planar if two pairs of crossing edges share at most one vertex. In a triangulated drawing each face is a triangle. In consequence, planar-maximal and maximal IC-planar and NIC-planar graphs can be recognized in O(n^5) time and maximum and optimal ones in O(n^3) time. In contrast, recognizing 3-connected IC-planar and NIC-planar graphs is NP-complete, even if the graphs are given with a rotation system which describes the cyclic ordering of the edges at each vertex. Our results complement similar ones for 1-planar graphs.

Includes members:
  Member "parameterized complexity of 1 planarity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an experimental study of a 1 planarity testing and embedding algorithm")
  Member "recognizing optimal 1 planar graphs in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fan crossing free graphs")
  Member "a reduction system for optimal 1 planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "recognizing optimal 1 planar graphs in linear time")
  Member "recognizing and drawing ic planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fan crossing free graphs")
  Member "on 4 map graphs and 1 planar graphs and their recognition problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "t shape visibility representations of 1 planar graphs")
  Member "1 visibility representations of 1 planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fan crossing free graphs")
  Member "adding one edge to planar graphs makes crossing number and 1 planarity hard":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an experimental study of a 1 planarity testing and embedding algorithm")

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)