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: "towards minimizing k submodular functions"
  Abstract: In this paper we investigate k-submodular functions. This natural family of discrete functions includes submodular and bisubmodular functions as the special cases k = 1 and k = 2 respectively. #R##N#In particular we generalize the known Min-Max-Theorem for submodular and bisubmodular functions. This theorem asserts that the minimum of the (bi)submodular function can be found by solving a maximization problem over a (bi)submodular polyhedron. We define and investigate a k-submodular polyhedron and prove a Min-Max-Theorem for k-submodular functions.

Connected through hyperedge HE-1 (induced by source paper "beyond boolean surjective vcsps"):
  with members:
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "algebraic properties of valued constraint satisfaction problem"
    - "the complexity of surjective homomorphism problems a survey"
    - "the complexity of global cardinality constraints"

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

Connected through hyperedge HE-3 (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"
    - "maximizing k submodular functions and beyond"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "deep submodular functions"):
  with members:
    - "submodular optimization under noise"
    - "a new framework for distributed submodular maximization"
    - "submodular function maximization via the multilinear relaxation and contention resolution schemes"
    - "efficient minimization of decomposable submodular functions"
    - "submodular functions learnability structure and optimization"

Connected through hyperedge HE-5 (induced by source paper "on maximizing a monotone k submodular function subject to a matroid constraint"):
  with members:
    - "maximizing k submodular functions and beyond"
    - "improved approximation algorithms for k submodular function maximization"
    - "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-6 (induced by source paper "derandomization for k submodular maximization"):
  with members:
    - "maximizing k submodular functions and beyond"
    - "improved approximation algorithms for k submodular function maximization"
    - "deterministic algorithms for submodular maximization problems"
    - "potts model parametric maxflow and k submodular functions"

Connected through hyperedge HE-7 (induced by source paper "maximizing k submodular functions and beyond"):
  with members:
    - "half integrality lp branching and fpt algorithms"
    - "the power of linear programming for valued csps"
    - "symmetry and approximability of submodular maximization problems"

Connected through hyperedge HE-8 (induced by source paper "improved approximation algorithms for k submodular function maximization"):
  with members:
    - "maximizing k submodular functions and beyond"
    - "half integrality lp branching and fpt algorithms"
    - "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.DM(Discrete Mathematics)