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 approximate shortest paths in the congested clique"
  Abstract: We design fast deterministic algorithms for distance computation in the congested clique model. Our key contributions include: #R##N#-- A $(2+\epsilon)$-approximation for all-pairs shortest paths in $O(\log^2{n} / \epsilon)$ rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation for APSP in this model. #R##N#-- A $(1+\epsilon)$-approximation for multi-source shortest paths from $O(\sqrt{n})$ sources in $O(\log^2{n} / \epsilon)$ rounds on weighted undirected graphs. This is the first sub-polynomial algorithm obtaining this approximation for a set of sources of polynomial size. #R##N#Our main techniques are new distance tools that are obtained via improved algorithms for sparse matrix multiplication, which we leverage to construct efficient hopsets and shortest paths. Furthermore, our techniques extend to additional distance problems for which we improve upon the state-of-the-art, including diameter approximation, and an exact single-source shortest paths algorithm for weighted undirected graphs in $\tilde{O}(n^{1/6})$ rounds.

Connected through hyperedge HE-1 (induced by source paper "exponentially faster shortest paths in the congested clique"):
  with members:
    - "near additive spanners and near exact hopsets a unified view"
    - "near additive spanners in low polynomial deterministic congest time"
    - "congested clique algorithms for graph spanners"
    - "sparse matrix multiplication and triangle listing in the congested clique model"
    - "linear size hopsets with small hopbound and distributed routing with low memory"
    - "thorup zwick emulators are universally optimal hopsets"
    - "towards a complexity theory for the congested clique"
    - "further algebraic algorithms in the congested clique model and applications to graph theoretic problems"

Connected through hyperedge HE-2 (induced by source paper "parallel approximate undirected shortest paths via low hop emulators"):
  with members:
    - "preconditioning for the geometric transportation problem"
    - "brief announcement semi mapreduce meets congested clique"
    - "thorup zwick emulators are universally optimal hopsets"
    - "parallel shortest paths using radius stepping"
    - "near optimal approximate shortest paths and transshipment in distributed and streaming models"
    - "a hierarchy of lower bounds for sublinear additive spanners"
    - "hopsets with constant hopbound and applications to approximate shortest paths"
    - "an almost tight distributed algorithm for computing single source shortest paths"

Connected through hyperedge HE-3 (induced by source paper "shortest paths in a hybrid network model"):
  with members:
    - "a deterministic distributed algorithm for exact weighted all pairs shortest paths in tilde o n 3 2 rounds"
    - "distributed exact weighted all pairs shortest paths in near linear time"
    - "mst in o 1 rounds of the congested clique"
    - "a faster distributed single source shortest paths algorithm"
    - "distributed exact shortest paths in sublinear time"
    - "improved distributed algorithms for exact shortest paths"
    - "competitive routing in hybrid communication networks"
    - "near linear lower bounds for distributed distance computations even in sparse networks"

Connected through hyperedge HE-4 (induced by source paper "sparse hopsets in congested clique"):
  with members:
    - "brief announcement semi mapreduce meets congested clique"
    - "massively parallel approximate distance sketches"
    - "thorup zwick emulators are universally optimal hopsets"
    - "a hierarchy of lower bounds for sublinear additive spanners"
    - "hopsets with constant hopbound and applications to approximate shortest paths"
    - "distributed approximation algorithms for weighted shortest paths"
    - "lessons from the congested clique applied to mapreduce"
    - "parallel graph decompositions using random shifts"

Connected through hyperedge HE-5 (induced by source paper "distributed mst a smoothed analysis"):
  with members:
    - "fast and efficient distributed computation of hamiltonian cycles in random graphs"
    - "congested clique algorithms for graph spanners"
    - "new distributed algorithms in almost mixing time via transformations from parallel algorithms"
    - "distributed symmetry breaking algorithms for congested cliques"
    - "a simple deterministic distributed mst algorithm with near optimal time and message complexities"
    - "towards a complexity theory for the congested clique"
    - "a time and message optimal distributed algorithm for minimum spanning trees"
    - "smoothed analysis of dynamic networks"

Connected through hyperedge HE-6 (induced by source paper "reachability and shortest paths in the broadcast congest model"):
  with members:
    - "a deterministic distributed algorithm for exact weighted all pairs shortest paths in tilde o n 3 2 rounds"
    - "distributed exact weighted all pairs shortest paths in near linear time"
    - "distributed exact shortest paths in sublinear time"
    - "improved distributed algorithms for exact shortest paths"
    - "algebraic methods in the congested clique"
    - "fast partial distance estimation and applications"
    - "distributed approximation algorithms for weighted shortest paths"
    - "distributed verification and hardness of distributed approximation"

Connected through hyperedge HE-7 (induced by source paper "massively parallel approximate distance sketches"):
  with members:
    - "mapreduce meets fine grained complexity mapreduce algorithms for apsp matrix multiplication 3 sum and beyond"
    - "near optimal approximate shortest paths and transshipment in distributed and streaming models"
    - "hopsets with constant hopbound and applications to approximate shortest paths"
    - "on efficient distributed construction of near optimal routing schemes"
    - "parallel metric tree embedding based on an algebraic view on moore bellman ford"
    - "a deterministic almost tight distributed algorithm for approximating single source shortest paths"
    - "distributed computation of large scale graph problems"
    - "communication steps for parallel query processing"

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)