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: "self stabilizing pulse synchronization inspired by biological pacemaker networks"
  Abstract: We define the ``Pulse Synchronization'' problem that requires nodes to achieve tight synchronization of regular pulse events, in the settings of distributed computing systems. Pulse-coupled synchronization is a phenomenon displayed by a large variety of biological systems, typically overcoming a high level of noise. Inspired by such biological models, a robust and self-stabilizing Byzantine pulse synchronization algorithm for distributed computer systems is presented. The algorithm attains near optimal synchronization tightness while tolerating up to a third of the nodes exhibiting Byzantine behavior concurrently. Pulse synchronization has been previously shown to be a powerful building block for designing algorithms in this severe fault model. We have previously shown how to stabilize general Byzantine algorithms, using pulse synchronization. To the best of our knowledge there is no other scheme to do this without the use of synchronized pulses.

Connected through hyperedge HE-1 (induced by source paper "fault tolerant gradient clock synchronization"):
  with members:
    - "self stabilising byzantine clock synchronisation is almost as easy as consensus"
    - "self stabilizing byzantine clock synchronization with optimal precision"
    - "optimal gradient clock synchronization in dynamic networks"
    - "gradient clock synchronization using reference broadcasts"

Connected through hyperedge HE-2 (induced by source paper "self stabilising byzantine clock synchronisation is almost as easy as consensus"):
  with members:
    - "near optimal self stabilising counting and firing squads"
    - "self stabilizing byzantine clock synchronization with optimal precision"
    - "efficient counting with optimal resilience"
    - "towards optimal synchronous counting"
    - "fault tolerant algorithms for tick generation in asynchronous logic robust pulse generation"
    - "breaking the o n 2 bit barrier scalable byzantine agreement with an adaptive adversary"

Connected through hyperedge HE-3 (induced by source paper "synchronous counting and computational algorithm design"):
  with members:
    - "twenty five comparators is optimal when sorting nine inputs and twenty nine for ten"
    - "sat based methods for circuit synthesis"
    - "large cuts with local algorithms on triangle free graphs"
    - "optimal sorting networks"

Connected through hyperedge HE-4 (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"
    - "a distributed tdma slot assignment algorithm for wireless sensor networks"

Connected through hyperedge HE-5 (induced by source paper "fault tolerant algorithms for tick generation in asynchronous logic robust pulse generation"):
  with members:
    - "self stabilizing byzantine pulse synchronization"

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)