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 "fast maximization of non submodular monotonic functions on the integer lattice"):
  Abstract: The optimization of submodular functions on the integer lattice has received much attention recently, but the objective functions of many applications are non-submodular. We provide two approximation algorithms for maximizing a non-submodular function on the integer lattice subject to a cardinality constraint; these are the first algorithms for this purpose that have polynomial query complexity. We propose a general framework for influence maximization on the integer lattice that generalizes prior works on this topic, and we demonstrate the efficiency of our algorithms in this context.

Includes members:
  Member "non monotone continuous dr submodular maximization structure and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online non monotone dr submodular maximization")
  Member "guarantees for greedy maximization of non submodular functions with applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal approximation for unconstrained non submodular minimization")
  Member "non monotone dr submodular function maximization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "non monotone dr submodular maximization approximation and regret guarantees")
  Member "boosting information spread an algorithmic approach":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on adaptivity gaps of influence maximization under the independent cascade model with full adoption feedback")
  Member "a reduction for optimizing lattice submodular functions with diminishing returns":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "majorisation minimisation algorithms for minimising the difference between lattice submodular functions")
  Member "weakly submodular functions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "beyond submodular maximization")
  Member "lazier than lazy greedy":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "good feature matching towards accurate robust vo vslam with low latency")
  Member "combinatorial auctions with decreasing marginal utilities":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "complexity theory game theory and economics the barbados lectures")

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)