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 "learning beyond datasets knowledge graph augmented neural networks for natural language processing"):
  Abstract: Machine Learning has been the quintessential solution for many AI problems, but learning is still heavily dependent on the specific training data. Some learning models can be incorporated with a prior knowledge in the Bayesian set up, but these learning models do not have the ability to access any organised world knowledge on demand. In this work, we propose to enhance learning models with world knowledge in the form of Knowledge Graph (KG) fact triples for Natural Language Processing (NLP) tasks. Our aim is to develop a deep learning model that can extract relevant prior support facts from knowledge graphs depending on the task using attention mechanism. We introduce a convolution-based model for learning representations of knowledge graph entity and relation clusters in order to reduce the attention space. We show that the proposed method is highly scalable to the amount of prior information that has to be processed and can be applied to any generic NLP task. Using this method we show significant improvement in performance for text classification with News20, DBPedia datasets and natural language inference with Stanford Natural Language Inference (SNLI) dataset. We also demonstrate that a deep learning model can be trained well with substantially less amount of labeled training data, when it has access to organised world knowledge in the form of knowledge graph.

Includes members:
  Member "machine learning with world knowledge the position and survey":
    also connected through other hyperedges:
      (none)
  Member "lstm a search space odyssey":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "refined gate a simple and effective gating mechanism for recurrent units")
  Member "ssp semantic space projection for knowledge graph embedding with text descriptions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "can x2vec save lives integrating graph and language embeddings for automatic mental health classification")
  Member "deep hashing a joint approach for image signature learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bilinear supervised hashing based on 2d image features")
  Member "a survey of inductive biases for factorial representation learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "weakly supervised disentanglement without compromises")
  Member "the more you know using knowledge graphs for image classification":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "relationship embedded representation learning for grounding referring expressions")
  Member "proje embedding projection for knowledge graph completion":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a benchmarking study of embedding based entity alignment for knowledge graphs")
  Member "effective approaches to attention based neural machine translation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)