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 task neural network for non discrete attribute prediction in knowledge graphs"):
  Abstract: Many popular knowledge graphs such as Freebase, YAGO or DBPedia maintain a list of non-discrete attributes for each entity. Intuitively, these attributes such as height, price or population count are able to richly characterize entities in knowledge graphs. This additional source of information may help to alleviate the inherent sparsity and incompleteness problem that are prevalent in knowledge graphs. Unfortunately, many state-of-the-art relational learning models ignore this information due to the challenging nature of dealing with non-discrete data types in the inherently binary-natured knowledge graphs. In this paper, we propose a novel multi-task neural network approach for both encoding and prediction of non-discrete attribute information in a relational setting. Specifically, we train a neural network for triplet prediction along with a separate network for attribute value regression. Via multi-task learning, we are able to learn representations of entities, relations and attributes that encode information about both tasks. Moreover, such attributes are not only central to many predictive tasks as an information source but also as a prediction target. Therefore, models that are able to encode, incorporate and predict such information in a relational learning context are highly attractive as well. We show that our approach outperforms many state-of-the-art methods for the tasks of relational triplet classification and attribute value prediction.

Includes members:
  Member "learning to rank question answer pairs with holographic dual lstm architecture":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "text based question answering from information retrieval and deep neural network perspectives a survey")
  Member "an interpretable knowledge transfer model for knowledge base completion":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hyperkg hyperbolic knowledge graph embeddings for knowledge base completion")
  Member "a joint many task model growing a neural network for multiple nlp tasks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "attention over parameters for dialogue systems")
  Member "recurrent neural network for text classification with multi task learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "meta embeddings based on self attention")
  Member "stranse a novel embedding model of entities and relationships in knowledge bases":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "knowledge graph embedding for link prediction a comparative analysis")
  Member "modeling relation paths for representation learning of knowledge bases":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "knowledge graph embedding for link prediction a comparative analysis")
  Member "adam a method for stochastic optimization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "distributed representations of words and phrases and their compositionality":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "multi simlex a large scale evaluation of multilingual and cross lingual lexical semantic similarity")

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)