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 "majorisation minimisation algorithms for minimising the difference between lattice submodular functions"):
  Abstract: We consider the problem of minimising functions represented as a difference of lattice submodular functions. We propose analogues to the SupSub, SubSup and ModMod routines for lattice submodular functions. We show that our majorisation-minimisation algorithms produce iterates that monotonically decrease, and that we converge to a local minimum. We also extend additive hardness results, and show that a broad range of functions can be expressed as the difference of submodular functions.

Includes members:
  Member "continuous dr submodular maximization structure and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "black box submodular maximization discrete and continuous settings")
  Member "a reduction for optimizing lattice submodular functions with diminishing returns":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multiple knapsack constrained monotone dr submodular maximization on distributive lattice continuous greedy algorithm on median complex")
  Member "submodular functions from discrete to continous domains":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "black box submodular maximization discrete and continuous settings")
  Member "submodular function maximization on the bounded integer lattice":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal dr submodular maximization and applications to provable mean field inference")
  Member "maximizing monotone submodular functions over the integer lattice":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "provable non convex optimization and algorithm validation via submodularity")
  Member "algorithms for approximate minimization of the difference between submodular functions with applications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal approximation for unconstrained non submodular minimization")
  Member "a submodular supermodular procedure with applications to discriminative structure learning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a unified framework of robust submodular optimization")
  Member "learning mixtures of submodular shells with application to document summarization":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "robust submodular minimization with applications to cooperative modeling")

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)