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 knowledge graph reasoning with reward shaping"):
  Abstract: Multi-hop reasoning is an effective approach for query answering (QA) over incomplete knowledge graphs (KGs). The problem can be formulated in a reinforcement learning (RL) setup, where a policy-based agent sequentially extends its inference path until it reaches a target. However, in an incomplete KG environment, the agent receives low-quality rewards corrupted by false negatives in the training data, which harms generalization at test time. Furthermore, since no golden action sequence is used for training, the agent can be misled by spurious search trajectories that incidentally lead to the correct answer. We propose two modeling advances to address both issues: (1) we reduce the impact of false negative supervision by adopting a pretrained one-hop embedding model to estimate the reward of unobserved facts; (2) we counter the sensitivity to spurious paths of on-policy RL by forcing the agent to explore a diverse set of paths using randomly generated edge masks. Our approach significantly improves over existing path-based KGQA models on several benchmark datasets and is comparable or better than embedding-based models.

Includes members:
  Member "reinforcewalk learning to walk in graph with monte carlo tree search":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "heterogeneous relational reasoning in knowledge graphs with reinforcement learning")
  Member "variational knowledge graph reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dynamically pruned message passing networks for large scale knowledge graph reasoning")
  Member "learning symmetric collaborative dialogue agents with dynamic knowledge graph embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "crwiz a framework for crowdsourcing real time wizard of oz dialogues")
  Member "differentiable learning of logical rules for knowledge base reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the next decade in ai four steps towards robust artificial intelligence")
  Member "from language to programs bridging reinforcement learning and maximum marginal likelihood":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "why build an assistant in minecraft")
  Member "end to end differentiable proving":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "knowledge graphs")
  Member "deeppath a reinforcement learning method for knowledge graph reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "scalable neural methods for reasoning with a symbolic knowledge base")
  Member "go for a walk and arrive at the answer reasoning over paths in knowledge bases using reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "scalable neural methods for reasoning with a symbolic knowledge base")

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.AI(Artificial Intelligence)