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 "using time to break symmetry universal deterministic anonymous rendezvous"):
  Abstract: Two anonymous mobile agents navigate synchronously in an anonymous graph and have to meet at a node, using a deterministic algorithm. This is a symmetry breaking task called rendezvous, equivalent to the fundamental task of leader election between the agents. When is this feasible in a completely anonymous environment? It is known that agents can always meet if their initial positions are nonsymmetric, and that if they are symmetric and agents start simultaneously then rendezvous is impossible. What happens for symmetric initial positions with non-simultaneous start? Can symmetry between the agents be broken by the delay between their starting times? #R##N#In order to answer these questions, we consider {\em space-time initial configurations} (abbreviated by STIC). A STIC is formalized as $[(u,v),\delta]$, where $u$ and $v$ are initial nodes of the agents in some graph and $\delta$ is a non-negative integer that represents the difference between their starting times. A STIC is {\em feasible} if there exists a deterministic algorithm, even dedicated to this particular STIC, which accomplishes rendezvous for it. Our main result is a characterization of all feasible STICs and the design of a universal deterministic algorithm that accomplishes rendezvous for all of them without {\em any } a priori knowledge of the agents. Thus, as far as feasibility is concerned, we completely solve the problem of symmetry breaking between two anonymous agents in anonymous graphs. Moreover, we show that such a universal algorithm cannot work for all feasible STICs in time polynomial in the initial distance between the agents.

Includes members:
  Member "byzantine gathering in networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "want to gather no need to chatter")
  Member "how to meet asynchronously at polynomial cost":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "want to gather no need to chatter")
  Member "delays induce an exponential memory gap for rendezvous in trees":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "want to gather no need to chatter")
  Member "anonymous meeting in networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (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)