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 "memory lower bounds for randomized collaborative search and applications to biology"):
  Abstract: Initial knowledge regarding group size can be crucial for collective performance. We study this relation in the context of the {\em Ants Nearby Treasure Search (ANTS)} problem \cite{FKLS}, which models natural cooperative foraging behavior such as that performed by ants around their nest. In this problem, $k$ (probabilistic) agents, initially placed at some central location, collectively search for a treasure on the two-dimensional grid. The treasure is placed at a target location by an adversary and the goal is to find it as fast as possible as a function of both $k$ and $D$, where $D$ is the (unknown) distance between the central location and the target. It is easy to see that $T=\Omega(D+D^2/k)$ time units are necessary for finding the treasure. Recently, it has been established that $O(T)$ time is sufficient if the agents know their total number $k$ (or a constant approximation of it), and enough memory bits are available at their disposal \cite{FKLS}. In this paper, we establish lower bounds on the agent memory size required for achieving certain running time performances. To the best our knowledge, these bounds are the first non-trivial lower bounds for the memory size of probabilistic searchers. For example, for every given positive constant $\epsilon$, terminating the search by time $O(\log^{1-\epsilon} k \cdot T)$ requires agents to use $\Omega(\log\log k)$ memory bits. Such distributed computing bounds may provide a novel, strong tool for the investigation of complex biological systems.

Includes members:
  Member "toward more localized local algorithms removing assumptions concerning global knowledge":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "faster deterministic distributed coloring through recursive list coloring")
  Member "collaborative search on the plane without communication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "probabilistically faulty searching on a half line")
  Member "physarum can compute shortest paths":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "improved convergence for ell_ infty and ell_1 regression via iteratively reweighted least squares")
  Member "local distributed decision":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "local distributed algorithms in highly dynamic networks")
  Member "online searching with turn cost":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "probabilistically faulty searching on a half 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.DC(Distributed, Parallel, and Cluster Computing)