human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "approximation algorithms for wireless link scheduling with flexible data rates":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "wireless link capacity under shadowing and fading")
  Member "distributed connectivity of wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "data dissemination in unified dynamic wireless networks")
  Member "dynamic packet scheduling in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  Member "wireless network stability in the sinr model":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "link scheduling for throughput maximization in multihop wireless networks under physical interference")
  Member "on the problem of wireless scheduling with linear power levels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "nearly optimal bounds for distributed wireless scheduling in the sinr model")
  Member "nearly optimal bounds for distributed wireless scheduling in the sinr model":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spanning trees with edge conflicts and wireless connectivity")
  Member "the topology of wireless communication":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "resolving sinr queries in a dynamic setting")
  Member "secondary spectrum auctions for symmetric and submodular bidders":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "effective wireless scheduling via hypergraph sketches")

Question: Please tell me which class the source paper 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)