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 "structured neural summarization"):
  Abstract: Summarization of long sequences into a concise statement is a core problem in natural language processing, requiring non-trivial understanding of the input. Based on the promising results of graph neural networks on highly structured data, we develop a framework to extend existing sequence encoders with a graph component that can reason about long-distance relationships in weakly structured data such as text. In an extensive evaluation, we show that the resulting hybrid sequence-graph models outperform both pure sequence models as well as pure graph models on a range of summarization tasks.

Includes members:
  Member "deep learning to detect redundant method comments":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "pre trained contextual embedding of source code")
  Member "a general path based representation for predicting program properties":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "structural language models of code")
  Member "the natural language decathlon multitask learning as question answering":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "the adverse effects of code duplication in machine learning models of code":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "big code big vocabulary open vocabulary models for source code")
  Member "toward abstractive summarization using semantic representations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "structsum incorporating latent and explicit sentence dependencies for single document summarization")
  Member "ranking sentences for extractive summarization with reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning by semantic similarity makes abstractive summarization better")
  Member "question answering by reasoning across documents with graph convolutional networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "quick and not so dirty unsupervised selection of justification sentences for multi hop question answering")
  Member "fast abstractive summarization with reinforce selected sentence rewriting":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "structsum incorporating latent and explicit sentence dependencies for single document summarization")

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)