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: "on the synthesis of mobile robots algorithms the case of ring gathering"
  Abstract: RecentadvancesinDistributedComputinghighlightmodelsandalgo- rithms for autonomous swarms of mobile robots that self-organize and cooperate to solve global objectives. The overwhelming majority of works so far considers handmade algorithms and correctness proofs. This paper is the first to propose a formal framework to automatically design dis- tributed algorithms that are dedicated to autonomous mobile robots evolving in a discrete space. As a case study, we consider the problem of gathering all robots at a particular location, not known beforehand. Our contribution is threefold. First, we propose an encoding of the gathering problem as a reachability game. Then, we automatically generate an optimal distributed algorithm for three robots evolv- ing on a fixed size uniform ring. Finally, we prove by induction that the generated algorithm is also correct for any ring size except when an impossibility result holds (that is, when the number of robots divides the ring size).

Connected through hyperedge HE-1 (induced by source paper "using model checking to formally verify rendezvous algorithms for robots with lights in euclidean space"):
  with members:
    - "optimal rendezvous mathcal l algorithms for asynchronous mobile robots with external lights"
    - "optimally gathering two robots"
    - "parameterized verification of algorithms for oblivious robots on a ring"
    - "certified impossibility results for byzantine tolerant mobile robots"
    - "optimal grid exploration by asynchronous oblivious robots"
    - "the gathering problem for two oblivious robots with unreliable compasses"

Connected through hyperedge HE-2 (induced by source paper "optimally gathering two robots"):
  with members:
    - "parameterized verification of algorithms for oblivious robots on a ring"
    - "optimal asynchronous rendezvous for mobile robots with lights"
    - "certified universal gathering in r 2 for oblivious mobile robots"
    - "fault and byzantine tolerant self stabilizing mobile robots gathering feasibility study"
    - "certified impossibility results for byzantine tolerant mobile robots"
    - "rendezvous of two robots with visible bits"
    - "optimal grid exploration by asynchronous oblivious robots"

Connected through hyperedge HE-3 (induced by source paper "asynchronous pattern formation the effects of a rigorous approach"):
  with members:
    - "square formation by asynchronous oblivious robots"
    - "probabilistic asynchronous arbitrary pattern formation"
    - "plane formation by synchronous mobile robots in the three dimensional euclidean space"
    - "pattern formation for asynchronous robots without agreement in chirality"
    - "distributed computing by mobile robots uniform circle formation"
    - "distributed computing by mobile robots solving the uniform circle formation problem"
    - "leader election problem versus pattern formation problem"

Connected through hyperedge HE-4 (induced by source paper "asynchronous arbitrary pattern formation the effects of a rigorous approach"):
  with members:
    - "square formation by asynchronous oblivious robots"
    - "probabilistic asynchronous arbitrary pattern formation"
    - "plane formation by synchronous mobile robots in the three dimensional euclidean space"
    - "pattern formation for asynchronous robots without agreement in chirality"
    - "distributed computing by mobile robots uniform circle formation"
    - "leader election problem versus pattern formation problem"

Connected through hyperedge HE-5 (induced by source paper "parameterized verification of algorithms for oblivious robots on a ring"):
  with members:
    - "certified universal gathering in r 2 for oblivious mobile robots"
    - "certified impossibility results for byzantine tolerant mobile robots"
    - "optimal grid exploration by asynchronous oblivious robots"

Connected through hyperedge HE-6 (induced by source paper "certified universal gathering in r 2 for oblivious mobile robots"):
  with members:
    - "a certified universal gathering algorithm for oblivious mobile robots"
    - "impossibility of gathering a certification"
    - "certified impossibility results for byzantine tolerant mobile robots"
    - "optimal grid exploration by asynchronous oblivious robots"
    - "the gathering problem for two oblivious robots with unreliable compasses"

Connected through hyperedge HE-7 (induced by source paper "implicit function computation by oblivious mobile robots"):
  with members:
    - "gathering an even number of robots in an odd ring without global multiplicity detection"
    - "optimal deterministic ring exploration with oblivious asynchronous robots"

Connected through hyperedge HE-8 (induced by source paper "universal systems of oblivious mobile robots"):
  with members:
    - "gathering an even number of robots in an odd ring without global multiplicity detection"
    - "optimal deterministic ring exploration with oblivious asynchronous 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)