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 "towards dynamic computation graphs via sparse latent structure"):
  Abstract: Deep NLP models benefit from underlying structures in the data---e.g., parse trees---typically extracted using off-the-shelf parsers. Recent attempts to jointly learn the latent structure encounter a tradeoff: either make factorization assumptions that limit expressiveness, or sacrifice end-to-end differentiability. Using the recently proposed SparseMAP inference, which retrieves a sparse distribution over latent structures, we propose a novel approach for end-to-end learning of latent structure predictors jointly with a downstream predictor. To the best of our knowledge, our method is the first to enable unrestricted dynamic computation graph construction from the global latent structure, while maintaining differentiability.

Includes members:
  Member "backpropagating through structured argmax using a spigot":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deep adaptive semantic logic dasl compiling declarative knowledge into deep neural networks")
  Member "inferring and executing programs for visual reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "unsupervised question decomposition for question answering")
  Member "learning to reason end to end module networks for visual question answering":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "gradient based adversarial attacks on categorical sequence models via traversing an embedded world")
  Member "jointly learning sentence embeddings and syntax with unsupervised tree lstms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "are pre trained language models aware of phrases simple but strong baselines for grammar induction")
  Member "programming with a differentiable forth interpreter":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "from statistical relational to neuro symbolic artificial intelligence")
  Member "learning to compose words into sentences with reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hierarchical character embeddings learning phonological and semantic representations in languages of logographic origin using recursive neural networks")
  Member "improved semantic representations from tree structured long short term memory networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "unbiased scene graph generation from biased training")
  Member "a large annotated corpus for learning natural language inference":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "contextual lensing of universal sentence representations")

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)