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 "a transition based directed acyclic graph parser for ucca"):
  Abstract: We present the first parser for UCCA, a cross-linguistically applicable framework for semantic representation, which builds on extensive typological work and supports rapid annotation. UCCA poses a challenge for existing parsing techniques, as it exhibits reentrancy (resulting in DAG structures), discontinuous structures and non-terminal nodes corresponding to complex semantic units. To our knowledge, the conjunction of these formal properties is not supported by any existing parser. Our transition-based parser, which uses a novel transition set and features based on bidirectional LSTMs, has value not just for UCCA parsing: its ability to handle more general graph structures can inform the development of parsers for other semantic DAG structures, and in languages that frequently use discontinuous structures.

Includes members:
  Member "toward abstractive summarization using semantic representations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "structsum incorporating latent and explicit sentence dependencies for single document summarization")
  Member "hume human ucca based evaluation of machine translation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "automatically extracting challenge sets for non local phenomena neural machine translation")
  Member "greedy joint syntactic semantic parsing with stack lstms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capturing argument interaction in semantic role labeling with capsule networks")
  Member "globally normalized transition based neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "consistency of a recurrent language model with respect to incomplete decoding")
  Member "an incremental parser for abstract meaning representation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "amr similarity metrics from principles")
  Member "simple and accurate dependency parsing using bidirectional lstm feature representations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "parsing as pretraining")
  Member "robust subgraph generation improves abstract meaning representation parsing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "amr parsing as sequence to graph transduction")
  Member "parsing as reduction":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "discontinuous constituent parsing with pointer networks")

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)