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 "meta reasoning over knowledge graphs"):
  Abstract: The ability to reason over learned knowledge is an innate ability for humans and humans can easily master new reasoning rules with only a few demonstrations. While most existing studies on knowledge graph (KG) reasoning assume enough training examples, we study the challenging and practical problem of few-shot knowledge graph reasoning under the paradigm of meta-learning. We propose a new meta learning framework that effectively utilizes the task-specific meta information such as local graph neighbors and reasoning paths in KGs. Specifically, we design a meta-encoder that encodes the meta information into task-specific initialization parameters for different tasks. This allows our reasoning module to have diverse starting points when learning to reason over different relations, which is expected to better fit the target task. On two few-shot knowledge base completion benchmarks, we show that the augmented task-specific meta-encoder yields much better initial point than MAML and outperforms several few-shot learning baselines.

Includes members:
  Member "a closer look at few shot classification":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "revisiting meta learning as supervised learning")
  Member "on first order meta learning algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "meta learning with latent embedding optimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "revisiting meta learning as supervised learning")
  Member "variational knowledge graph reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dynamically pruned message passing networks for large scale knowledge graph reasoning")
  Member "one shot relational learning for knowledge graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "heterogeneous relational reasoning in knowledge graphs with reinforcement learning")
  Member "m walk learning to walk over graphs using monte carlo tree search":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "heterogeneous relational reasoning in knowledge graphs with reinforcement learning")
  Member "improved neural relation detection for knowledge base question answering":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "neural relation prediction for simple question answering over knowledge graph")
  Member "deeppath a reinforcement learning method for knowledge graph reasoning":
    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.CL(Computation and Language)