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 "simpler context dependent logical forms via model projections"):
  Abstract: We consider the task of learning a context-dependent mapping from utterances to denotations. With only denotations at training time, we must search over a combinatorially large space of logical forms, which is even larger with context-dependent utterances. To cope with this challenge, we perform successive projections of the full model onto simpler models that operate over equivalence classes of logical forms. Though less expressive, we find that these simpler models are much faster and can be surprisingly effective. Moreover, they can be used to bootstrap the full model. Finally, we collected three new context-dependent semantic parsing datasets, and develop a new left-to-right parser.

Includes members:
  Member "neural programmer inducing latent programs with gradient descent":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "automl zero evolving machine learning algorithms from scratch")
  Member "compositional semantic parsing on semi structured tables":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the next decade in ai four steps towards robust artificial intelligence")
  Member "towards ai complete question answering a set of prerequisite toy tasks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a 3 accelerating attention mechanisms in neural networks with approximation")
  Member "traversing knowledge graphs in vector space":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "scalable neural methods for reasoning with a symbolic knowledge base")
  Member "question answering with subgraph embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "navigation based candidate expansion and pretrained language models for citation recommendation")
  Member "can recursive neural tensor networks learn logical reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "posing fair generalization tasks for natural language inference")
  Member "lambda dependency based compositional semantics":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "exploring neural models for parsing natural language into first order logic")
  Member "learning to map sentences to logical form structured classification with probabilistic categorial grammars":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "break it down a question understanding benchmark")

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)