human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on resilient graph spanners"
  Abstract: We introduce and investigate a new notion of resilience in graph spanners. Let $S$ be a spanner of a graph $G$. Roughly speaking, we say that a spanner $S$ is resilient if all its point-to-point distances are resilient to edge failures. Namely, whenever any edge in $G$ fails, then as a consequence of this failure all distances do not degrade in $S$ substantially more than in $G$ (i.e., the relative distance increases in $S$ are very close to those in the underlying graph $G$). In this paper we show that sparse resilient spanners exist, and that they can be computed efficiently.

Connected through hyperedge HE-1 (induced by source paper "graph spanners a tutorial review"):
  with members:
    - "near additive spanners and near exact hopsets a unified view"
    - "some general structure for extremal sparsification problems"
    - "weighted additive spanners"
    - "near additive spanners in low polynomial deterministic congest time"
    - "multi level graph sketches via single level solvers"
    - "almost shortest paths and pram distance oracles in weighted graphs"
    - "an fpt algorithm for minimum additive spanner problem"
    - "distributed construction of light networks"

Connected through hyperedge HE-2 (induced by source paper "improved purely additive fault tolerant spanners"):
  with members:
    - "fault tolerant approximate shortest path trees"
    - "fault tolerant approximate bfs structures"
    - "vertex fault tolerant additive spanners"
    - "sparse fault tolerant bfs trees"
    - "on pairwise spanners"
    - "fault tolerant spanners better and simpler"

Connected through hyperedge HE-3 (induced by source paper "fault tolerant approximate shortest path trees"):
  with members:
    - "multiple edge fault tolerant approximate shortest path trees"
    - "compact and fast sensitivity oracles for single source distances"
    - "dual failure resilient bfs structure"
    - "improved purely additive fault tolerant spanners"
    - "fault tolerant approximate bfs structures"
    - "vertex fault tolerant additive spanners"
    - "sparse fault tolerant bfs trees"
    - "approximate distance oracle with constant query time"

Connected through hyperedge HE-4 (induced by source paper "from hierarchical partitions to hierarchical covers optimal fault tolerant spanners for doubling metrics"):
  with members:
    - "the traveling salesman problem low dimensionality implies a polynomial time approximation scheme"
    - "sparse fault tolerant bfs trees"
    - "efficient construction of spanners in d dimensions"
    - "fault tolerant spanners for doubling metrics better and simpler"
    - "robust geometric spanners"
    - "optimal euclidean spanners really short thin and lanky"
    - "incubators vs zombies fault tolerant short thin and lanky spanners for doubling metrics"
    - "balancing degree diameter and weight in euclidean spanners"

Question: Please tell me which class the center node 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)