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: "distributed construction of light networks"
  Abstract: A $t$-{\em spanner} $H$ of a weighted graph $G=(V,E,w)$ is a subgraph that approximates all pairwise distances up to a factor of $t$. The {\em lightness} of $H$ is defined as the ratio between the weight of $H$ to that of the minimum spanning tree. An $(\alpha,\beta)$-{\em Shallow Light Tree} (SLT) is a tree of lightness $\beta$, that approximates all distances from a designated root vertex up to a factor of $\alpha$. A long line of works resulted in efficient algorithms that produce (nearly) optimal light spanners and SLTs. #R##N#Some of the most notable algorithmic applications of light spanners and SLTs are in distributed settings. Surprisingly, so far there are no known efficient distributed algorithms for constructing these objects in general graphs. In this paper we devise efficient distributed algorithms in the CONGEST model for constructing light spanners and SLTs, with near optimal parameters. Specifically, for any $k\ge 1$ and $0 1$ we provide an $(\alpha,1+\frac{O(1)}{\alpha-1})$-SLT in $(\sqrt{n}+D)\cdot n^{o(1)}$ rounds. The running time of our algorithms cannot be substantially improved. #R##N#We also consider spanners for the family of doubling graphs, and devise a $(\sqrt{n}+D)\cdot n^{o(1)}$ rounds algorithm in the CONGEST model that computes a $(1+\epsilon)$-spanner with lightness $(\log n)/\epsilon^{O(1)}$. As a stepping stone, which is interesting in its own right, we first develop a distributed algorithm for constructing nets (for arbitrary weighted graphs), generalizing previous algorithms that worked only for unweighted graphs.

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"
    - "lasserre integrality gaps for graph spanners and related problems"

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)