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 "asynchronous approach in the plane a deterministic polynomial algorithm"):
  Abstract: In this paper we study the task of approach of two mobile agents having the same limited range of vision and moving asynchronously in the plane. This task consists in getting them in finite time within each other's range of vision. The agents execute the same deterministic algorithm and are assumed to have a compass showing the cardinal directions as well as a unit measure. On the other hand, they do not share any global coordinates system (like GPS), cannot communicate and have distinct labels. Each agent knows its label but does not know the label of the other agent or the initial position of the other agent relative to its own. The route of an agent is a sequence of segments that are subsequently traversed in order to achieve approach. For each agent, the computation of its route depends only on its algorithm and its label. An adversary chooses the initial positions of both agents in the plane and controls the way each of them moves along every segment of the routes, in particular by arbitrarily varying the speeds of the agents. A deterministic approach algorithm is a deterministic algorithm that always allows two agents with any distinct labels to solve the task of approach regardless of the choices and the behavior of the adversary. The cost of a complete execution of an approach algorithm is the length of both parts of route travelled by the agents until approach is completed. Let $\Delta$ and $l$ be the initial distance separating the agents and the length of the shortest label, respectively. Assuming that $\Delta$ and $l$ are unknown to both agents, does there exist a deterministic approach algorithm always working at a cost that is polynomial in $\Delta$ and $l$? In this paper, we provide a positive answer to the above question by designing such an algorithm.

Includes members:
  Member "rendezvous in networks in spite of delay faults":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deterministic meeting of sniffing agents in the plane")
  Member "byzantine gathering in networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "want to gather no need to chatter")
  Member "getting close without touching near gathering for autonomous mobile robots":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "positional encoding by robots with non rigid movements")
  Member "time versus cost tradeoffs for deterministic rendezvous in networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "byzantine gathering in polynomial time")
  Member "mobile agents rendezvous in spite of a malicious agent":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "symmetric rendezvous with advice how to rendezvous in a disk")
  Member "rendezvous of distance aware mobile agents in unknown graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deterministic meeting of sniffing agents in the plane")
  Member "fast rendezvous with advice":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "byzantine gathering in networks")
  Member "how to meet asynchronously at polynomial cost":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "want to gather no need to chatter")

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)