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: "bounds on contention management in radio networks"
  Abstract: The local broadcast problem assumes that processes in a wireless network are provided messages, one by one, that must be delivered to their neighbors. In this paper, we prove tight bounds for this problem in two well-studied wireless network models: the classical model, in which links are reliable and collisions consistent, and the more recent dual graph model, which introduces unreliable edges. Our results prove that the Decay strategy, commonly used for local broadcast in the classical setting, is optimal. They also establish a separation between the two models, proving that the dual graph setting is strictly harder than the classical setting, with respect to this primitive.

Connected through hyperedge HE-1 (induced by source paper "cross sender bit mixing coding"):
  with members:
    - "non adaptive group testing framework based on concatenation code"
    - "group testing using left and right regular sparse graph codes"
    - "nonadaptive group testing with random set of defectives"
    - "group testing schemes from codes and designs"
    - "saffron a fast efficient and robust framework for group testing based on sparse graph codes"
    - "computing in additive networks with bounded information codes"
    - "group testing algorithms bounds and simulations"
    - "on almost disjunct matrices for group testing"

Connected through hyperedge HE-2 (induced by source paper "erasure correction for noisy radio networks"):
  with members:
    - "broadcasting in noisy radio networks"
    - "multi message broadcast with abstract mac layers and unreliable links"
    - "interactive channel capacity revisited"
    - "randomized broadcast in radio networks with collision detection"

Connected through hyperedge HE-3 (induced by source paper "on simple back off in unreliable radio networks"):
  with members:
    - "multi message broadcast with abstract mac layers and unreliable links"

Connected through hyperedge HE-4 (induced by source paper "on simple back off in complicated radio networks"):
  with members:
    - "multi message broadcast with abstract mac layers and unreliable links"

Connected through hyperedge HE-5 (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"
    - "fast structuring of radio networks large for multi message communications"
    - "analyzing network coding gossip made easy"
    - "on distributed computation in noisy random planar networks"

Connected through hyperedge HE-6 (induced by source paper "data dissemination in unified dynamic wireless networks"):
  with members:
    - "leveraging multiple channels in ad hoc networks"
    - "distributed bare bones communication in wireless networks"
    - "a local broadcast layer for the sinr network model"
    - "distributed communication in bare bones wireless networks"
    - "multi message broadcast with abstract mac layers and unreliable links"
    - "randomized broadcast in radio networks with collision detection"
    - "beyond geometry towards fully realistic wireless models"
    - "radio network lower bounds made easy"

Connected through hyperedge HE-7 (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"
    - "a bound on the throughput of radio networks"
    - "distributed connectivity of wireless networks"
    - "the power of non uniform wireless power"
    - "towards tight bounds for local broadcasting"

Connected through hyperedge HE-8 (induced by source paper "broadcast throughput in radio networks routing vs network coding"):
  with members:
    - "randomized broadcast in radio networks with collision detection"
    - "a bound on the throughput of radio networks"
    - "a new perspective on vertex connectivity"
    - "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)