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: "online searching with turn cost"
  Abstract: We consider the problem of searching for an object on a line at an unknown distance OPT from the original position of the searcher, in the presence of a cost of d for each time the searcher changes direction. This is a generalization of the well-studied linear-search problem. We describe a strategy that is guaranteed to find the object at a cost of at most 9*OPT + 2d, which has the optimal competitive ratio 9 with respect to OPT plus the minimum corresponding additive term. Our argument for upper and lower bound uses an infinite linear program, which we solve by experimental solution of an infinite series of approximating finite linear programs, estimating the limits, and solving the resulting recurrences. We feel that this technique is interesting in its own right and should help solve other searching problems. In particular, we consider the star search or cow-path problem with turn cost, where the hidden object is placed on one of m rays emanating from the original position of the searcher. For this problem we give a tight bound of (1+(2(m^m)/((m-1)^(m-1))) OPT + m ((m/(m-1))^(m-1) - 1) d. We also discuss tradeoff between the corresponding coefficients, and briefly consider randomized strategies on the line.

Connected through hyperedge HE-1 (induced by source paper "probabilistically faulty searching on a half line"):
  with members:
    - "energy consumption of group search on a line"
    - "average case worst case tradeoffs for evacuating 2 robots from the disk in the face to face model"
    - "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"
    - "further connections between contract scheduling and ray searching problems"
    - "collaborative search on the plane without communication"

Connected through hyperedge HE-2 (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"
    - "search on a line by byzantine robots"
    - "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"

Connected through hyperedge HE-3 (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 on a line by byzantine robots"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "evacuation of equilateral triangles by mobile agents of limited communication range"):
  with members:
    - "evacuating robots from a disk using face to face communication"
    - "evacuation of rectilinear polygons"

Connected through hyperedge HE-5 (induced by source paper "priority evacuation from a disk using mobile robots"):
  with members:
    - "god save the queen"
    - "fast two robot disk evacuation with wireless communication"
    - "search and fetch with 2 robots on a disk wireless and face to face communication models"
    - "revisiting the problem of searching on a line"
    - "fast rendezvous on a cycle by agents with different speeds"

Connected through hyperedge HE-6 (induced by source paper "the ants problem"):
  with members:
    - "parallel linear search with no coordination for a randomly placed treasure"
    - "parallel exhaustive search without coordination"
    - "trade offs between selection complexity and performance when searching the plane without communication"
    - "toward more localized local algorithms removing assumptions concerning global knowledge"
    - "memory lower bounds for randomized collaborative search and applications to biology"
    - "collaborative search on the plane without communication"
    - "beeping a maximal independent set"
    - "physarum can compute shortest paths"

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

Connected through hyperedge HE-8 (induced by source paper "optimal strategies for weighted ray search"):
  with members:
    - "further connections between contract scheduling and ray searching problems"
    - "optimal constructions of hybrid algorithms"
    - "the k server dual and loose competitiveness for paging"

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)