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 "guess free maximization of submodular and linear sums"):
  Abstract: We consider the problem of maximizing the sum of a monotone submodular function and a linear function subject to a general solvable polytope constraint. Recently, Sviridenko et al. (2017) described an algorithm for this problem whose approximation guarantee is optimal in some intuitive and formal senses. Unfortunately, this algorithm involves a guessing step which makes it less clean and significantly affects its time complexity. In this work we describe a clean alternative algorithm that uses a novel weighting technique in order to avoid the problematic guessing step while keeping the same approximation guarantee as the algorithm of Sviridenko et al.

Includes members:
  Member "random order contention resolution schemes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal single choice prophet inequalities from samples")
  Member "a new approximation guarantee for monotone submodular function maximization via discrete convexity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on maximization of weakly modular functions guarantees of multi stage algorithms tractability and hardness")
  Member "constrained submodular maximization beyond 1 e":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal streaming algorithms for submodular maximization with cardinality constraints")
  Member "online contention resolution schemes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "maximizing symmetric submodular functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal streaming algorithms for submodular maximization with cardinality constraints")
  Member "a stochastic probing problem with applications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning optimal search algorithms from data")
  Member "optimal approximation for submodular and supermodular optimization with bounded curvature":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "regularized submodular maximization at scale")
  Member "submodular function maximization via the multilinear relaxation and contention resolution schemes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "approximability of monotone submodular function maximization under cardinality and matroid constraints in the streaming model")

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)