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: "search on a line by byzantine robots"
  Abstract: We consider the problem of fault-tolerant parallel search on an infinite line by $n$ robots. Starting from the origin, the robots are required to find a target at an unknown location. The robots can move with maximum speed $1$ and can communicate in wireless mode among themselves. However, among the $n$ robots, there are $f$ robots that exhibit {\em byzantine faults}. A faulty robot can fail to report the target even after reaching it, or it can make malicious claims about having found the target when in fact it has not. Given the presence of such faulty robots, the search for the target can only be concluded when the non-faulty robots have sufficient verification that the target has been found. We aim to design algorithms that minimize the value of $S_d(n,f)$, the time to find a target at a distance $d$ from the origin by $n$ robots among which $f$ are faulty. We give several different algorithms whose running time depends on the ratio $f/n$, the density of faulty robots, and also prove lower bounds. Our algorithms are optimal for some densities of faulty robots.

Connected through hyperedge HE-1 (induced by source paper "energy consumption of group search on a line"):
  with members:
    - "average case worst case tradeoffs for evacuating 2 robots from the disk in the face to face model"
    - "god save the queen"
    - "priority evacuation from a disk using mobile robots"
    - "linear search with terrain dependent speeds"
    - "fast two robot disk evacuation with wireless communication"
    - "search and fetch with 2 robots on a disk wireless and face to face communication models"
    - "evacuating robots from a disk using face to face communication"
    - "online searching with turn cost"

Connected through hyperedge HE-2 (induced by source paper "time energy tradeoffs for evacuation by two robots in the wireless model"):
  with members:
    - "average case worst case tradeoffs for evacuating 2 robots from the disk in the face to face model"
    - "god save the queen"
    - "priority evacuation from a disk using mobile robots"
    - "linear search with terrain dependent speeds"
    - "search and fetch with 2 robots on a disk wireless and face to face communication models"
    - "evacuating robots from a disk using face to face communication"
    - "online searching with turn cost"

Connected through hyperedge HE-3 (induced by source paper "chauffeuring a crashed robot from a disk"):
  with members:
    - "evacuating two robots from a disk a second cut"
    - "average case worst case tradeoffs for evacuating 2 robots from the disk in the face to face model"
    - "god save the queen"
    - "priority evacuation from a disk using mobile robots"
    - "lower bounds for searching robots some faulty"

Connected through hyperedge HE-4 (induced by source paper "average case worst case tradeoffs for evacuating 2 robots from the disk in the face to face model"):
  with members:
    - "god save the queen"
    - "priority evacuation from a disk using mobile robots"
    - "searching with advice robot fence jumping"
    - "search and fetch with 2 robots on a disk wireless and face to face communication models"
    - "evacuation of rectilinear polygons"

Connected through hyperedge HE-5 (induced by source paper "byzantine gathering in polynomial time"):
  with members:
    - "byzantine gathering in networks"
    - "time versus cost tradeoffs for deterministic rendezvous in networks"
    - "how to meet asynchronously at polynomial cost"
    - "how to meet asynchronously almost everywhere"

Connected through hyperedge HE-6 (induced by source paper "lower bounds for searching robots some faulty"):
  with members:
    - "revisiting the problem of searching on a line"
    - "collaborative search on the plane without communication"
    - "online searching with turn cost"
    - "optimal constructions of hybrid algorithms"

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

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.DS(Data Structures and Algorithms)