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 "probabilistically faulty searching on a half line"):
  Abstract: We study $p$-Faulty Search, a variant of the classic cow-path optimization problem, where a unit speed robot searches the half-line (or $1$-ray) for a hidden item. The searcher is probabilistically faulty, and detection of the item with each visitation is an independent Bernoulli trial whose probability of success $p$ is known. The objective is to minimize the worst case expected detection time, relative to the distance of the hidden item to the origin. A variation of the same problem was first proposed by Gal in 1980. Then in 2003, Alpern and Gal [The Theory of Search Games and Rendezvous] proposed a so-called monotone solution for searching the line ($2$-rays); that is, a trajectory in which the newly searched space increases monotonically in each ray and in each iteration. Moreover, they conjectured that an optimal trajectory for the $2$-rays problem must be monotone. We disprove this conjecture when the search domain is the half-line ($1$-ray). We provide a lower bound for all monotone algorithms, which we also match with an upper bound. Our main contribution is the design and analysis of a sequence of refined search strategies, outside the family of monotone algorithms, which we call $t$-sub-monotone algorithms. Such algorithms induce performance that is strictly decreasing with $t$, and for all $p \in (0,1)$. The value of $t$ quantifies, in a certain sense, how much our algorithms deviate from being monotone, demonstrating that monotone algorithms are sub-optimal when searching the half-line.

Includes members:
  Member "energy consumption of group search on a line":
    also connected through other hyperedges:
      (none)
  Member "average case worst case tradeoffs for evacuating 2 robots from the disk in the face to face model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy consumption of group search on a line")
  Member "linear search with terrain dependent speeds":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy consumption of group search on a line")
  Member "fast two robot disk evacuation with wireless communication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "energy consumption of group search on a line")
  Member "search and fetch with 2 robots on a disk wireless and face to face communication models":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "energy consumption of group search on a line")
  Member "further connections between contract scheduling and ray searching problems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "interruptible algorithms for multiproblem solving")
  Member "collaborative search on the plane without communication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a coordinated search strategy for multiple solitary robots an extension")
  Member "online searching with turn cost":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "energy consumption of group search on a line")

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