human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "lower bounds for searching robots some faulty"):
  Abstract: Suppose we are sending out $k$ robots from $0$ to search the real line at constant speed (with turns) to find a target at an unknown location; $f$ of the robots are faulty, meaning that they fail to report the target although visiting its location (called crash type). The goal is to find the target in time at most $\lambda |d|$, if the target is located at $d$, $|d| \ge 1$, for $\lambda$ as small as possible. We show that it cannot be achieved for $\lambda < 2\frac{(1+\rho)^{1+\rho}}{\rho^\rho}+1$, $\rho := 2\frac{f+1}{k} -1$, which is tight due to earlier work. #R##N#This also gives some better than previously known lower bounds for so-called Byzantine-type faulty robots (that may actually wrongly report a target).

Includes members:
  Member "search on a line by byzantine robots":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy consumption of group search on a line")
  Member "revisiting the problem of searching on a line":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "priority evacuation from a disk using mobile robots")
  Member "collaborative search on the plane without communication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "probabilistically faulty searching on a half line")
  Member "online searching with turn cost":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "probabilistically faulty searching on a half line")
  Member "optimal constructions of hybrid algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal strategies for weighted ray search")

Question: Please tell me which class the source paper 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.RO(Robotics)