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 "ranking with diverse intents and correlated contents"):
  Abstract: We consider the following document ranking problem: We have a collection of documents, each containing some topics (e.g. sports, politics, economics). We also have a set of users with diverse interests. Assume that user u is interested in a subset I_u of topics. Each user u is also associated with a positive integer K_u, which indicates that u can be satisfied by any K_u topics in I_u. Each document s contains information for a subset C_s of topics. The objective is to pick one document at a time such that the average satisfying time is minimized, where a user's satisfying time is the first time that at least K_u topics in I_u are covered in the documents selected so far. Our main result is an O({\rho})-approximation algorithm for the problem, where {\rho} is the algorithmic integrality gap of the linear programming relaxation of the set cover instance defined by the documents and topics. This result generalizes the constant approximations for generalized min-sum set cover and ranking with unrelated intents and the logarithmic approximation for the problem of ranking with submodular valuations (when the submodular function is the coverage function), and can be seen as an interpolation between these results. We further extend our model to the case when each user may interest in more than one sets of topics and when the user's valuation function is XOS, and obtain similar results for these models.

Includes members:
  Member "approximation algorithms for maximum independent set of pseudo disks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "independent sets of dynamic rectangles algorithms and experiments")
  Member "a note on the generalized min sum set cover problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the online min sum set cover problem")
  Member "minimum latency submodular cover":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the online min sum set cover problem")
  Member "when lp is the cure for your matching woes improved bounds for stochastic matchings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "predict and match prophet inequalities with uncertain supply")
  Member "ranking with submodular valuations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the online min sum set cover problem")
  Member "dependent randomized rounding for matroid polytopes and applications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint")
  Member "a unified approach to ranking in probabilistic databases":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "uncertainty annotated databases a lightweight approach for approximating certain answers extended version")
  Member "combinatorial auctions with decreasing marginal utilities":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "complexity theory game theory and economics the barbados lectures")

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)