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 routing table construction using small messages"
  Abstract: We describe a distributed randomized algorithm computing approximate distances and routes that approximate shortest paths. Let n denote the number of nodes in the graph, and let HD denote the hop diameter of the graph, i.e., the diameter of the graph when all edges are considered to have unit weight. Given 0 < eps <= 1/2, our algorithm runs in weak-O(n^(1/2 + eps) + HD) communication rounds using messages of O(log n) bits and guarantees a stretch of O(eps^(-1) log eps^(-1)) with high probability. This is the first distributed algorithm approximating weighted shortest paths that uses small messages and runs in weak-o(n) time (in graphs where HD in weak-o(n)). The time complexity nearly matches the lower bounds of weak-Omega(sqrt(n) + HD) in the small-messages model that hold for stateless routing (where routing decisions do not depend on the traversed path) as well as approximation of the weigthed diameter. Our scheme replaces the original identifiers of the nodes by labels of size O(log eps^(-1) log n). We show that no algorithm that keeps the original identifiers and runs for weak-o(n) rounds can achieve a polylogarithmic approximation ratio. #R##N#Variations of our techniques yield a number of fast distributed approximation algorithms solving related problems using small messages. Specifically, we present algorithms that run in weak-O(n^(1/2 + eps) + HD) rounds for a given 0 < eps <= 1/2, and solve, with high probability, the following problems: #R##N#- O(eps^(-1))-approximation for the Generalized Steiner Forest (the running time in this case has an additive weak-O(t^(1 + 2eps)) term, where t is the number of terminals); #R##N#- O(eps^(-2))-approximation of weighted distances, using node labels of size O(eps^(-1) log n) and weak-O(n^(eps)) bits of memory per node; #R##N#- O(eps^(-1))-approximation of the weighted diameter; #R##N#- O(eps^(-3))-approximate shortest paths using the labels 1,...,n.

Connected through hyperedge HE-1 (induced by source paper "fast approximate shortest paths in the congested clique"):
  with members:
    - "delta 1 coloring in the congested clique model"
    - "congested clique algorithms for graph spanners"
    - "sparse matrix multiplication and triangle listing in the congested clique model"
    - "towards tight approximation bounds for graph diameter and eccentricities"
    - "a deterministic distributed algorithm for exact weighted all pairs shortest paths in tilde o n 3 2 rounds"
    - "distributed triangle detection via expander decomposition"
    - "distributed exact weighted all pairs shortest paths in near linear time"
    - "mst in o 1 rounds of the congested clique"

Connected through hyperedge HE-2 (induced by source paper "shortest paths in a hybrid network model"):
  with members:
    - "fast approximate shortest paths in the congested clique"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "distributed exact weighted all pairs shortest paths in near linear time"):
  with members:
    - "distributed edge connectivity in sublinear time"
    - "a deterministic distributed algorithm for exact weighted all pairs shortest paths in tilde o n 3 2 rounds"
    - "new and simplified distributed algorithms for weighted all pairs shortest paths"
    - "a deterministic distributed algorithm for weighted all pairs shortest paths through pipelining"
    - "a faster distributed single source shortest paths algorithm"
    - "distributed exact shortest paths in sublinear time"
    - "distributed exact weighted all pairs shortest paths in tilde o n 5 4 rounds"
    - "improved distributed algorithms for exact shortest paths"

Connected through hyperedge HE-4 (induced by source paper "massively parallel approximate distance sketches"):
  with members:
    - "fast approximate shortest paths in the congested clique"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "a faster distributed single source shortest paths algorithm"):
  with members:
    - "a deterministic distributed algorithm for exact weighted all pairs shortest paths in tilde o n 3 2 rounds"
    - "faster distributed shortest path approximations via shortcuts"
    - "distributed exact shortest paths in sublinear time"
    - "improved distributed algorithms for exact shortest paths"
    - "a simple deterministic distributed mst algorithm with near optimal time and message complexities"
    - "distributed approximation of maximum independent set and maximum matching"
    - "parallel shortest paths using radius stepping"
    - "near optimal approximate shortest paths and transshipment in distributed and streaming models"

Connected through hyperedge HE-6 (induced by source paper "distributed exact shortest paths in sublinear time"):
  with members:
    - "approximate undirected transshipment and shortest paths via gradient descent"
    - "efficient algorithms for constructing very sparse spanners and emulators"
    - "hopsets with constant hopbound and applications to approximate shortest paths"
    - "algebraic methods in the congested clique"
    - "a deterministic almost tight distributed algorithm for approximating single source shortest paths"
    - "approximation of distances and shortest paths in the broadcast congest clique"
    - "almost tight distributed minimum cut algorithms"
    - "distributed approximation algorithms for weighted shortest paths"

Connected through hyperedge HE-7 (induced by source paper "near optimal approximate shortest paths and transshipment in distributed and streaming models"):
  with members:
    - "thorup zwick emulators are universally optimal hopsets"
    - "distributed exact shortest paths in sublinear time"
    - "improved distributed algorithms for exact shortest paths"
    - "further algebraic algorithms in the congested clique model and applications to graph theoretic problems"
    - "generalized preconditioning and network flow problems"
    - "parallel shortest paths using radius stepping"
    - "a hierarchy of lower bounds for sublinear additive spanners"
    - "hopsets with constant hopbound and applications to approximate shortest paths"

Connected through hyperedge HE-8 (induced by source paper "on efficient distributed construction of near optimal routing schemes"):
  with members:
    - "hopsets with constant hopbound and applications to approximate shortest paths"
    - "a deterministic almost tight distributed algorithm for approximating single source shortest paths"
    - "decremental single source shortest paths on undirected graphs in near linear total update time"
    - "fast partial distance estimation and applications"
    - "distributed approximation algorithms for weighted shortest paths"
    - "distributed minimum cut approximation"
    - "distributed verification and hardness of distributed approximation"

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)