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: "optimal grid exploration by asynchronous oblivious robots"
  Abstract: We consider a team of {\em autonomous weak robots} that are endowed with visibility sensors and motion actuators. Autonomous means that the team cannot rely on any kind of central coordination mechanism or scheduler. By weak we mean that the robots are devoid of (1) any (observable) IDs allowing to differentiate them (anonymous), (2) means of communication allowing them to communicate directly, and (3) any way to remember any previous observation nor computation performed in any previous step (oblivious). Robots asynchronously operate in cycles of three phases: Look, Compute, and Move. Furthermore, the network is an anonymous unoriented grid. In such settings, the robots must collaborate to solve a collective task, here the terminating grid exploration (exploration for short), despite being limited with respect to input from the environment, asymmetry, memory, etc. Exploration requires that robots explore the grid and stop when the task is complete. We propose optimal (w.r.t. the number of robots) solutions for the deterministic terminating exploration of a grid shaped network by a team of $k$ asynchronous oblivious robots in the fully asynchronous and non-atomic model, so called CORDA. In more details, we first assume the ATOM model in which each Look-Compute-Move cycle execution is executed atomically, ie every robot that is activated at instant t instantaneously executes a full cycle between t and t+1. ATOM being strictly stronger than CORDA, all impossibility results in ATOM also hold in CORDA. We show that it is impossible to explore a grid of at least three nodes with less than three robots in ATOM. (This first result holds for both deterministic and probabilistic settings.) Next, we show that it is impossible to deterministically explore a (2,2)-Grid with less than 4 robots, and a (3,3)-Grid with less than 5 robots, respectively. Then, we propose deterministic algorithms in CORDA to exhibit the optimal number of robots allowing to explore of a given grid. Our results show that except in two particular cases, 3 robots are necessary and sufficient to deterministically explore a grid of at least three nodes. The optimal number of robots for the two remaining cases is: 4 for the (2,2)-Grid and 5 for the (3,3)-Grid.

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"
    - "on the synthesis of mobile robots algorithms the case of ring gathering"
    - "certified impossibility results for byzantine tolerant mobile robots"
    - "the gathering problem for two oblivious robots with unreliable compasses"

Connected through hyperedge HE-2 (induced by source paper "coding theory for noiseless channels realized by anonymous oblivious mobile robots"):
  with members:
    - "exploration of finite 2d square grid by a metamorphic robotic system"
    - "turingmobile a turing machine of oblivious mobile robots with limited visibility and its applications"
    - "plane formation by synchronous mobile robots in the three dimensional euclidean space"
    - "getting close without touching near gathering for autonomous mobile robots"
    - "leader election problem versus pattern formation problem"

Connected through hyperedge HE-3 (induced by source paper "dispersion of mobile robots the power of randomness"):
  with members:
    - "efficient dispersion of mobile robots on graphs"
    - "dispersion of mobile robots a study of memory time trade offs"
    - "optimal deterministic ring exploration with oblivious asynchronous robots"

Connected through hyperedge HE-4 (induced by source paper "infinite grid exploration by disoriented robots"):
  with members:
    - "arbitrary pattern formation on infinite grid by asynchronous oblivious robots"
    - "mutual visibility by luminous robots without collisions"
    - "circle formation of weak robots and lyndon words"

Connected through hyperedge HE-5 (induced by source paper "exploration of finite 2d square grid by a metamorphic robotic system"):
  with members:
    - "on the transformation capability of feasible mechanisms for programmable matter"
    - "turingmobile a turing machine of oblivious mobile robots with limited visibility and its applications"
    - "shape formation by programmable particles"
    - "universal coating for programmable matter"
    - "plane formation by synchronous mobile robots in the three dimensional euclidean space"
    - "connectivity preserving network transformers"

Connected through hyperedge HE-6 (induced by source paper "ring exploration with myopic luminous robots"):
  with members:
    - "optimally gathering two robots"
    - "plane formation by synchronous mobile robots in the three dimensional euclidean space"

Connected through hyperedge HE-7 (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"
    - "on the synthesis of mobile robots algorithms the case of ring gathering"
    - "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"

Connected through hyperedge HE-8 (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"
    - "on the synthesis of mobile robots algorithms the case of ring gathering"
    - "certified impossibility results for byzantine tolerant 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)