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: "the power of non uniform wireless power"
  Abstract: We study a fundamental measure for wireless interference in the SINR model known as (weighted) inductive independence. This measure characterizes the effectiveness of using oblivious power --- when the power used by a transmitter only depends on the distance to the receiver --- as a mechanism for improving wireless capacity. #R##N#We prove optimal bounds for inductive independence, implying a number of algorithmic applications. An algorithm is provided that achieves --- due to existing lower bounds --- capacity that is asymptotically best possible using oblivious power assignments. Improved approximation algorithms are provided for a number of problems for oblivious power and for power control, including distributed scheduling, connectivity, secondary spectrum auctions, and dynamic packet scheduling.

Connected through hyperedge HE-1 (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-2 (induced by source paper "the price of local power control in wireless scheduling"):
  with members:
    - "how well can graphs represent wireless interference"
    - "beyond geometry towards fully realistic wireless models"
    - "wireless scheduling algorithms in complex environments"
    - "on the impact of geometry on ad hoc communication in wireless networks"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "towards tight bounds for local broadcasting"
    - "on the complexity of the minimum latency scheduling problem on the euclidean plane"
    - "algorithms for wireless capacity"

Connected through hyperedge HE-3 (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"
    - "bounds on contention management in radio networks"
    - "distributed connectivity of wireless networks"
    - "towards tight bounds for local broadcasting"

Connected through hyperedge HE-4 (induced by source paper "beyond geometry towards fully realistic wireless models"):
  with members:
    - "wireless scheduling algorithms in complex environments"
    - "jamming resistant learning in wireless networks"
    - "distributed deterministic broadcasting in uniform power ad hoc wireless networks"
    - "online independent set beyond the worst case secretaries prophets and periods"
    - "approximation algorithms for wireless link scheduling with flexible data rates"
    - "distributed connectivity of wireless networks"
    - "mlls minimum length link scheduling under physical interference model"
    - "a fully distributed algorithm for throughput performance in wireless networks"

Connected through hyperedge HE-5 (induced by source paper "probabilistic analysis of power assignments"):
  with members:
    - "wireless connectivity and capacity"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"
    - "smoothed analysis of algorithms why the simplex algorithm usually takes polynomial time"

Connected through hyperedge HE-6 (induced by source paper "the family holiday gathering problem or fair and periodic scheduling of independent sets"):
  with members:
    - "how well can graphs represent wireless interference"
    - "the locality of distributed symmetry breaking"
    - "nearly optimal bounds for distributed wireless scheduling in the sinr model"

Connected through hyperedge HE-7 (induced by source paper "online independent set beyond the worst case secretaries prophets and periods"):
  with members:
    - "near optimal online algorithms and fast approximation algorithms for resource allocation problems"
    - "universally truthful secondary spectrum auctions"
    - "primal beats dual on online packing lps in the random order model"
    - "matroid prophet inequalities"
    - "geometry of online packing linear programs"
    - "bayesian combinatorial auctions expanding single buyer mechanisms to many buyers"
    - "wireless capacity with oblivious power in general metrics"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"

Connected through hyperedge HE-8 (induced by source paper "universally truthful secondary spectrum auctions"):
  with members:
    - "secondary spectrum auctions for symmetric and submodular bidders"
    - "a constant factor approximation for wireless capacity maximization with power control in the sinr model"

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)