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 "open knowledge enrichment for long tail entities"):
  Abstract: Knowledge bases (KBs) have gradually become a valuable asset for many AI applications. While many current KBs are quite large, they are widely acknowledged as incomplete, especially lacking facts of long-tail entities, e.g., less famous persons. Existing approaches enrich KBs mainly on completing missing links or filling missing values. However, they only tackle a part of the enrichment problem and lack specific considerations regarding long-tail entities. In this paper, we propose a full-fledged approach to knowledge enrichment, which predicts missing properties and infers true facts of long-tail entities from the open Web. Prior knowledge from popular entities is leveraged to improve every enrichment step. Our experiments on the synthetic and real-world datasets and comparison with related work demonstrate the feasibility and superiority of the approach.

Includes members:
  Member "long tail relation extraction via knowledge graph embeddings and graph convolution networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "relation adversarial network for low resource knowledgegraph completion")
  Member "rotate knowledge graph embedding by relational rotation in complex space":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a benchmarking study of embedding based entity alignment for knowledge graphs")
  Member "truth inference at scale a bayesian model for adjudicating highly redundant crowd annotations":
    also connected through other hyperedges:
      (none)
  Member "ceres distantly supervised relation extraction from the semi structured web":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "knowledge graphs")
  Member "neural collaborative filtering":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "advances in collaborative filtering and ranking")
  Member "fast matrix factorization for online recommendation with implicit feedback":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning to hash with graph neural networks for recommender systems")
  Member "open world 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 "convolutional 2d knowledge graph embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "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.IR(Information Retrieval)