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 "differentiable greedy networks"):
  Abstract: Optimal selection of a subset of items from a given set is a hard problem that requires combinatorial optimization. In this paper, we propose a subset selection algorithm that is trainable with gradient-based methods yet achieves near-optimal performance via submodular optimization. We focus on the task of identifying a relevant set of sentences for claim verification in the context of the FEVER task. Conventional methods for this task look at sentences on their individual merit and thus do not optimize the informativeness of sentences as a set. We show that our proposed method which builds on the idea of unfolding a greedy algorithm into a computational graph allows both interpretability and gradient-based training. The proposed differentiable greedy network (DGN) outperforms discrete optimization algorithms as well as other baseline methods in terms of precision and recall.

Includes members:
  Member "attention is all you need":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "maximal sparsity with deep networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "theoretical interpretation of learned step size in deep unfolded gradient descent")
  Member "enriching word vectors with subword information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi simlex a large scale evaluation of multilingual and cross lingual lexical semantic similarity")
  Member "rationalizing neural predictions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "description based text classification with reinforcement learning")
  Member "end to end learning of lda by mirror descent back propagation over a deep architecture":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cooperative neural networks conn exploiting prior independence structure for improved classification")
  Member "adam a method for stochastic optimization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "deep unfolding model based inspiration of novel deep architectures":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "theoretical interpretation of learned step size in deep unfolded gradient descent")
  Member "large margin learning of submodular summarization methods":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "ins an interactive chinese news synthesis system")

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.LG(Machine Learning)