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 "maximizing monotone submodular functions over the integer lattice"):
  Abstract: The problem of maximizing non-negative monotone submodular functions under a certain constraint has been intensively studied in the last decade. In this paper, we address the problem for functions defined over the integer lattice. #R##N#Suppose that a non-negative monotone submodular function $f:\mathbb{Z}_+^n \to \mathbb{R}_+$ is given via an evaluation oracle. Assume further that $f$ satisfies the diminishing return property, which is not an immediate consequence of submodularity when the domain is the integer lattice. Given this, we design polynomial-time $(1-1/e-\epsilon)$-approximation algorithms for a cardinality constraint, a polymatroid constraint, and a knapsack constraint. For a cardinality constraint, we also provide a $(1-1/e-\epsilon)$-approximation algorithm with slightly worse time complexity that does not rely on the diminishing return property.

Includes members:
  Member "improved approximation algorithms for k submodular function maximization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "improved randomized algorithm for k 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 "submodular function maximization on the bounded integer lattice":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "majorisation minimisation algorithms for minimising the difference between lattice submodular functions")
  Member "how to influence people with partial incentives":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "scalable lattice influence maximization")
  Member "online submodular welfare maximization greedy is optimal":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal streaming algorithms for submodular maximization with cardinality constraints")

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.DS(Data Structures and Algorithms)