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: "certified impossibility results for byzantine tolerant mobile robots"
  Abstract: We propose a framework to build formal developments for robot networks using the COQ proof assistant, to state and to prove formally various properties. We focus in this paper on impossibility proofs, as it is natural to take advantage of the COQ higher order calculus to reason about algorithms as abstract objects. We present in particular formal proofs of two impossibility results forconvergence of oblivious mobile robots if respectively more than one half and more than one third of the robots exhibit Byzantine failures, starting from the original theorems by Bouzid et al.. Thanks to our formalization, the corresponding COQ developments are quite compact. To our knowledge, these are the first certified (in the sense of formally proved) impossibility results for robot networks.

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"
    - "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 "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"
    - "the random bit complexity of mobile robots scattering"
    - "the gathering problem for two oblivious robots with unreliable compasses"

Connected through hyperedge HE-3 (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"
    - "rendezvous of two robots with visible bits"
    - "optimal grid exploration by asynchronous oblivious robots"

Connected through hyperedge HE-4 (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"
    - "optimal grid exploration by asynchronous oblivious robots"

Connected through hyperedge HE-5 (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"
    - "on the synthesis of mobile robots algorithms the case of ring gathering"
    - "impossibility of gathering a certification"
    - "optimal grid exploration by asynchronous oblivious robots"
    - "the gathering problem for two oblivious robots with unreliable compasses"

Connected through hyperedge HE-6 (induced by source paper "a certified universal gathering algorithm for oblivious mobile robots"):
  with members:
    - "on the synthesis of mobile robots algorithms the case of ring gathering"
    - "impossibility of gathering a certification"
    - "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 "starl towards a unified framework for programming simulating and verifying distributed robotic systems"):
  with members:
    - "on the synthesis of mobile robots algorithms the case of ring gathering"

Connected through hyperedge HE-8 (induced by source paper "on the synthesis of mobile robots algorithms the case of ring gathering"):
  with members:
    - "gathering an even number of robots in an odd ring without global multiplicity detection"
    - "optimal grid exploration by asynchronous oblivious robots"
    - "asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection"

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.LO(Logic in Computer Science)