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: "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.

Connected through hyperedge HE-1 (induced by source paper "a breezing proof of the kmw bound"):
  with members:
    - "lower bounds for maximal matchings and maximal independent sets"
    - "the complexity of distributed edge coloring with small palettes"
    - "on the complexity of local distributed graph problems"
    - "a lower bound for the distributed lov asz local lemma"
    - "lower bounds for local approximation"
    - "local computation lower and upper bounds"

Connected through hyperedge HE-2 (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"
    - "proof labeling schemes broadcast unicast and in between"
    - "error sensitive proof labeling schemes"

Connected through hyperedge HE-3 (induced by source paper "trade offs in distributed interactive proofs"):
  with members:
    - "the power of distributed verifiers in interactive proofs"
    - "distributed triangle detection via expander decomposition"
    - "redundancy in distributed proofs"
    - "distributed pcp theorems for hardness of approximation in p"
    - "survey of distributed decision"
    - "one round multi party communication complexity of distinguishing sums"
    - "randomized distributed decision"

Connected through hyperedge HE-4 (induced by source paper "local verification of global proofs"):
  with members:
    - "proof labeling schemes broadcast unicast and in between"
    - "error sensitive proof labeling schemes"
    - "local distributed decision"

Connected through hyperedge HE-5 (induced by source paper "towards a complexity theory for the congested clique"):
  with members:
    - "new classes of distributed time complexity"
    - "a time hierarchy theorem for the local model"
    - "lcl problems on grids"
    - "deterministic subgraph detection in broadcast congest"
    - "tight bounds for distributed graph computations"
    - "further algebraic algorithms in the congested clique model and applications to graph theoretic problems"
    - "distributed degree splitting edge coloring and orientations"
    - "survey of distributed decision"

Connected through hyperedge HE-6 (induced by source paper "distributed detection of cycles"):
  with members:
    - "distributed testing of excluded subgraphs"
    - "survey of distributed decision"
    - "fast distributed algorithms for testing graph properties"
    - "randomized distributed decision"
    - "finding cycles and trees in sublinear time"
    - "distributed discovery of large near cliques"

Connected through hyperedge HE-7 (induced by source paper "proof labeling schemes broadcast unicast and in between"):
  with members:
    - "node labels in local decision"
    - "fast and compact self stabilizing verification computation and fault detection of an mst"
    - "what can be decided locally without identifiers"
    - "on the impact of identifiers on local decision"
    - "distributed verification and hardness of distributed approximation"

Connected through hyperedge HE-8 (induced by source paper "survey of distributed decision"):
  with members:
    - "proof labeling schemes broadcast unicast and in between"
    - "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"
    - "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)