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 "tucker tensor factorization for knowledge graph completion"):
  Abstract: Knowledge graphs are structured representations of real world facts. However, they typically contain only a small subset of all possible facts. Link prediction is a task of inferring missing facts based on existing ones. We propose TuckER, a relatively straightforward but powerful linear model based on Tucker decomposition of the binary tensor representation of knowledge graph triples. TuckER outperforms previous state-of-the-art models across standard link prediction datasets, acting as a strong baseline for more elaborate models. We show that TuckER is a fully expressive model, derive sufficient bounds on its embedding dimensionalities and demonstrate that several previously introduced linear models can be viewed as special cases of TuckER.

Includes members:
  Member "rotate knowledge graph embedding by relational rotation in complex space":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a benchmarking study of embedding based entity alignment for knowledge graphs")
  Member "hypernetwork knowledge graph embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "knowledge graphs")
  Member "m walk learning to walk over graphs using monte carlo tree search":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "heterogeneous relational reasoning in knowledge graphs with reinforcement learning")
  Member "differentiable learning of logical rules for knowledge base reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the next decade in ai four steps towards robust artificial intelligence")
  Member "mutan multimodal tucker fusion for visual question answering":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "component analysis for visual question answering architectures")
  Member "toruse knowledge graph embedding on a lie group":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "knowledge graph embedding for link prediction a comparative analysis")
  Member "go for a walk and arrive at the answer reasoning over paths in knowledge bases using reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "a benchmarking study of embedding based entity alignment for knowledge graphs")

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)