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 "secondary spectrum auctions for symmetric and submodular bidders"):
  Abstract: We study truthful auctions for secondary spectrum usage in wireless networks. In this scenario, n communication requests need to be allocated to k available channels that are subject to interference and noise. We present the first truthful mechanisms for secondary spectrum auctions with symmetric or submodular valuations. Our approach to model interference uses an edge-weighted conflict graph, and our algorithms provide asymptotically almost optimal approximation bounds for conflict graphs with a small inductive independence number rho << n. This approach covers a large variety of interference models such as, e.g., the protocol model or the recently popular physical model of interference. For unweighted conflict graphs and symmetric valuations we use LP-rounding to obtain $O(\rho)$-approximate mechanisms; for weighted conflict graphs we get a factor of O(rho (log n + log k)). For submodular users we combine the convex rounding framework of Dughmi et al [STOC 2011] with randomized meta-rounding to obtain O(rho)-approximate mechanisms for matroid-rank-sum valuations; for weighted conflict graphs we can fully drop the dependence on k to get O(rho log n). We conclude with promising initialresults for deterministically truthful mechanisms that allow approximation factors based on rho.

Includes members:
  Member "the power of non uniform wireless power":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "data dissemination in unified dynamic wireless networks")
  Member "a truthful randomized mechanism for combinatorial public projects via convex optimization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "probabilistic verification for obviously strategyproof mechanisms")
  Member "from convex optimization to randomized mechanisms toward optimal combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  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 "truthfulness via proxies":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a bridge between liquid and social welfare in combinatorial auctions with submodular bidders")
  Member "a constant factor approximation for wireless capacity maximization with power control in the sinr model":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "fpt algorithms for diverse collections of hitting sets")
  Member "mechanisms for multi unit auctions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "price doubling and item halving robust revenue guarantees for item pricing")

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)