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: "randomized communication in radio networks"
  Abstract: A communication network is called a radio network if its nodes exchange messages in the following restricted way. First, a send operation performed by a node delivers copies of the same message to all directly reachable nodes. Secondly, a node can successfully receive an incoming message only if exactly one of its neighbors sent a message in that step. It is this semantics of how ports at nodes send and receive messages that defines the networks rather than the fact that only radio waves are used as a medium of communication; but if that is the case then just a single frequency is used. We discuss algorithmic aspects of exchanging information in such networks, concentrating on distributed randomized protocols. Specific problems and solutions depend a lot on the topology of the underlying reachability graph and how much the nodes know about it. In single-hop networks each pair of nodes can communicate directly. This kind of networks is also known as the multiple access channel. Popular broadcasting protocols used on such channels are Aloha and the exponential backoff. Multi-hop networks may have arbitrary topology and packets need to be routed hopping through a sequence of adjacent nodes. Distributed protocols run by such networks are usually robust enough not to expect the nodes to know their neighbors. These ad-hoc networks and protocols model the situation when nodes are mobile and do not rely on a fixed infrastructure.

Connected through hyperedge HE-1 (induced by source paper "packet oblivious stable routing in multi hop wireless networks"):
  with members:
    - "packet latency of deterministic broadcasting in adversarial multiple access channels"
    - "routing in wireless networks with interferences"
    - "universal routing in multi hop radio networks"
    - "stability of the max weight protocol in adversarial wireless networks"
    - "bounds on stability and latency in wireless communication"

Connected through hyperedge HE-2 (induced by source paper "packet latency of deterministic broadcasting in adversarial multiple access channels"):
  with members:
    - "scalable wake up of multi channel single hop radio networks"
    - "broadcasting in ad hoc multiple access channels"
    - "competitive mac under adversarial sinr"
    - "adversarial multiple access channels with individual injection rates"
    - "unbounded contention resolution in multiple access channels"
    - "maximum throughput of multiple access channels in adversarial environments"
    - "source routing and scheduling in packet networks"

Connected through hyperedge HE-3 (induced by source paper "fault tolerant parallel scheduling of arbitrary length jobs on a shared channel"):
  with members:
    - "ordered and delayed adversaries and how to work against them on shared channel"
    - "performing work efficiently in the presence of faults"

Connected through hyperedge HE-4 (induced by source paper "naming a channel with beeps"):
  with members:
    - "asynchronous broadcasting with bivalent beeps"
    - "scalable wake up of multi channel single hop radio networks"
    - "feedback from nature simple randomised distributed algorithms for maximal independent set selection and greedy colouring"
    - "the computational power of beeps"
    - "anonymous processors with synchronous shared memory"
    - "communicating with beeps"
    - "randomized broadcast in radio networks with collision detection"
    - "beeping a maximal independent set"

Connected through hyperedge HE-5 (induced by source paper "counting in one hop beeping networks"):
  with members:
    - "design patterns in beeping algorithms"
    - "scalable wake up of multi channel single hop radio networks"
    - "design patterns in beeping algorithms examples emulation and analysis"
    - "the computational power of beeps"
    - "naming and counting in anonymous unknown dynamic networks"
    - "beeping a maximal independent set"
    - "feedback from nature an optimal distributed algorithm for maximal independent set selection"
    - "deploying wireless networks with beeps"

Connected through hyperedge HE-6 (induced by source paper "design patterns in beeping algorithms examples emulation and analysis"):
  with members:
    - "counting in one hop beeping networks"
    - "feedback from nature simple randomised distributed algorithms for maximal independent set selection and greedy colouring"
    - "the computational power of beeps"
    - "randomized broadcast in radio networks with collision detection"
    - "the locality of distributed symmetry breaking"
    - "beeping a maximal independent set"
    - "feedback from nature an optimal distributed algorithm for maximal independent set selection"
    - "deploying wireless networks with beeps"

Connected through hyperedge HE-7 (induced by source paper "on distributed computing with beeps"):
  with members:
    - "randomized broadcast in radio networks with collision detection"
    - "beeping a maximal independent set"
    - "feedback from nature an optimal distributed algorithm for maximal independent set selection"
    - "deploying wireless networks with beeps"

Connected through hyperedge HE-8 (induced by source paper "broadcasting in ad hoc multiple access channels"):
  with members:
    - "adversarial multiple access channels with individual injection rates"
    - "dynamic sharing of a multiple access channel"
    - "maximum throughput of multiple access channels in adversarial environments"

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)