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: "gathering an even number of robots in an odd ring without global multiplicity detection"
  Abstract: We propose a gathering protocol for an even number of robots in a ring-shaped network that allows symmetric but not periodic configurations as initial configurations, yet uses only local weak multiplicity detection. Robots are assumed to be anonymous and oblivious, and the execution model is the non- atomic CORDA model with asynchronous fair scheduling. In our scheme, the number of robots k must be greater than 8, the number of nodes n on a network must be odd and greater than k+3. The running time of our protocol is O(n2) asynchronous rounds.

Connected through hyperedge HE-1 (induced by source paper "crash tolerant gathering on grid by asynchronous oblivious robots"):
  with members:
    - "deterministic gathering with crash faults"
    - "rendezvous in networks in spite of delay faults"
    - "byzantine gathering in networks"
    - "the gathering problem for two oblivious robots with unreliable compasses"
    - "asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection"

Connected through hyperedge HE-2 (induced by source paper "implicit function computation by oblivious mobile robots"):
  with members:
    - "on the synthesis of mobile robots algorithms the case of ring gathering"
    - "optimal deterministic ring exploration with oblivious asynchronous robots"

Connected through hyperedge HE-3 (induced by source paper "universal systems of oblivious mobile robots"):
  with members:
    - "on the synthesis of mobile robots algorithms the case of ring gathering"
    - "optimal deterministic ring exploration with oblivious asynchronous robots"

Connected through hyperedge HE-4 (induced by source paper "on the synthesis of mobile robots algorithms the case of ring gathering"):
  with members:
    - "certified impossibility results for byzantine tolerant mobile robots"
    - "optimal grid exploration by asynchronous oblivious robots"
    - "asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection"

Connected through hyperedge HE-5 (induced by source paper "a distributed algorithm for gathering many fat mobile robots in the plane"):
  with members:
    - "a survey on open problems for mobile robots"

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)