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 "read highlight and summarize a hierarchical neural semantic encoder based approach"):
  Abstract: Traditional sequence-to-sequence (seq2seq) models and other variations of the attention-mechanism such as hierarchical attention have been applied to the text summarization problem. Though there is a hierarchy in the way humans use language by forming paragraphs from sentences and sentences from words, hierarchical models have usually not worked that much better than their traditional seq2seq counterparts. This effect is mainly because either the hierarchical attention mechanisms are too sparse using hard attention or noisy using soft attention. In this paper, we propose a method based on extracting the highlights of a document; a key concept that is conveyed in a few sentences. In a typical text summarization dataset consisting of documents that are 800 tokens in length (average), capturing long-term dependencies is very important, e.g., the last sentence can be grouped with the first sentence of a document to form a summary. LSTMs (Long Short-Term Memory) proved useful for machine translation. However, they often fail to capture long-term dependencies while modeling long sequences. To address these issues, we have adapted Neural Semantic Encoders (NSE) to text summarization, a class of memory-augmented neural networks by improving its functionalities and proposed a novel hierarchical NSE that outperforms similar previous models significantly. The quality of summarization was improved by augmenting linguistic factors, namely lemma, and Part-of-Speech (PoS) tags, to each word in the dataset for improved vocabulary coverage and generalization. The hierarchical NSE model on factored dataset outperformed the state-of-the-art by nearly 4 ROUGE points. We further designed and used the first GPU-based self-critical Reinforcement Learning model.

Includes members:
  Member "xlnet generalized autoregressive pretraining for language understanding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on contextual embeddings")
  Member "deep communicating agents for abstractive summarization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "what is this article about extreme summarization with topic aware convolutional neural networks")
  Member "ranking sentences for extractive summarization with reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning by semantic similarity makes abstractive summarization better")
  Member "bert pre training of deep bidirectional transformers for language understanding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi simlex a large scale evaluation of multilingual and cross lingual lexical semantic similarity")
  Member "fast abstractive summarization with reinforce selected sentence rewriting":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "structsum incorporating latent and explicit sentence dependencies for single document summarization")
  Member "get to the point summarization with pointer generator networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mast a memory augmented self supervised tracker")
  Member "a deep reinforced model for abstractive summarization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "time aware large kernel convolutions")
  Member "from softmax to sparsemax a sparse model of attention and multi label classification":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "power bert accelerating bert inference for classification tasks")

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)