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 "go for a walk and arrive at the answer reasoning over paths in knowledge bases using reinforcement learning"):
  Abstract: Knowledge bases (KB), both automatically and manually constructed, are often incomplete --- many valid facts can be inferred from the KB by synthesizing existing information. A popular approach to KB completion is to infer new relations by combinatory reasoning over the information found along other paths connecting a pair of entities. Given the enormous size of KBs and the exponential number of paths, previous path-based models have considered only the problem of predicting a missing relation given two entities or evaluating the truth of a proposed triple. Additionally, these methods have traditionally used random paths between fixed entity pairs or more recently learned to pick paths between them. We propose a new algorithm MINERVA, which addresses the much more difficult and practical task of answering questions where the relation is known, but only one entity. Since random walks are impractical in a setting with combinatorially many destinations from a start node, we present a neural reinforcement learning approach which learns how to navigate the graph conditioned on the input query to find predictive paths. Empirically, this approach obtains state-of-the-art results on several datasets, significantly outperforming prior methods.

Includes members:
  Member "deep sets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stochastic latent residual video prediction")
  Member "differentiable learning of logical rules for knowledge base reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the next decade in ai four steps towards robust artificial intelligence")
  Member "end to end differentiable proving":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "knowledge graphs")
  Member "deeppath a reinforcement learning method for knowledge graph reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "scalable neural methods for reasoning with a symbolic knowledge base")
  Member "reasonet learning to stop reading in machine comprehension":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "description based text classification with reinforcement learning")
  Member "convolutional 2d knowledge graph embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "knowledge graphs")
  Member "chains of reasoning over entities relations and text using recurrent neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "query2box reasoning over knowledge graphs in vector space using box embeddings")
  Member "key value memory networks for directly reading documents":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "attention over parameters for dialogue systems")

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)