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: "fast distributed backup placement in sparse and dense networks"
  Abstract: We consider the Backup Placement problem in networks in the $\mathcal{CONGEST}$ distributed setting. Given a network graph $G = (V,E)$, the goal of each vertex $v \in V$ is selecting a neighbor, such that the maximum number of vertices in $V$ that select the same vertex is minimized. The backup placement problem was introduced by Halldorsson, Kohler, Patt-Shamir, and Rawitz, who obtained an $O(\log n/ \log \log n)$ approximation with randomized polylogarithmic time. Their algorithm remained the state-of-the-art for general graphs, as well as specific graph topologies. In this paper we obtain significantly improved algorithms for various graph topologies. Specifically, we show that $O(1)$-approximation to optimal backup placement can be computed deterministically in $O(1)$ rounds in graphs that model wireless networks, certain social networks, claw-free graphs, and more generally, in any graph with neighborhood independence bounded by a constant. At the other end, we consider sparse graphs, such as trees, forests, planar graphs and graphs of constant arboricity, and obtain a constant approximation to optimal backup placement in $O(\log n)$ deterministic rounds.  Clearly, our constant-time algorithms for graphs with constant neighborhood independence are asymptotically optimal. Moreover, we show that our algorithms for sparse graphs are not far from optimal as well, by proving several lower bounds. Specifically, optimal backup placement of unoriented trees requires $\Omega(\log n)$ time, and approximate backup placement with a polylogarithmic approximation factor requires $\Omega(\sqrt {\log n / \log \log n})$ time. Our results extend the knowledge regarding the question of "what can be computed locally?", and reveal surprising gaps between complexities of distributed symmetry breaking problems.

Connected through hyperedge HE-1 (induced by source paper "distributed backup placement in one round and its applications to maximum matching approximation and self stabilization"):
  with members:
    - "faster deterministic distributed coloring through recursive list coloring"
    - "fast distributed backup placement in sparse and dense graphs"
    - "deterministic distributed delta o delta edge coloring and vertex coloring of graphs with bounded diversity"
    - "deterministic distributed vertex coloring in polylogarithmic time"

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.DC(Distributed, Parallel, and Cluster Computing)