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: "a k 3 2 approximation algorithm for monotone submodular k set packing and general k exchange systems"
  Abstract: We consider the monotone submodular k-set packing problem in the context of the more general problem of maximizing a monotone submodular function in a k-exchange system. These systems, introduced by Feldman et al. [Feldman,2011], generalize the matroid k-parity problem in a wide class of matroids and capture many other combinatorial optimization problems.  We give a deterministic, non-oblivious local search algorithm that attains an approximation ratio of (k + 3)/2 + epsilon for the problem of maximizing a monotone submodular function in a k-exchange system, improving on the best known result of k+epsilon, and answering an open question posed by Feldman et al.

Connected through hyperedge HE-1 (induced by source paper "an optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint"):
  with members:
    - "understanding the correlation gap for matchings"
    - "submodular maximization through the lens of linear programming"
    - "greed is good near optimal submodular maximization via greedy optimization"
    - "constrained submodular maximization beyond 1 e"
    - "online contention resolution schemes"
    - "non negative submodular stochastic probing via stochastic contention resolution schemes"
    - "a stochastic probing problem with applications"
    - "symmetry and approximability of submodular maximization problems"

Connected through hyperedge HE-2 (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"
    - "large neighborhood local search for the maximum set packing problem"
    - "constrained non monotone submodular maximization offline and secretary algorithms"

Connected through hyperedge HE-3 (induced by source paper "do less get more streaming submodular maximization with subsampling"):
  with members:
    - "streaming non monotone submodular maximization personalized video summarization on the fly"
    - "efficient streaming algorithms for submodular maximization with multi knapsack constraints"
    - "greed is good near optimal submodular maximization via greedy optimization"
    - "constrained submodular maximization via a non symmetric technique"
    - "constrained submodular maximization beyond 1 e"
    - "streaming algorithms for submodular function maximization"
    - "online submodular maximization with preemption"
    - "distributed submodular maximization"

Connected through hyperedge HE-4 (induced by source paper "algorithms to approximate column sparse packing problems"):
  with members:
    - "attenuate locally win globally an attenuation based framework for online stochastic matching with timeouts"
    - "random order contention resolution schemes"
    - "adaptivity gaps for stochastic probing submodular and xos functions"
    - "improved algorithmic bounds for discrepancy of sparse set systems"
    - "deterministic discrepancy minimization via the multiplicative weight update method"
    - "constrained submodular maximization via a non symmetric technique"
    - "constrained submodular maximization beyond 1 e"
    - "non negative submodular stochastic probing via stochastic contention resolution schemes"

Connected through hyperedge HE-5 (induced by source paper "submodular maximization through the lens of linear programming"):
  with members:
    - "greed is good near optimal submodular maximization via greedy optimization"
    - "constrained submodular maximization via a non symmetric technique"
    - "deterministic algorithms for submodular maximization problems"
    - "submodular function maximization via the multilinear relaxation and contention resolution schemes"
    - "constrained non monotone submodular maximization offline and secretary algorithms"
    - "dependent randomized rounding for matroid polytopes and applications"
    - "combinatorial auctions with decreasing marginal utilities"

Connected through hyperedge HE-6 (induced by source paper "greed is good near optimal submodular maximization via greedy optimization"):
  with members:
    - "constrained submodular maximization via a non symmetric technique"
    - "constrained submodular maximization beyond 1 e"
    - "deterministic algorithms for submodular maximization problems"
    - "lazier than lazy greedy"
    - "near optimally teaching the crowd to classify"
    - "comparing apples and oranges query tradeoff in submodular maximization"
    - "symmetry and approximability of submodular maximization problems"

Connected through hyperedge HE-7 (induced by source paper "constrained monotone function maximization and the supermodular degree"):
  with members:
    - "a unifying hierarchy of valuations with complements and substitutes"
    - "symmetry and approximability of submodular maximization problems"
    - "reductions between expansion problems"

Connected through hyperedge HE-8 (induced by source paper "a tight combinatorial algorithm for submodular maximization subject to a matroid constraint"):
  with members:
    - "submodular maximization by simulated annealing"

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)