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 "wireless capacity with arbitrary gain matrix"):
  Abstract: Given a set of wireless links, a fundamental problem is to find the largest subset that can transmit simultaneously, within the SINR model of interference. Significant progress on this problem has been made in recent years. In this note, we study the problem in the setting where we are given a fixed set of arbitrary powers each sender must use, and an arbitrary gain matrix defining how signals fade. This variation of the problem appears immune to most algorithmic approaches studied in the literature. Indeed it is very hard to approximate since it generalizes the max independent set problem. Here, we propose a simple semi-definite programming approach to the problem that yields constant factor approximation, if the optimal solution is strictly larger than half of the input size.

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 "nearly optimal bounds for distributed wireless scheduling in the sinr model":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "resolving sinr queries in a dynamic setting")
  Member "wireless capacity with oblivious power in general metrics":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reception capacity definitions game theory and hardness")
  Member "a constant factor approximation for wireless capacity maximization with power control in the sinr model":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reception capacity definitions game theory and hardness")
  Member "approximation algorithms for secondary spectrum auctions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fpt algorithms for diverse collections of hitting sets")
  Member "coloring k colorable graphs using relatively small palettes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "approximating the orthogonality dimension of graphs and hypergraphs")
  Member "approximate graph coloring by semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "positive semidefinite programming mixed parallel and width independent")

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)