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: "maximizing k submodular functions and beyond"
  Abstract: We consider the maximization problem in the value oracle model of functions defined on k-tuples of sets that are submodular in every orthant and r-wise monotone, where k g 2 and 1 l r l k. We give an analysis of a deterministic greedy algorithm that shows that any such function can be approximated to a factor of 1/(1 + r). For r e k, we give an analysis of a randomized greedy algorithm that shows that any such function can be approximated to a factor of 1/(1+sk/2.   In the case of k e r e 2, the considered functions correspond precisely to bisubmodular functions, in which case we obtain an approximation guarantee of 1/2. We show that, as in the case of submodular functions, this result is the best possible both in the value query model and under the assumption that NP ≠ RP.   Extending a result of Ando et al., we show that for any k g 3, submodularity in every orthant and pairwise monotonicity (i.e., r e 2) precisely characterize k-submodular functions. Consequently, we obtain an approximation guarantee of 1/3 (and thus independent of k) for the maximization problem of k-submodular functions.

Connected through hyperedge HE-1 (induced by source paper "improved randomized algorithm for k submodular function maximization"):
  with members:
    - "improved approximation algorithms for k submodular function maximization"
    - "deterministic algorithms for submodular maximization problems"
    - "towards minimizing k submodular functions"

Connected through hyperedge HE-2 (induced by source paper "no regret algorithms for online k submodular maximization"):
  with members:
    - "introduction to online convex optimization"
    - "an optimal algorithm for online unconstrained submodular maximization"
    - "derandomization for k submodular maximization"
    - "on maximizing a monotone k submodular function subject to a matroid constraint"
    - "improved approximation algorithms for k submodular function maximization"
    - "online submodular maximization under a matroid constraint with application to learning assignments"
    - "towards minimizing k submodular functions"

Connected through hyperedge HE-3 (induced by source paper "on maximizing a monotone k submodular function subject to a matroid constraint"):
  with members:
    - "improved approximation algorithms for k submodular function maximization"
    - "towards minimizing k submodular functions"
    - "potts model parametric maxflow and k submodular functions"
    - "a tight combinatorial algorithm for submodular maximization subject to a matroid constraint"
    - "adaptive submodular optimization under matroid constraints"

Connected through hyperedge HE-4 (induced by source paper "derandomization for k submodular maximization"):
  with members:
    - "improved approximation algorithms for k submodular function maximization"
    - "deterministic algorithms for submodular maximization problems"
    - "towards minimizing k submodular functions"
    - "potts model parametric maxflow and k submodular functions"

Connected through hyperedge HE-5 (induced by source paper "improved approximation algorithms for k submodular function maximization"):
  with members:
    - "half integrality lp branching and fpt algorithms"
    - "towards minimizing k submodular functions"
    - "symmetry and approximability of submodular maximization problems"

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)