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 "efficiency metrics for data driven models a text summarization case study"):
  Abstract: Using data-driven models for solving text summarization or similar tasks has become very common in the last years. Yet most of the studies report basic accuracy scores only, and nothing is known about the ability of the proposed models to improve when trained on more data. In this paper, we define and propose three data efficiency metrics: data score efficiency, data time deficiency and overall data efficiency. We also propose a simple scheme that uses those metrics and apply it for a more comprehensive evaluation of popular methods on text summarization and title generation tasks. For the latter task, we process and release a huge collection of 35 million abstract-title pairs from scientific articles. Our results reveal that among the tested models, the Transformer is the most efficient on both tasks.

Includes members:
  Member "measuring the data efficiency of deep learning methods":
    also connected through other hyperedges:
      (none)
  Member "deep reinforcement learning for sequence to sequence models":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "trans 3 a transformer based framework for unifying code summarization and code search")
  Member "newsroom a dataset of 1 3 million summaries with diverse extractive strategies":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "modelling latent skills for multitask language generation")
  Member "global encoding for abstractive summarization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "gret global representation enhanced transformer")
  Member "know what you don t know unanswerable questions for squad":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "description based text classification with reinforcement learning")
  Member "training tips for the transformer model":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "disentangling adaptive gradient methods from learning rates")
  Member "fast abstractive summarization with reinforce selected sentence rewriting":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "structsum incorporating latent and explicit sentence dependencies for single document summarization")
  Member "attention is all you need":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")

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.CL(Computation and Language)