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 fact prediction via knowledge enriched tensor factorization"):
  Abstract: We present a family of novel methods for embedding knowledge graphs into real-valued tensors. These tensor-based embeddings capture the ordered relations that are typical in the knowledge graphs represented by semantic web languages like RDF. Unlike many previous models, our methods can easily use prior background knowledge provided by users or extracted automatically from existing knowledge graphs. In addition to providing more robust methods for knowledge graph embedding, we provide a provably-convergent, linear tensor factorization algorithm. We demonstrate the efficacy of our models for the task of predicting new facts across eight different knowledge graphs, achieving between 5% and 50% relative improvement over existing state-of-the-art knowledge graph embedding techniques. Our empirical evaluation shows that all of the tensor decomposition models perform well when the average degree of an entity in a graph is high, with constraint-based models doing better on graphs with a small number of highly similar relations and regularization-based models dominating for graphs with relations of varying degrees of similarity.

Includes members:
  Member "knowledge graph embedding with iterative guidance from soft rules":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "knowledge graphs")
  Member "on the equivalence of holographic and complex embeddings for link prediction":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "autokge searching scoring functions for knowledge graph embedding")
  Member "adversarial sets for regularising neural link predictors":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "analyzing differentiable fuzzy logic operators")
  Member "knowledge base completion baselines strike back":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "knowledge graphs")
  Member "lifted rule injection for relation embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "knowledge graphs")
  Member "complex embeddings for simple link prediction":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "knowledge graph embedding for link prediction a comparative analysis")
  Member "type constrained representation learning in knowledge graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a survey on knowledge graph embeddings with literals which model links better literal ly")

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.LG(Machine Learning)