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 "shorter labeling schemes for planar graphs"):
  Abstract: An \emph{adjacency labeling scheme} for a given class of graphs is an algorithm that for every graph $G$ from the class, assigns bit strings (labels) to vertices of $G$ so that for any two vertices $u,v$, whether $u$ and $v$ are adjacent can be determined by a fixed procedure that examines only their labels. It is known that planar graphs with $n$ vertices admit a labeling scheme with labels of bit length $(2+o(1))\log{n}$. In this work we improve this bound by designing a labeling scheme with labels of bit length $(\frac{4}{3}+o(1))\log{n}$. In graph-theoretical terms, this implies an explicit construction of a graph on $n^{4/3+o(1)}$ vertices that contains all planar graphs on $n$ vertices as induced subgraphs, improving the previous best upper bound of $n^{2+o(1)}$. Our scheme generalizes to graphs of bounded Euler genus with the same label length up to a second-order term. All the labels of the input graph can be computed in polynomial time, while adjacency can be decided from the labels in constant time.

Includes members:
  Member "planar graphs as l intersection or l contact graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "computing maximum independent set on outerstring graphs and their relatives")
  Member "proximity results and faster algorithms for integer programming using the steinitz lemma":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "n fold integer programming via lp rounding")
  Member "optimal distance labeling schemes for trees":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "shorter labels for routing in trees")
  Member "optimal induced universal graphs and adjacency labeling for trees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "shorter labels for routing in trees")
  Member "sublinear space distance labeling using hubs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "shorter labels for routing in trees")
  Member "new routing techniques and their applications":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "routing in unit disk graphs without dynamic headers")
  Member "near optimal labeling schemes for nearest common ancestors":
    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)