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: "redundancy in distributed proofs"
  Abstract: Distributed proofs are mechanisms enabling the nodes of a network to collectivity and efficiently check the correctness of Boolean predicates on the structure of the network, or on data-structures distributed over the nodes (e.g., spanning trees or routing tables). We consider mechanisms consisting of two components: a \emph{prover} assigning a \emph{certificate} to each node, and a distributed algorithm called \emph{verifier} that is in charge of verifying the distributed proof formed by the collection of all certificates. #R##N#In this paper, we show that many network predicates have distributed proofs offering a high level of redundancy, explicitly or implicitly. We use this remarkable property of distributed proofs for establishing perfect tradeoffs between the \emph{size of the certificate} stored at every node, and the \emph{number of rounds} of the verification protocol. If we allow every node to communicate to distance at most $t$, one might expect that the certificate sizes can be reduced by a multiplicative factor of at least~$t$. In trees, cycles and grids, we show that such tradeoffs can be established for \emph{all} network predicates, i.e., it is always possible to linearly decrease the certificate size. In arbitrary graphs, we show that any part of the certificates common to all nodes can be evenly redistributed among these nodes, achieving even a better tradeoff: this common part of the certificate can be reduced by the size of a smallest ball of radius $t$ in the network. #R##N#In addition to these general results, we establish several upper and lower bounds on the certificate sizes used for distributed proofs for spanning trees, minimum-weight spanning trees, diameter, additive and multiplicative spanners, and more, improving and generalizing previous results from the literature.

Connected through hyperedge HE-1 (induced by source paper "introduction to local certification"):
  with members:
    - "note on distributed certification of minimum spanning trees"
    - "silent mst approximation for tiny memory"
    - "graph classes and forbidden patterns on three vertices"
    - "local verification of global proofs"
    - "distributed automata and logic"
    - "proof labeling schemes broadcast unicast and in between"
    - "error sensitive proof labeling schemes"
    - "space time tradeoffs for distributed verification"

Connected through hyperedge HE-2 (induced by source paper "trade offs in distributed interactive proofs"):
  with members:
    - "the power of distributed verifiers in interactive proofs"
    - "distributed triangle detection via expander decomposition"
    - "distributed pcp theorems for hardness of approximation in p"
    - "survey of distributed decision"
    - "a hierarchy of local decision"
    - "one round multi party communication complexity of distinguishing sums"
    - "randomized distributed decision"

Connected through hyperedge HE-3 (induced by source paper "silent mst approximation for tiny memory"):
  with members:
    - "self stabilizing distributed cooperative reset"
    - "note on distributed certification of minimum spanning trees"
    - "a taxonomy of daemons in self stabilization"

Connected through hyperedge HE-4 (induced by source paper "the power of distributed verifiers in interactive proofs"):
  with members:
    - "strong eth breaks with merlin and arthur short non interactive proofs of batch evaluation"
    - "local distributed decision"

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)