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 "query focused sentence compression in linear time"):
  Abstract: Search applications often display shortened sentences which must contain certain query terms and must fit within the space constraints of a user interface. This work introduces a new transition-based sentence compression technique developed for such settings. Our query-focused method constructs length and lexically constrained compressions in linear time, by growing a subgraph in the dependency parse of a sentence. This theoretically efficient approach achieves an 11X empirical speedup over baseline ILP methods, while better reconstructing gold constrained shortenings. Such speedups help query-focused applications, because users are measurably hindered by interface lags. Additionally, our technique does not require an ILP solver or a GPU.

Includes members:
  Member "non entailed subsequences as a challenge for natural language inference":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "superglue a stickier benchmark for general purpose language understanding systems")
  Member "bottom up abstractive summarization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "minilm deep self attention distillation for task agnostic compression of pre trained transformers")
  Member "allennlp a deep semantic natural language processing platform":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "beat the ai investigating adversarial human annotations for reading comprehension")
  Member "fast lexically constrained decoding with dynamic beam allocation for neural machine translation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards understanding neural machine translation with word importance")
  Member "monte carlo syntax marginals for exploring and using dependency parses":
    also connected through other hyperedges:
      (none)
  Member "sentence level fluency evaluation references help but can be spared":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "evaluating the state of the art of end to end natural language generation the e2e nlg challenge")
  Member "supervised learning of universal sentence representations from natural language inference data":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey on contextual embeddings")
  Member "controlling output length in neural encoder decoders":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generating representative headlines for news stories")

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)