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 "expeditious generation of knowledge graph embeddings"):
  Abstract: Knowledge Graph Embedding methods aim at representing entities and relations in a knowledge base as points or vectors in a continuous vector space. Several approaches using embeddings have shown promising results on tasks such as link prediction, entity recommendation, question answering, and triplet classification. However, only a few methods can compute low-dimensional embeddings of very large knowledge bases. In this paper, we propose KG2Vec, a novel approach to Knowledge Graph Embedding based on the skip-gram model. Instead of using a predefined scoring function, we learn it relying on Long Short-Term Memories. We evaluated the goodness of our embeddings on knowledge graph completion and show that KG2Vec is comparable to the quality of the scalable state-of-the-art approaches and can process large graphs by parsing more than a hundred million triples in less than 6 hours on common hardware.

Includes members:
  Member "neural information retrieval a literature review":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an analysis of word2vec for the italian language")
  Member "modeling relation paths for representation learning of knowledge bases":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "knowledge graph embedding for link prediction a comparative analysis")
  Member "locally adaptive translation for knowledge graph embedding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "kgvec2go knowledge graph embeddings as a service")
  Member "holographic embeddings of knowledge graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "knowledge graphs")
  Member "transg a generative mixture model for knowledge graph embedding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "augmenting neural machine translation with knowledge graphs")
  Member "distributed representations of words and phrases and their compositionality":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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.CL(Computation and Language)