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 "user guided clustering in heterogeneous information networks via motif based comprehensive transcription"):
  Abstract: Heterogeneous information networks (HINs) with rich semantics are ubiquitous in real-world applications. For a given HIN, many reasonable clustering results with distinct semantic meaning can simultaneously exist. User-guided clustering is hence of great practical value for HINs where users provide labels to a small portion of nodes. To cater to a broad spectrum of user guidance evidenced by different expected clustering results, carefully exploiting the signals residing in the data is potentially useful. Meanwhile, as one type of complex networks, HINs often encapsulate higher-order interactions that reflect the interlocked nature among nodes and edges. Network motifs, sometimes referred to as meta-graphs, have been used as tools to capture such higher-order interactions and reveal the many different semantics. We therefore approach the problem of user-guided clustering in HINs with network motifs. In this process, we identify the utility and importance of directly modeling higher-order interactions without collapsing them to pairwise interactions. To achieve this, we comprehensively transcribe the higher-order interaction signals to a series of tensors via motifs and propose the MoCHIN model based on joint non-negative tensor factorization. This approach applies to arbitrarily many, arbitrary forms of HIN motifs. An inference algorithm with speed-up methods is also proposed to tackle the challenge that tensor size grows exponentially as the number of nodes in a motif increases. We validate the effectiveness of the proposed method on two real-world datasets and three tasks, and MoCHIN outperforms all baselines in three evaluation tasks under three different metrics. Additional experiments demonstrated the utility of motifs and the benefit of directly modeling higher-order information especially when user guidance is limited.

Includes members:
  Member "meta graph based hin spectral embedding methods analyses and insights":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cube2net efficient query specific network construction with data cube organization")
  Member "easing embedding learning by comprehensive transcription of heterogeneous information networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "discovering hypernymy in text rich heterogeneous information network by exploiting context granularity")
  Member "higher order spectral clustering for heterogeneous graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "heterogeneous network motifs")
  Member "aspem embedding learning by aspects in heterogeneous information networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "task guided pair embedding in heterogeneous network")
  Member "prep path based relevance from a probabilistic perspective in heterogeneous information networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "neural embedding propagation on heterogeneous networks")
  Member "motif based convolutional neural network on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "inf vae a variational autoencoder framework to integrate homophily and influence in diffusion prediction")
  Member "higher order organization of complex networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hypergraph motifs concepts algorithms and discoveries")
  Member "task guided and path augmented heterogeneous network embedding for author identification":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "attentive knowledge graph embedding for personalized recommendation")

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.SI(Social and Information Networks)