human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "broadcasting in noisy radio networks"):
  with members:
    - "randomized broadcast in radio networks with collision detection"
    - "broadcast throughput in radio networks routing vs network coding"
    - "a new perspective on vertex connectivity"
    - "bounds on contention management in radio networks"
    - "analyzing network coding gossip made easy"
    - "on distributed computation in noisy random planar networks"

Connected through hyperedge HE-2 (induced by source paper "latency optimal broadcasting in noisy wireless mesh networks"):
  with members:
    - "broadcasting in noisy radio networks"
    - "randomized broadcast in radio networks with collision detection"
    - "broadcast throughput in radio networks routing vs network coding"
    - "analyzing network coding gossip made easy"

Connected through hyperedge HE-3 (induced by source paper "randomized broadcast in radio networks with collision detection"):
  with members:
    - "broadcast throughput in radio networks routing vs network coding"
    - "near optimal leader election in multi hop radio networks"
    - "analyzing network coding gossip made easy"

Connected through hyperedge HE-4 (induced by source paper "near optimal leader election in multi hop radio networks"):
  with members:
    - "randomized broadcast in radio networks with collision detection"
    - "broadcast throughput in radio networks routing vs network coding"
    - "distributed deterministic broadcasting in uniform power ad hoc wireless networks"
    - "bounded contention coding for wireless networks in the high snr regime"
    - "beeping a maximal independent set"
    - "wireless connectivity and capacity"
    - "analyzing network coding gossip made easy"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"

Connected through hyperedge HE-5 (induced by source paper "analyzing network coding gossip made easy"):
  with members:
    - "optimal gossip with direct addressing"
    - "broadcast throughput in radio networks routing vs network coding"
    - "tight bounds for rumor spreading with vertex expansion"
    - "lower bounds on information dissemination in dynamic networks"
    - "bounded contention coding for wireless networks in the high snr regime"
    - "tighter worst case bounds on algebraic gossip"
    - "simple fast and deterministic gossip and rumor spreading"
    - "network coded gossip with correlated data"

Question: Please tell me which class the center node 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)