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: "broadcasting in ad hoc multiple access channels"
  Abstract: We study broadcast in multiple access channels in dynamic adversarial settings. There is an unbounded supply of anonymous stations attached to a synchronous channel. There is an adversary who injects packets into stations to be broadcast on the channel. The adversary is restricted by injection rate, burstiness, and by how many passive stations can be simultaneously activated by providing them with packets. We consider deterministic distributed broadcast algorithms, which are further categorized by their properties. We investigate for which injection rates can algorithms attain bounded packet latency, when adversaries are restricted to be able to activate at most one station per round. The rates of algorithms we present make the increasing sequence consisting of 1 3 , 3 8 and 1 2 , reflecting the additional features of algorithms. We show that injection rate 3 4 cannot be handled with bounded packet latency.

Connected through hyperedge HE-1 (induced by source paper "energy efficient adversarial routing in shared channels"):
  with members:
    - "the energy complexity of broadcast"
    - "packet latency of deterministic broadcasting in adversarial multiple access channels"
    - "exponential separations in the energy complexity of leader election"
    - "adversarial multiple access channels with individual injection rates"
    - "a survey of green networking research"
    - "maximum throughput of multiple access channels in adversarial environments"

Connected through hyperedge HE-2 (induced by source paper "packet latency of deterministic broadcasting in adversarial multiple access channels"):
  with members:
    - "randomized communication in radio networks"
    - "scalable wake up of multi channel single hop radio networks"
    - "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 "scalable wake up of multi channel single hop radio networks"):
  with members:
    - "packet latency of deterministic broadcasting in adversarial multiple access channels"
    - "uniform information exchange in multi channel wireless ad hoc networks"
    - "adversarial multiple access channels with individual injection rates"
    - "unbounded contention resolution in multiple access channels"
    - "dynamic sharing of a multiple access channel"
    - "maximum throughput of multiple access channels in adversarial environments"

Connected through hyperedge HE-4 (induced by source paper "stability of adversarial routing with feedback"):
  with members:
    - "stability of the max weight protocol in adversarial wireless networks"
    - "maximum throughput of multiple access channels in adversarial environments"
    - "adaptive uncertainty resolution in bayesian combinatorial optimization problems"

Connected through hyperedge HE-5 (induced by source paper "adversarial multiple access channels with individual injection rates"):
  with members:
    - "randomized communication in radio networks"
    - "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)