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 "fast structuring of radio networks large for multi message communications"):
  Abstract: We introduce collision free layerings as a powerful way to structure radio networks. These layerings can replace hard-to-compute BFS-trees in many contexts while having an efficient randomized distributed construction. We demonstrate their versatility by using them to provide near optimal distributed algorithms for several multi-message communication primitives.#R##N##R##N#Designing efficient communication primitives for radio networks has a rich history that began 25 years ago when Bar-Yehuda et al. introduced fast randomized algorithms for broadcasting and for constructing BFS-trees. Their BFS-tree construction time was OD log2 n rounds, where D is the network diameter and n is the number of nodes. Since then, the complexity of a broadcast has been resolved to be    $T_{BC} = \ThetaD \log \frac{n}{D} + \log^2 n$    rounds. On the other hand, BFS-trees have been used as a crucial building block for many communication primitives and their construction time remained a bottleneck for these primitives.#R##N##R##N#We introduce collision free layerings that can be used in place of BFS-trees and we give a randomized construction of these layerings that runs in nearly broadcast time, that is, w.h.p. in    $T_{Lay} = OD \log \frac{n}{D} + \log^{2+\epsilon} n$    rounds for any constant e>0. We then use these layerings to obtain: 1 A randomized algorithm for gathering k messages running w.h.p. in OT Lay +k rounds. 2 A randomized k-message broadcast algorithm running w.h.p. in OT Lay +k logn rounds. These algorithms are optimal up to the small difference in the additive poly-logarithmic term between T BC and T Lay . Moreover, they imply the first optimal On logn round randomized gossip algorithm.

Includes members:
  Member "randomized broadcast in radio networks with collision detection":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "competitive broadcast against adaptive adversary in multi channel radio networks")
  Member "a bound on the throughput of radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a local broadcast layer for the sinr network model")
  Member "near optimal leader election in multi hop radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed voting in beep model")
  Member "analyzing network coding gossip made easy":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "synchronous transmissions in low power wireless a survey of communication protocols and network services")

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)