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 "fast adaptively weighted matrix factorization for recommendation with implicit feedback"):
  Abstract: Recommendation from implicit feedback is a highly challenging task due to the lack of the reliable observed negative data. A popular and effective approach for implicit recommendation is to treat unobserved data as negative but downweight their confidence. Naturally, how to assign confidence weights and how to handle the large number of the unobserved data are two key problems for implicit recommendation models. However, existing methods either pursuit fast learning by manually assigning simple confidence weights, which lacks flexibility and may create empirical bias in evaluating user's preference; or adaptively infer personalized confidence weights but suffer from low efficiency. To achieve both adaptive weights assignment and efficient model learning, we propose a fast adaptively weighted matrix factorization (FAWMF) based on variational auto-encoder. The personalized data confidence weights are adaptively assigned with a parameterized neural network (function) and the network can be inferred from the data. Further, to support fast and stable learning of FAWMF, a new specific batch-based learning algorithm fBGD has been developed, which trains on all feedback data but its complexity is linear to the number of observed data. Extensive experiments on real-world datasets demonstrate the superiority of the proposed FAWMF and its learning algorithm fBGD.

Includes members:
  Member "adversarial sampling and training for semi supervised information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reinforced negative sampling over knowledge graph for recommendation")
  Member "collaborative filtering with social exposure a modular approach to social recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tripartite heterogeneous graph propagation for large scale social recommendation")
  Member "neural collaborative filtering":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "learning to hash with graph neural networks for recommender systems")
  Member "on sampling strategies for neural network based collaborative filtering":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a simple framework for contrastive learning of visual representations")
  Member "irgan a minimax game for unifying generative and discriminative information retrieval models":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "advances in collaborative filtering and ranking")
  Member "a generic coordinate descent framework for learning from implicit feedback":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "estimation action reflection towards deep interaction between conversational and recommender systems")
  Member "bpr bayesian personalized ranking from implicit feedback":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")

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)