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 "reactive proximity data structures for graphs"):
  Abstract: We consider data structures for graphs where we maintain a subset of the nodes called sites, and allow proximity queries, such as asking for the closest site to a query node, and update operations that enable or disable nodes as sites. We refer to a data structure that can efficiently react to such updates as reactive. We present novel reactive proximity data structures for graphs of polynomial expansion, i.e., the class of graphs with small separators, such as planar graphs and road networks. Our data structures can be used directly in several logistical problems and geographic information systems dealing with real-time data, such as emergency dispatching. We experimentally compare our data structure to Dijkstra's algorithm in a system emulating random queries in a real road network.

Includes members:
  Member "dynamic geometric data structures via shallow cuttings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "thaad efficient matching queries under temporal abstraction for anomaly detection")
  Member "better tradeoffs for exact distance oracles in planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "planar diameter via metric compression")
  Member "crossing patterns in nonplanar road networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the edge crossings of the greedy spanner")
  Member "defining equitable geographic districts in road networks via stable matching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "stable matching voronoi diagrams combinatorial complexity and algorithms")
  Member "dynamic planar voronoi diagrams for general distance functions and their algorithmic applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a graph theoretic additive approximation of optimal transport")
  Member "treetopes and their graphs":
    also connected through other hyperedges:
      (none)
  Member "going off road transversal complexity in road networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "crossing patterns in nonplanar road networks")
  Member "all maximal independent sets and dynamic dominance for sparse graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a tutorial on clique problems in communications and signal processing")

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)