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 distributed tdma slot assignment algorithm for wireless sensor networks"
  Abstract: Wireless sensor networks benefit from communication protocols that reduce power requirements by avoiding frame collision. Time Division Media Access methods schedule transmission in slots to avoid collision, however these methods often lack scalability when implemented in \emph{ad hoc} networks subject to node failures and dynamic topology. This paper reports a distributed algorithm for TDMA slot assignment that is self-stabilizing to transient faults and dynamic topology change. The expected local convergence time is O(1) for any size network satisfying a constant bound on the size of a node neighborhood.

Connected through hyperedge HE-1 (induced by source paper "ressource efficient stabilization for local tasks despite unknown capacity links"):
  with members:
    - "stabilizing data link over non fifo channels with optimal fault resilience"

Connected through hyperedge HE-2 (induced by source paper "compact self stabilizing leader election for arbitrary networks"):
  with members:
    - "a taxonomy of daemons in self stabilization"

Connected through hyperedge HE-3 (induced by source paper "vertex coloring with communication and local memory constraints in synchronous broadcast networks"):
  with members:
    - "deterministic distributed vertex coloring in polylogarithmic time"

Connected through hyperedge HE-4 (induced by source paper "optimal collision conflict free distance 2 coloring in synchronous broadcast receive tree networks"):
  with members:
    - "deterministic distributed vertex coloring in polylogarithmic time"

Connected through hyperedge HE-5 (induced by source paper "self stabilizing tdma algorithms for dynamic wireless ad hoc networks"):
  with members:
    - "deploying wireless networks with beeps"
    - "outage local throughput and capacity of random wireless networks"
    - "self stabilizing pulse synchronization inspired by biological pacemaker networks"

Connected through hyperedge HE-6 (induced by source paper "self stabilizing tdma algorithms for wireless ad hoc networks without external reference"):
  with members:
    - "self stabilizing tdma algorithms for dynamic wireless ad hoc networks"

Connected through hyperedge HE-7 (induced by source paper "distributed graph coloring an approach based on the calling behavior of japanese tree frogs"):
  with members:
    - "a distributed algorithm for constructing a minimum diameter spanning tree"
    - "deterministic distributed vertex coloring in polylogarithmic time"
    - "a new look at survey propagation and its generalizations"

Connected through hyperedge HE-8 (induced by source paper "deploying wireless networks with beeps"):
  with members:
    - "deterministic distributed vertex coloring in polylogarithmic time"
    - "local multicoloring algorithms computing a nearly optimal tdma schedule in constant time"

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)