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 "survey of distributed decision"):
  Abstract: We survey the recent distributed computing literature on checking whether a given distributed system configuration satisfies a given boolean predicate, i.e., whether the configuration is legal or illegal w.r.t. that predicate. We consider classical distributed computing environments, including mostly synchronous fault-free network computing (LOCAL and CONGEST models), but also asynchronous crash-prone shared-memory computing (WAIT-FREE model), and mobile computing (FSYNC model).

Includes members:
  Member "proof labeling schemes broadcast unicast and in between":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "introduction to local certification")
  Member "deterministic subgraph detection in broadcast congest":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed testing of graph isomorphism in the congest model")
  Member "towards a complexity theory for the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "space time tradeoffs for distributed verification":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "introduction to local certification")
  Member "local distributed verification":
    also connected through other hyperedges:
      (none)
  Member "fast distributed algorithms for testing graph properties":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed testing of graph isomorphism in the congest model")
  Member "a hierarchy of local decision":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a breezing proof of the kmw bound")
  Member "distributed graph automata":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lower bounds for the state complexity of probabilistic languages and the language of prime numbers")

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)