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: "adversarial multiple access channels with individual injection rates"
  Abstract: We study deterministic distributed broadcasting in synchronous multiple-access channels. Packets are injected into $n$ nodes by a window-type adversary that is constrained by a window $w$ and injection rates individually assigned to all nodes. We investigate what queue size and packet latency can be achieved with the maximum aggregate injection rate of one packet per round, depending on properties of channels and algorithms. We give a non-adaptive algorithm for channels with collision detection and an adaptive algorithm for channels without collision detection that achieve $O(\min(n+w,w\log n))$ packet latency. We show that packet latency has to be either $\Omega(w \max (1,\log_w n))$, when $w\le n$, or $\Omega(w+n)$, when $w>n$, as a matching lower bound to these algorithms. We develop a non-adaptive algorithm for channels without collision detection that achieves $O(n+w)$ queue size and $O(nw)$ packet latency. This is in contrast with the adversarial model of global injection rates, in which non-adaptive algorithms with bounded packet latency do not exist [18]. Our algorithm avoids collisions produced by simultaneous transmissions; we show that any algorithm with this property must have $\Omega(nw)$ 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"
    - "broadcasting in ad hoc multiple access channels"
    - "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"
    - "broadcasting in ad hoc multiple access channels"
    - "competitive mac under adversarial sinr"
    - "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 "is our model for contention resolution wrong"):
  with members:
    - "competitive mac under adversarial sinr"
    - "sinr diagrams towards algorithmically usable sinr models of wireless networks"

Connected through hyperedge HE-4 (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"
    - "broadcasting in ad hoc multiple access channels"
    - "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-5 (induced by source paper "a common information based multiple access protocol achieving full throughput and linear delay"):
  with members:
    - "decentralized stochastic control with partial history sharing a common information approach"
    - "approaching throughput optimality in distributed csma scheduling algorithms with collisions"
    - "fast mixing of parallel glauber dynamics and low delay csma scheduling"
    - "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless networks"
    - "randomized scheduling algorithm for queueing networks"

Connected through hyperedge HE-6 (induced by source paper "broadcasting in ad hoc multiple access channels"):
  with members:
    - "randomized communication in radio networks"
    - "dynamic sharing of a multiple access channel"
    - "maximum throughput of multiple access channels in adversarial environments"

Connected through hyperedge HE-7 (induced by source paper "how to scale exponential backoff"):
  with members:
    - "making evildoers pay resource competitive broadcast in sensor networks"

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.DC(Distributed, Parallel, and Cluster Computing)