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 "adjacency labelling for planar graphs and beyond"):
  Abstract: We show that there exists an adjacency labelling scheme for planar graphs where each vertex of an $n$-vertex planar graph $G$ is assigned a $(1+o(1))\log_2 n$-bit label and the labels of two vertices $u$ and $v$ are sufficient to determine if $uv$ is an edge of $G$. This is optimal up to the lower order term and is the first such asymptotically optimal result. An alternative, but equivalent, interpretation of this result is that, for every $n$, there exists a graph $U_n$ with $n^{1+o(1)}$ vertices such that every $n$-vertex planar graph is an induced subgraph of $U_n$. These results generalize to bounded genus graphs, apex-minor-free graphs, bounded-degree graphs from minor closed families, and $k$-planar graphs.

Includes members:
  Member "planar graphs have bounded queue number":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an experimental study of a 1 planarity testing and embedding algorithm")
  Member "shorter labeling schemes for planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "planar graphs have bounded queue number")
  Member "an annotated bibliography on 1 planarity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fan crossing free graphs")
  Member "near optimal induced universal graphs for bounded degree graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal induced universal graphs and adjacency labeling for trees")
  Member "optimal induced universal graphs and adjacency labeling for trees":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "shorter labels for routing in trees")
  Member "simpler faster and shorter labels for distances in graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "shorter labels for routing in trees")
  Member "sublinear distance labeling":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hardness of exact distance queries in sparse graphs through hub labeling")
  Member "distance labeling schemes for trees":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "shorter labels for routing in trees")

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.DS(Data Structures and Algorithms)