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 "ad hoc network unicast in time o log log n using beamforming"):
  Abstract: We investigate the unicast problem for ad-hoc networks in the plane using MIMO techniques. In particular, we use the multi-node beamforming gain and present a self-synchronizing algorithm for the necessary carrier phase synchronization. First, we consider $n$ nodes in a grid where the transmission power per node is restricted to reach the neighboring node. We extend the idea of multi-hop routing and relay the message by multiple nodes attaining joint beamforming gain with higher reception range. In each round, the message is repeated by relay nodes at dedicated positions after a fixed waiting period. Such simple algorithms can send a message from any node to any other node in time $\mathcal{O}(\log \log n - \log \lambda)$ and with asymptotical energy $\mathcal{O}(\sqrt{n})$, the same energy an optimal multi-hop routing strategy needs using short hops between source and target. Here, $\lambda$ denotes the wavelength of the carrier. For $\lambda \in \Theta(1)$ we prove a tight lower time bound of $\Omega(\log \log n)$. Then, we consider $n$ randomly distributed nodes in a square of area $n$ and we show for a transmission range of $\Theta(\sqrt{\log n})$ and for a wavelength of $\lambda = \Omega(\log^{-1/2}n)$ that the unicast problem can be solved in $\mathcal{O}(\log \log n)$ rounds as well. The corresponding transmission energy increases to $\mathcal{O}(\sqrt{n} \log n)$. Finally, we present simulation results visualizing the nature of our algorithms.

Includes members:
  Member "on capacity scaling in arbitrary wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "throughput scaling of covert communication over wireless adhoc networks")
  Member "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "wireless mesh networking with devices equipped with multi connectivity")

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.NI(Networking and Internet Architecture)