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 "what can be decided locally without identifiers"):
  Abstract: Do unique node identifiers help in deciding whether a network G has a prescribed property P? We study this question in the context of distributed local decision, where the objective is to decide whether G has property P by having each node run a constant-time distributed decision algorithm. In a yes-instance all nodes should output yes, while in a no-instance at least one node should output no.    Recently, Fraigniaud et al. (OPODIS 2012) gave several conditions under which identifiers are not needed, and they conjectured that identifiers are not needed in any decision problem. In the present work, we disprove the conjecture.   More than that, we analyse two critical variations of the underlying model of distributed computing:   (B): the size of the identifiers is bounded by a function of the size of the input network,   (¬B): the identifiers are unbounded,   (C): the nodes run a computable algorithm,   (¬C): the nodes can compute any, possibly uncomputable function.   While it is easy to see that under (¬B, ¬C) identifiers are not needed, we show that under all other combinations there are properties that can be decided locally if and only if identifiers are present.

Includes members:
  Member "fast and compact self stabilizing verification computation and fault detection of an mst":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on underlay aware self stabilizing overlay networks")
  Member "toward more localized local algorithms removing assumptions concerning global knowledge":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "faster deterministic distributed coloring through recursive list coloring")
  Member "lower bounds for local approximation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a breezing proof of the kmw bound")
  Member "randomized distributed decision":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "introduction to local certification")
  Member "on the impact of identifiers on local decision":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "proof labeling schemes broadcast unicast and in between")
  Member "decidability classes for mobile agents computing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "survey of distributed decision")
  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")
  Member "local distributed decision":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "local distributed algorithms in highly dynamic networks")

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)