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 "meeting in a polygon by anonymous oblivious robots"):
  Abstract: The Meeting problem for $k\geq 2$ searchers in a polygon $P$ (possibly with holes) consists in making the searchers move within $P$, according to a distributed algorithm, in such a way that at least two of them eventually come to see each other, regardless of their initial positions. The polygon is initially unknown to the searchers, and its edges obstruct both movement and vision. Depending on the shape of $P$, we minimize the number of searchers $k$ for which the Meeting problem is solvable. Specifically, if $P$ has a rotational symmetry of order $\sigma$ (where $\sigma=1$ corresponds to no rotational symmetry), we prove that $k=\sigma+1$ searchers are sufficient, and the bound is tight. Furthermore, we give an improved algorithm that optimally solves the Meeting problem with $k=2$ searchers in all polygons whose barycenter is not in a hole (which includes the polygons with no holes). Our algorithms can be implemented in a variety of standard models of mobile robots operating in Look-Compute-Move cycles. For instance, if the searchers have memory but are anonymous, asynchronous, and have no agreement on a coordinate system or a notion of clockwise direction, then our algorithms work even if the initial memory contents of the searchers are arbitrary and possibly misleading. Moreover, oblivious searchers can execute our algorithms as well, encoding information by carefully positioning themselves within the polygon. This code is computable with basic arithmetic operations, and each searcher can geometrically construct its own destination point at each cycle using only a compass. We stress that such memoryless searchers may be located anywhere in the polygon when the execution begins, and hence the information they initially encode is arbitrary. Our algorithms use a self-stabilizing map construction subroutine which is of independent interest.

Includes members:
  Member "asynchronous approach in the plane a deterministic polynomial algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "latecomers help to meet deterministic anonymous gathering in the plane")
  Member "mutual visibility by luminous robots without collisions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "arbitrary pattern formation by asynchronous opaque robots with lights")
  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 "distributed computing by mobile robots uniform circle formation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "arbitrary pattern formation on infinite grid by asynchronous oblivious robots")
  Member "how to meet asynchronously at polynomial cost":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "want to gather no need to chatter")
  Member "how to meet asynchronously almost everywhere":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "positional encoding by robots with non rigid movements")
  Member "asynchronous deterministic rendezvous in bounded terrains":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "positional encoding by robots with non rigid movements")

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.DC(Distributed, Parallel, and Cluster Computing)