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 "in order transition based constituent parsing"):
  Abstract: Both bottom-up and top-down strategies have been used for neural transition-based constituent parsing. The parsing strategies differ in terms of the order in which they recognize productions in the derivation tree, where bottom-up strategies and top-down strategies take post-order and pre-order traversal over trees, respectively. Bottom-up parsers benefit from rich features from readily built partial parses, but lack lookahead guidance in the parsing process; top-down parsers benefit from non-local guidance for local decisions, but rely on a strong encoder over the input to predict a constituent hierarchy before its construction.To mitigate both issues, we propose a novel parsing system based on in-order traversal over syntactic trees, designing a set of transition actions to find a compromise between bottom-up constituent information and top-down lookahead information. Based on stack-LSTM, our psycholinguistically motivated constituent parsing system achieves 91.8 F1 on WSJ benchmark. Furthermore, the system achieves 93.6 F1 with supervised reranking and 94.2 F1 with semi-supervised reranking, which are the best results on the WSJ benchmark.

Includes members:
  Member "span based constituency parsing with a structure label system and provably optimal dynamic oracles":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "disentangling adaptive gradient methods from learning rates")
  Member "recurrent neural network grammars":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hierarchical character embeddings learning phonological and semantic representations in languages of logographic origin using recursive neural networks")
  Member "globally normalized transition based neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "consistency of a recurrent language model with respect to incomplete decoding")
  Member "training with exploration improves a greedy stack lstm parser":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "parsing as pretraining")
  Member "shift reduce constituent parsing with neural lookahead features":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "head driven phrase structure grammar parsing on penn treebank")
  Member "bi directional attention with agreement for dependency parsing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "glyce glyph vectors for chinese character representations")
  Member "what do recurrent neural network grammars learn about syntax":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "unsupervised recurrent neural network grammars")

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)