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 "submodular function maximization on the bounded integer lattice"):
  Abstract: We consider the problem of maximizing a submodular function on the bounded integer lattice. As a direct generalization of submodular set functions, $f: \{0, \ldots, C\} \rightarrow \mathbb{R}_+$ is submodular, if $f(x) + f(y) \geq f(x \land y) + f(x \lor y)$ for all $x,y \in \{0, \ldots, C\}$ where $\land$ and $\lor$ denote element-wise minimum and maximum. The objective is finding a vector $x$ maximizing $f(x)$. In this paper, we present a deterministic $\frac{1}{3}$-approximation using a framework inspired by Buchbinder et al. We also provide an example that shows the analysis is tight and yields additional insight into the possibilities of modifying the algorithm. Moreover, we examine some structural differences to maximization of submodular set functions which make our problem harder to solve.

Includes members:
  Member "maximizing submodular functions with the diminishing return property over the integer lattice":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "non monotone dr submodular function maximization")
  Member "deterministic algorithms for submodular maximization problems":
    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 "symmetry and approximability of submodular maximization problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "approximability of monotone submodular function maximization under cardinality and matroid constraints in the streaming model")
  Member "submodular maximization by simulated annealing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal streaming algorithms for submodular maximization with cardinality constraints")
  Member "submodular approximation sampling based algorithms and lower bounds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal approximation for unconstrained non submodular minimization")

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.DM(Discrete Mathematics)