human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "large neighborhood local search for the maximum set packing problem"
  Abstract: In this paper we consider the classical maximum set packing problem where set cardinality is upper bounded by $k$. We show how to design a variant of a polynomial-time local search algorithm with performance guarantee $(k+2)/3$. This local search algorithm is a special case of a more general procedure that allows to swap up to $\Theta(\log n)$ elements per iteration. We also design problem instances with locality gap $k/3$ even for a wide class of exponential time local search procedures, which can swap up to $cn$ elements for a constant $c$. This shows that our analysis of this class of algorithms is almost tight.

Connected through hyperedge HE-1 (induced by source paper "almost optimal semi streaming maximization for k extendible systems"):
  with members:
    - "do less get more streaming submodular maximization with subsampling"
    - "streaming non monotone submodular maximization personalized video summarization on the fly"
    - "greed is good near optimal submodular maximization via greedy optimization"
    - "streaming algorithms for submodular function maximization"
    - "a new framework for distributed submodular maximization"
    - "a k 3 2 approximation algorithm for monotone submodular k set packing and general k exchange systems"
    - "constrained non monotone submodular maximization offline and secretary algorithms"

Connected through hyperedge HE-2 (induced by source paper "stability and recovery for independence systems"):
  with members:
    - "k center clustering under perturbation resilience"
    - "computational feasibility of clustering under clusterability assumptions"
    - "the unreasonable success of local search geometric optimization"
    - "bilu linial stable instances of max cut and minimum multiway cut"
    - "improved approximation for 3 dimensional matching via bounded pathwidth local search"
    - "clustering is difficult only when it does not matter"
    - "on the practically interesting instances of maxcut"
    - "nash equilibria in perturbation resilient games"

Connected through hyperedge HE-3 (induced by source paper "finding perfect matchings in bipartite hypergraphs"):
  with members:
    - "combinatorial algorithm for restricted max min fair allocation"
    - "improved approximation for 3 dimensional matching via bounded pathwidth local search"
    - "navigating central path with electrical flows from flows to matchings and back"
    - "quasi polynomial local search for restricted max min fair allocation"
    - "santa claus schedules jobs on unrelated machines"
    - "new constructive aspects of the lovasz local lemma"

Connected through hyperedge HE-4 (induced by source paper "the minimum feasible tileset problem"):
  with members:
    - "twins in subdivision drawings of hypergraphs"
    - "improved approximation for 3 dimensional matching via bounded pathwidth local search"
    - "kernelization of packing problems"

Connected through hyperedge HE-5 (induced by source paper "approximating upper degree constrained partial orientations"):
  with members:
    - "improved approximation for 3 dimensional matching via bounded pathwidth local search"

Connected through hyperedge HE-6 (induced by source paper "improved approximation for 3 dimensional matching via bounded pathwidth local search"):
  with members:
    - "don t be strict in local search"
    - "quasi polynomial local search for restricted max min fair allocation"

Connected through hyperedge HE-7 (induced by source paper "approximate the k set packing problem by local improvements"):
  with members:
    - "improved approximation for 3 dimensional matching via bounded pathwidth local search"
    - "greedy facility location algorithms analyzed using dual fitting with factor revealing lp"

Question: Please tell me which class the center node 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)