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: "proof labeling schemes broadcast unicast and in between"
  Abstract: We study the effect of limiting the number of different messages a node can transmit simultaneously on the verification complexity of proof-labeling schemes (PLS). In a PLS, each node is given a label, and the goal is to verify, by exchanging messages over each link in each direction, that a certain global predicate is satisfied by the system configuration. We consider a single parameter r that bounds the number of distinct messages that can be sent concurrently by any node: in the case r=1, each node may only send the same message to all its neighbors (the broadcast model), in the case r is at least Delta, where Delta is the largest node degree in the system, each neighbor may be sent a distinct message (the unicast model), and in general, for r between 1 and Delta, each of the r messages is destined to a subset of the neighbors. #R##N#We show that message compression linear in r is possible for verifying fundamental problems such as the agreement between edge endpoints on the edge state. Some problems, including verification of maximal matching, exhibit a large gap in complexity between r=1 and r>1. For some other important predicates, the verification complexity is insensitive to r, e.g., the question whether a subset of edges constitutes a spanning-tree. We also consider the congested clique model. We show that the crossing technique for proving lower bounds on the verification complexity can be applied in the case of congested clique only if r=1. Together with a new upper bound, this allows us to determine the verification complexity of MST in the broadcast clique. Finally, we establish a general connection between the deterministic and randomized verification complexity for any given number r.

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"
    - "redundancy in distributed proofs"
    - "distributed automata and logic"
    - "error sensitive proof labeling schemes"
    - "space time tradeoffs for distributed verification"

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"
    - "quadratic and near quadratic lower bounds for the congest model"
    - "deterministic graph connectivity in the broadcast congested clique"
    - "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 "local verification of global proofs"):
  with members:
    - "error sensitive proof labeling schemes"
    - "a hierarchy of local decision"
    - "local distributed decision"

Connected through hyperedge HE-4 (induced by source paper "redundancy in distributed proofs"):
  with members:
    - "error sensitive proof labeling schemes"
    - "near linear lower bounds for distributed distance computations even in sparse networks"

Connected through hyperedge HE-5 (induced by source paper "survey of distributed decision"):
  with members:
    - "deterministic subgraph detection in broadcast congest"
    - "towards a complexity theory for the congested clique"
    - "space time tradeoffs for distributed verification"
    - "local distributed verification"
    - "fast distributed algorithms for testing graph properties"
    - "a hierarchy of local decision"
    - "distributed graph automata"
    - "algebraic methods in 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)