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 "global neural ccg parsing with optimality guarantees"):
  Abstract: We introduce the first global recursive neural parsing model with optimality guarantees during decoding. To support global features, we give up dynamic programs and instead search directly in the space of all possible subtrees. Although this space is exponentially large in the sentence length, we show it is possible to learn an efficient A* parser. We augment existing parsing models, which have informative bounds on the outside score, with a global model that has loose bounds but only needs to model non-local phenomena. The global model is trained with a new objective that encourages the parser to explore a tiny fraction of the search space. The approach is applied to CCG parsing, improving state-of-the-art accuracy by 0.4 F1. The parser finds the optimal parse for 99.9% of held-out sentences, exploring on average only 190 subtrees.

Includes members:
  Member "globally normalized transition based neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "consistency of a recurrent language model with respect to incomplete decoding")
  Member "transition based dependency parsing with stack long short term memory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improving entity linking by modeling latent entity type information")
  Member "improved semantic representations from tree structured long short term memory networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "unbiased scene graph generation from biased training")
  Member "neural crf parsing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "torch struct deep structured prediction library")
  Member "adam a method for stochastic optimization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "grammar as a foreign language":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "parsing as pretraining")
  Member "a reduction of imitation learning and structured prediction to no regret online learning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "safe imitation learning via fast bayesian reward inference from preferences")
  Member "search based structured prediction":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "loss annealed gail for sample efficient and stable imitation learning")

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)