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 "label propagation on k partite graphs with heterophily"):
  Abstract: In this paper, for the first time, we study label propagation in heterogeneous graphs under heterophily assumption. Homophily label propagation (i.e., two connected nodes share similar labels) in homogeneous graph (with same types of vertices and relations) has been extensively studied before. Unfortunately, real-life networks are heterogeneous, they contain different types of vertices (e.g., users, images, texts) and relations (e.g., friendships, co-tagging) and allow for each node to propagate both the same and opposite copy of labels to its neighbors. We propose a $\mathcal{K}$-partite label propagation model to handle the mystifying combination of heterogeneous nodes/relations and heterophily propagation. With this model, we develop a novel label inference algorithm framework with update rules in near-linear time complexity. Since real networks change over time, we devise an incremental approach, which supports fast updates for both new data and evidence (e.g., ground truth labels) with guaranteed efficiency. We further provide a utility function to automatically determine whether an incremental or a re-modeling approach is favored. Extensive experiments on real datasets have verified the effectiveness and efficiency of our approach, and its superiority over the state-of-the-art label propagation methods.

Includes members:
  Member "scalable temporal latent space inference for link prediction in dynamic social networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dyngraph2vec capturing network dynamics using dynamic graph representation learning")
  Member "a survey of heterogeneous information network analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "prince provider side interpretability with counterfactual explanations in recommender systems")
  Member "joint inference of multiple label types in large networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "end to end robustness for sensing reasoning machine learning pipelines")
  Member "tripartite graph clustering for dynamic sentiment analysis on social media":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "heterogeneous information network model for equipment standard system")
  Member "linearized and single pass belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "factorized graph representations for semi supervised learning from sparse data")
  Member "learning under concept drift an overview":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "models for predicting community specific interest in news articles")
  Member "on the complexity of nonnegative matrix factorization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "convergence to second order stationarity for non negative matrix factorization provably and concurrently")

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)