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: "a bound on the throughput of radio networks"
  Abstract: We consider the well-studied radio network model: a synchronous model with a graph G=(V,E) with |V|=n where in each round, each node either transmits a packet, with length B=Omega(log n) bits, or listens. Each node receives a packet iff it is listening and exactly one of its neighbors is transmitting. We consider the problem of k-message broadcast, where k messages, each with Theta(B) bits, are placed in an arbitrary nodes of the graph and the goal is to deliver all messages to all the nodes. We present a simple proof showing that there exist a radio network with radius 2 where for any k, broadcasting k messages requires at least Omega(k log n) rounds. That is, in this network, regardless of the algorithm, the maximum achievable broadcast throughput is O(1/log n).

Connected through hyperedge HE-1 (induced by source paper "a local broadcast layer for the sinr network model"):
  with members:
    - "multi message broadcast with abstract mac layers and unreliable links"
    - "consensus with an abstract mac layer"
    - "randomized broadcast in radio networks with collision detection"
    - "on the impact of geometry on ad hoc communication in wireless networks"
    - "bounds on contention management in radio networks"
    - "distributed connectivity of wireless networks"
    - "the power of non uniform wireless power"
    - "towards tight bounds for local broadcasting"

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

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

Connected through hyperedge HE-4 (induced by source paper "fast structuring of radio networks large for multi message communications"):
  with members:
    - "randomized broadcast in radio networks with collision detection"
    - "near optimal leader election in multi hop radio networks"
    - "analyzing network coding gossip made easy"

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.DS(Data Structures and Algorithms)