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 "multi hop reading comprehension via deep reinforcement learning based document traversal"):
  Abstract: Reading Comprehension has received significant attention in recent years as high quality Question Answering (QA) datasets have become available. Despite state-of-the-art methods achieving strong overall accuracy, Multi-Hop (MH) reasoning remains particularly challenging. To address MH-QA specifically, we propose a Deep Reinforcement Learning based method capable of learning sequential reasoning across large collections of documents so as to pass a query-aware, fixed-size context subset to existing models for answer extraction. Our method is comprised of two stages: a linker, which decomposes the provided support documents into a graph of sentences, and an extractor, which learns where to look based on the current question and already-visited sentences. The result of the linker is a novel graph structure at the sentence level that preserves logical flow while still allowing rapid movement between documents. Importantly, we demonstrate that the sparsity of the resultant graph is invariant to context size. This translates to fewer decisions required from the Deep-RL trained extractor, allowing the system to scale effectively to large collections of documents. #R##N#The importance of sequential decision making in the document traversal step is demonstrated by comparison to standard IE methods, and we additionally introduce a BM25-based IR baseline that retrieves documents relevant to the query only. We examine the integration of our method with existing models on the recently proposed QAngaroo benchmark and achieve consistent increases in accuracy across the board, as well as a 2-3x reduction in training time.

Includes members:
  Member "variational reasoning for question answering with knowledge graph":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "differentiable reasoning over a virtual knowledge base")
  Member "triviaqa a large scale distantly supervised challenge dataset for reading comprehension":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a study of the tasks and models in machine reading comprehension")
  Member "making neural qa as simple as possible but not simpler":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a study of the tasks and models in machine reading comprehension")
  Member "multi mention learning for reading comprehension with neural cascades":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coarse grain fine grain coattention network for multi evidence question answering")
  Member "reinforced mnemonic reader for machine reading comprehension":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a study of the tasks and models in machine reading comprehension")
  Member "linguistic knowledge as memory for recurrent neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "discourse aware semantic self attention for narrative reading comprehension")
  Member "reading wikipedia to answer open domain questions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "description based text classification with reinforcement learning")
  Member "proximal policy optimization algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deep reinforcement learning for autonomous driving a survey")

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)