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: "asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection"
  Abstract: We consider a set of k autonomous robots that are endowed with visibility sensors (but that are otherwise unable to communicate) and motion actuators. Those robots must collaborate to reach a sin- gle vertex that is unknown beforehand, and to remain there hereafter. Previous works on gathering in ring-shaped networks suggest that there exists a tradeoff between the size of the set of potential initial configurations, and the power of the sensing capabilities of the robots (i.e. the larger the initial configuration set, the most powerful the sensor needs to be). We prove that there is no such trade off. We propose a gathering protocol for an odd 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. Our protocol allows the largest set of initial configurations (with respect to impossibility results) yet uses the weakest multiplicity detector to date. The time complexity of our protocol is O(n2), where n denotes the size of the ring. Compared to previous work that also uses local weak multiplicity detection, we do not have the constraint that k < n/2 (here, we simply have 2 < k < n - 3).

Connected through hyperedge HE-1 (induced by source paper "connected assembly and reconfiguration by finite automata"):
  with members:
    - "on the runtime of universal coating for programmable matter"
    - "cadbots algorithmic aspects of manipulating programmable matter with finite automata"
    - "shape formation by programmable particles"
    - "improved leader election for self organizing programmable matter"
    - "universal coating for programmable matter"
    - "new geometric algorithms for fully connected staged self assembly"
    - "an algorithmic framework for shape formation problems in self organizing particle systems"
    - "leader election and shape formation with self organizing programmable matter"

Connected through hyperedge HE-2 (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"
    - "gathering an even number of robots in an odd ring without global multiplicity detection"
    - "the gathering problem for two oblivious robots with unreliable compasses"

Connected through hyperedge HE-3 (induced by source paper "distributed computing by mobile robots uniform circle formation"):
  with members:
    - "square formation by asynchronous oblivious robots"
    - "distributed computing by mobile robots solving the uniform circle formation problem"
    - "the gathering problem for two oblivious robots with unreliable compasses"
    - "circle formation of weak mobile 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"
    - "gathering an even number of robots in an odd ring without global multiplicity detection"
    - "optimal grid exploration by asynchronous oblivious robots"

Connected through hyperedge HE-5 (induced by source paper "distributed computing by mobile robots solving the uniform circle formation problem"):
  with members:
    - "the gathering problem for two oblivious robots with unreliable compasses"
    - "circle formation of weak mobile robots"

Connected through hyperedge HE-6 (induced by source paper "rendezvous of two robots with constant memory"):
  with members:
    - "rendezvous of two robots with visible bits"
    - "the gathering problem for two oblivious robots with unreliable compasses"

Connected through hyperedge HE-7 (induced by source paper "ring exploration with oblivious myopic robots"):
  with members:
    - "optimal deterministic ring exploration with oblivious asynchronous robots"
    - "optimal probabilistic ring exploration by asynchronous oblivious robots"
    - "circle formation of weak mobile robots"

Connected through hyperedge HE-8 (induced by source paper "optimal grid exploration by asynchronous oblivious robots"):
  with members:
    - "optimal deterministic ring exploration with oblivious asynchronous robots"
    - "optimal probabilistic ring exploration by asynchronous oblivious robots"
    - "circle formation of weak 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)