human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "introduction to local certification"):
  Abstract: Local certification is an concept that has been defined and studied recently by the distributed computing community. It is the following mechanism, known under various names such as distributed verification, distributed proof or proof-labeling scheme. The nodes of a graph want to decide collectively whether the graph has some given property, but they only know a local neighborhood, e.g. their neighbors in the graph. The nodes are then given a distributed proof that certifies that the graph has the property, and they have to collectively check that this proof is correct. #R##N#We believe that local certification is a concept that anyone interested in algorithms or graphs could be interested in. This document is an introduction to this domain, that does not require any knowledge of distributed computing. It also contains a review of the recent works and a list of open problems.

Includes members:
  Member "note on distributed certification of minimum spanning trees":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "silent mst approximation for tiny memory")
  Member "silent mst approximation for tiny memory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "note on distributed certification of minimum spanning trees")
  Member "graph classes and forbidden patterns on three vertices":
    also connected through other hyperedges:
      (none)
  Member "local verification of global proofs":
    also connected through other hyperedges:
      (none)
  Member "redundancy in distributed proofs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "trade offs in distributed interactive proofs")
  Member "distributed automata and logic":
    also connected through other hyperedges:
      (none)
  Member "proof labeling schemes broadcast unicast and in between":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "connectivity lower bounds in broadcast congested clique")
  Member "error sensitive proof labeling schemes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "local verification of global proofs")

Question: Please tell me which class the source paper 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)