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 "stability and recovery for independence systems"):
  Abstract: Two genres of heuristics that are frequently reported to perform much better on "real-world" instances than in the worst case are greedy algorithms and local search algorithms. In this paper, we systematically study these two types of algorithms for the problem of maximizing a monotone submodular set function subject to downward-closed feasibility constraints. We consider perturbation-stable instances, in the sense of Bilu and Linial, and precisely identify the stability threshold beyond which these algorithms are guaranteed to recover the optimal solution. Byproducts of our work include the first definition of perturbation-stability for non-additive objective functions, and a resolution of the worst-case approximation guarantee of local search in p-extendible systems.

Includes members:
  Member "k center clustering under perturbation resilience":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "semi bandit optimization in the dispersed setting")
  Member "computational feasibility of clustering under clusterability assumptions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the unreasonable effectiveness of the greedy algorithm greedy adapts to sharpness")
  Member "the unreasonable success of local search geometric optimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "local search yields a ptas for k means in doubling metrics")
  Member "bilu linial stable instances of max cut and minimum multiway cut":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "solving k 1 stable instances of k terminal cut with isolating cuts")
  Member "improved approximation for 3 dimensional matching via bounded pathwidth local search":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximate multi matroid intersection via iterative refinement")
  Member "large neighborhood local search for the maximum set packing problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "almost optimal semi streaming maximization for k extendible systems")
  Member "clustering is difficult only when it does not matter":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the unreasonable effectiveness of the greedy algorithm greedy adapts to sharpness")
  Member "on the practically interesting instances of maxcut":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "bilu linial stability certified algorithms and the independent set problem")

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)