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 "a hierarchy of local decision"):
  Abstract: We extend the notion of distributed decision in the framework of distributed network computing, inspired by recent results on so-called distributed graph automata. We show that, by using distributed decision mechanisms based on the interaction between a prover and a disprover, the size of the certificates distributed to the nodes for certifying a given network property can be drastically reduced. For instance, we prove that minimum spanning tree can be certified with $O(\log n)$-bit certificates in $n$-node graphs, with just one interaction between the prover and the disprover, while it is known that certifying MST requires $\Omega(\log^2 n)$-bit certificates if only the prover can act. The improvement can even be exponential for some simple graph properties. For instance, it is known that certifying the existence of a nontrivial automorphism requires $\Omega(n^2)$ bits if only the prover can act. We show that there is a protocol with two interactions between the prover and the disprover enabling to certify nontrivial automorphism with $O(\log n)$-bit certificates. These results are achieved by defining and analysing a local hierarchy of decision which generalizes the classical notions of proof-labelling schemes and locally checkable proofs.

Includes members:
  Member "distributed graph automata":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lower bounds for the state complexity of probabilistic languages and the language of prime numbers")
  Member "node labels in local decision":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "introduction to local certification")
  Member "fast and compact self stabilizing verification computation and fault detection of an mst":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on underlay aware self stabilizing overlay networks")
  Member "distributed graph automata":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lower bounds for the state complexity of probabilistic languages and the language of prime numbers")
  Member "what can be decided locally without identifiers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "proof labeling schemes broadcast unicast and in between")
  Member "on the impact of identifiers on local decision":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "proof labeling schemes broadcast unicast and in between")
  Member "distributed verification and hardness of distributed approximation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "beyond alice and bob improved inapproximability for maximum independent set in congest")

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)