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 "knowledge graph embedding with entity neighbors and deep memory network"):
  Abstract: Knowledge Graph Embedding (KGE) aims to represent entities and relations of knowledge graph in a low-dimensional continuous vector space. Recent works focus on incorporating structural knowledge with additional information, such as entity descriptions, relation paths and so on. However, common used additional information usually contains plenty of noise, which makes it hard to learn valuable representation. In this paper, we propose a new kind of additional information, called entity neighbors, which contain both semantic and topological features about given entity. We then develop a deep memory network model to encode information from neighbors. Employing a gating mechanism, representations of structure and neighbors are integrated into a joint representation. The experimental results show that our model outperforms existing KGE methods utilizing entity descriptions and achieves state-of-the-art metrics on 4 datasets.

Includes members:
  Member "question answering on knowledge bases and text using universal schema and memory networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning cross context entity representations from text")
  Member "deeppath a reinforcement learning method for knowledge graph reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "scalable neural methods for reasoning with a symbolic knowledge base")
  Member "analogical inference for multi relational embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a benchmarking study of embedding based entity alignment for knowledge graphs")
  Member "convolutional 2d knowledge graph embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "knowledge graphs")
  Member "knowledge graph representation with jointly structural and textual encoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "paperrobot incremental draft generation of scientific ideas")
  Member "leveraging video descriptions to learn video question answering":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "visual question answering on 360 deg images")
  Member "dynamic memory networks for visual and textual question answering":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "component analysis for visual question answering architectures")
  Member "complex embeddings for simple link prediction":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "knowledge graph embedding for link prediction a comparative analysis")

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)