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: "the gathering problem for two oblivious robots with unreliable compasses"
  Abstract: Anonymous mobile robots are often classified into synchronous, semi-synchronous and asynchronous robots when discussing the pattern formation problem. For semi-synchronous robots, all patterns formable with memory are also formable without memory, with the single exception of forming a point (i.e., the gathering) by two robots. However, the gathering problem for two semi-synchronous robots without memory is trivially solvable when their local coordinate systems are consistent, and the impossibility proof essentially uses the inconsistencies in their coordinate systems. Motivated by this, this paper investigates the magnitude of consistency between the local coordinate systems necessary and sufficient to solve the gathering problem for two oblivious robots under semi-synchronous and asynchronous models. To discuss the magnitude of consistency, we assume that each robot is equipped with an unreliable compass, the bearings of which may deviate from an absolute reference direction, and that the local coordinate system of each robot is determined by its compass. We consider two families of unreliable compasses, namely,static compasses with constant bearings, and dynamic compasses the bearings of which can change arbitrarily. #R##N#For each of the combinations of robot and compass models, we establish the condition on deviation \phi that allows an algorithm to solve the gathering problem, where the deviation is measured by the largest angle formed between the x-axis of a compass and the reference direction of the global coordinate system: \phi < \pi/2 for semi-synchronous and asynchronous robots with static compasses, \phi < \pi/4 for semi-synchronous robots with dynamic compasses, and \phi < \pi/6 for asynchronous robots with dynamic compasses. Except for asynchronous robots with dynamic compasses, these sufficient conditions are also necessary.

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"
    - "optimal grid exploration by asynchronous oblivious robots"

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

Connected through hyperedge HE-3 (induced by source paper "optimal rendezvous mathcal l algorithms for asynchronous mobile robots with external lights"):
  with members:
    - "gathering problems for autonomous mobile robots with lights"
    - "optimally gathering two robots"
    - "rendezvous of two robots with visible bits"

Connected through hyperedge HE-4 (induced by source paper "gathering problems for autonomous mobile robots with lights"):
  with members:
    - "optimally gathering two robots"
    - "rendezvous of two robots with visible bits"

Connected through hyperedge HE-5 (induced by source paper "fault induced dynamics of oblivious robots on a line"):
  with members:
    - "come together multi agent geometric consensus gathering rendezvous clustering aggregation"
    - "erratic extremism causes dynamic consensus a new model for one dimensional opinion dynamics"
    - "plane formation by synchronous mobile robots in the three dimensional euclidean space"
    - "distributed computing by mobile robots uniform circle formation"
    - "fault and byzantine tolerant self stabilizing mobile robots gathering feasibility study"
    - "distributed computing by mobile robots solving the uniform circle formation problem"
    - "certified impossibility results for byzantine tolerant mobile robots"
    - "the random bit complexity of mobile robots scattering"

Connected through hyperedge HE-6 (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"
    - "asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection"

Connected through hyperedge HE-7 (induced by source paper "gathering in the plane of location aware robots in the presence of spies"):
  with members:
    - "search on a line by byzantine robots"
    - "asymptotically optimal gathering on a grid"
    - "certified universal gathering in r 2 for oblivious mobile robots"

Connected through hyperedge HE-8 (induced by source paper "gathering anonymous oblivious robots on a grid"):
  with members:
    - "asymptotically optimal gathering on a grid"
    - "gathering a closed chain of robots on a grid"

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)