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: "deterministic graph connectivity in the broadcast congested clique"
  Abstract: We present deterministic constant-round protocols for the graph connectivity problem in the model where each of the $n$ nodes of a graph receives a row of the adjacency matrix, and broadcasts a single sublinear size message to all other nodes. Communication rounds are synchronous. This model is sometimes called the broadcast congested clique. Specifically, we exhibit a deterministic protocol that computes the connected components of the input graph in $\lceil 1/\epsilon \rceil$ rounds, each player communicating $\mathcal{O}(n^{\epsilon} \cdot \log n)$ bits per round, with $0 < \epsilon \leq 1$. #R##N#We also provide a deterministic one-round protocol for connectivity, in the model when each node receives as input the graph induced by the nodes at distance at most $r>0$, and communicates $\mathcal{O}(n^{1/r} \cdot \log n)$ bits. This result is based on a $d$-pruning protocol, which consists in successively removing nodes of degree at most $d$ until obtaining a graph with minimum degree larger than $d$. Our technical novelty is the introduction of deterministic sparse linear sketches: a linear compression function that permits to recover sparse Boolean vectors deterministically.

Connected through hyperedge HE-1 (induced by source paper "broadcast congested clique planted cliques and pseudorandom generators"):
  with members:
    - "congested clique algorithms for graph spanners"
    - "optimal lower bounds for distributed and streaming spanning forest computation"
    - "msf and connectivity in limited variants of the congested clique"
    - "a time hierarchy theorem for the local model"
    - "on derandomizing local distributed algorithms"
    - "deterministic subgraph detection in broadcast congest"
    - "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 "connectivity lower bounds in broadcast congested clique"):
  with members:
    - "detecting cliques in congest networks"
    - "mst in o 1 rounds of the congested clique"
    - "fooling views a new lower bound technique for distributed computations under congestion"
    - "proof labeling schemes broadcast unicast and in between"
    - "quadratic and near quadratic lower bounds for the congest model"
    - "approximation of distances and shortest paths in the broadcast congest clique"
    - "distributed verification and hardness of distributed approximation"

Connected through hyperedge HE-3 (induced by source paper "algorithms for noisy broadcast under erasures"):
  with members:
    - "msf and connectivity in limited variants of the congested clique"
    - "algebraic methods in the congested clique"

Connected through hyperedge HE-4 (induced by source paper "msf and connectivity in limited variants of the congested clique"):
  with members:
    - "super fast mst algorithms in the congested clique using o m messages"
    - "lessons from the congested clique applied to mapreduce"
    - "distributed computation of large scale graph problems"
    - "optimal deterministic routing and sorting on the congested clique"

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)