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 "beyond planarity density results for bipartite graphs"):
  Abstract: Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations. Early research dates back to the 1960s (e.g., Avital and Hanani 1966) for extremal problems on geometric graphs, but is also related to graph drawing problems where visual clutter by edge crossings should be minimized (e.g., Huang et al. 2008) that could negatively affect the readability of the drawing. Different types of forbidden crossing configurations give rise to different families of nearly-planar graphs. #R##N#Most of the literature focuses on Tur\'an-type problems, which ask for the maximum number of edges a nearly-planar graph can have. Here, we study this problem for bipartite topological graphs, considering several types of nearly-planar graphs, i.e., 1-planar, 2-planar, fan-planar, and RAC graphs. We prove bounds on the number of edges that are tight up to small additive constants; some of them are surprising and not along the lines of the known results for non-bipartite graphs. Our findings lead to an improvement of the leading constant of the well-known Crossing Lemma for bipartite graphs, as well as to a number of interesting research questions on topological graphs.

Includes members:
  Member "recognizing optimal 1 planar graphs in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fan crossing free graphs")
  Member "on the relationship between k planar and k quasi planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "simple k planar graphs are simple k 1 quasiplanar")
  Member "an annotated bibliography on 1 planarity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fan crossing free graphs")
  Member "two planar graphs are quasiplanar":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "simple k planar graphs are simple k 1 quasiplanar")
  Member "on the density of non simple 3 planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "simple k planar graphs are simple k 1 quasiplanar")
  Member "recognizing and drawing ic planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fan crossing free graphs")
  Member "on the recognition of fan planar and maximal outer fan planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fan crossing free graphs")
  Member "the density of fan planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fan crossing free 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)