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 "left to right dependency parsing with pointer networks"):
  Abstract: We propose a novel transition-based algorithm that straightforwardly parses sentences from left to right by building $n$ attachments, with $n$ being the length of the input sentence. Similarly to the recent stack-pointer parser by Ma et al. (2018), we use the pointer network framework that, given a word, can directly point to a position from the sentence. However, our left-to-right approach is simpler than the original top-down stack-pointer parser (not requiring a stack) and reduces transition sequence length in half, from 2$n$-1 actions to $n$. This results in a quadratic non-projective parser that runs twice as fast as the original while achieving the best accuracy to date on the English PTB dataset (96.04% UAS, 94.43% LAS) among fully-supervised single-model dependency parsers, and improves over the former top-down transition system in the majority of languages tested.

Includes members:
  Member "arc swift a novel transition system for dependency parsing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "better faster stronger sequence tagging constituent parsers")
  Member "training with exploration improves a greedy stack lstm parser":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "glyce glyph vectors for chinese character representations")
  Member "simple and accurate dependency parsing using bidirectional lstm feature representations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parsing as pretraining")
  Member "distilling an ensemble of greedy dependency parsers into one mst parser":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bam born again multi task networks for natural language understanding")
  Member "bi directional attention with agreement for dependency parsing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "glyce glyph vectors for chinese character representations")
  Member "transition based dependency parsing with stack long short term memory":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "improving entity linking by modeling latent entity type information")
  Member "neural machine translation by jointly learning to align and translate":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")

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)