human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "relation schema induction using tensor factorization with side information"
  Abstract: Given a set of documents from a specific domain (e.g., medical research journals), how do we automatically build a Knowledge Graph (KG) for that domain? Automatic identification of relations and their schemas, i.e., type signature of arguments of relations (e.g., undergo(Patient, Surgery)), is an important first step towards this goal. We refer to this problem as Relation Schema Induction (RSI). In this paper, we propose Schema Induction using Coupled Tensor Factorization (SICTF), a novel tensor factorization method for relation schema induction. SICTF factorizes Open Information Extraction (OpenIE) triples extracted from a domain corpus along with additional side information in a principled way to induce relation schemas. To the best of our knowledge, this is the first application of tensor factorization for the RSI problem. Through extensive experiments on multiple real-world datasets, we find that SICTF is not only more accurate than state-of-the-art baselines, but also significantly faster (about 14x faster).

Connected through hyperedge HE-1 (induced by source paper "neural graph embedding methods for natural language processing"):
  with members:
    - "rotate knowledge graph embedding by relational rotation in complex space"
    - "confidence based graph convolutional networks for semi supervised learning"
    - "hypernetwork knowledge graph embeddings"
    - "cesi canonicalizing open knowledge bases using embeddings and side information"
    - "graph convolution over pruned dependency trees improves relation extraction"
    - "lovasz convolutional networks"
    - "representation learning on graphs with jumping knowledge networks"
    - "graph to sequence learning using gated graph neural networks"

Connected through hyperedge HE-2 (induced by source paper "inductive framework for multi aspect streaming tensor completion with side information"):
  with members:
    - "online low rank tensor subspace tracking from incomplete data by cp decomposition using recursive least squares"
    - "low rank tensor completion a riemannian manifold preconditioning approach"
    - "tensor decompositions for signal processing applications from two way to multiway component analysis"
    - "provable inductive matrix completion"

Connected through hyperedge HE-3 (induced by source paper "cesi canonicalizing open knowledge bases using embeddings and side information"):
  with members:
    - "holographic embeddings of knowledge graphs"
    - "probabilistic similarity logic"
    - "unsupervised methods for determining object and relation synonyms on the web"

Connected through hyperedge HE-4 (induced by source paper "joint matrix tensor factorization for knowledge base inference"):
  with members:
    - "complex embeddings for simple link prediction"
    - "multilingual relation extraction using compositional universal schema"
    - "holographic embeddings of knowledge graphs"
    - "traversing knowledge graphs in vector space"

Connected through hyperedge HE-5 (induced by source paper "event schema induction using tensor factorization with back off"):
  with members:
    - "cross sentence n ary relation extraction with graph lstms"
    - "event representations with tensor based compositions"
    - "neural semantic role labeling with dependency path embeddings"
    - "probabilistic frame induction"

Question: Please tell me which class the center node 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)