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 "generating reliable friends via adversarial training to improve social recommendation"):
  Abstract: Most of the recent studies of social recommendation assume that people share similar preferences with their friends and the online social relations are helpful in improving traditional recommender systems. However, this assumption is often untenable as the online social networks are quite sparse and a majority of users only have a small number of friends. Besides, explicit friends may not share similar interests because of the randomness in the process of building social networks. Therefore, discovering a number of reliable friends for each user plays an important role in advancing social recommendation. Unlike other studies which focus on extracting valuable explicit social links, our work pays attention to identifying reliable friends in both the observed and unobserved social networks. Concretely, in this paper, we propose an end-to-end social recommendation framework based on Generative Adversarial Nets (GAN). The framework is composed of two blocks: a generator that is used to produce friends that can possibly enhance the social recommendation model, and a discriminator that is responsible for assessing these generated friends and ranking the items according to both the current user and her friends' preferences. With the competition between the generator and the discriminator, our framework can dynamically and adaptively generate reliable friends who can perfectly predict the current user' preference at a specific time. As a result, the sparsity and unreliability problems of explicit social relations can be mitigated and the social recommendation performance is significantly improved. Experimental studies on real-world datasets demonstrate the superiority of our framework and verify the positive effects of the generated reliable friends.

Includes members:
  Member "a neural influence diffusion model for social recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lightgcn simplifying and powering graph convolution network for recommendation")
  Member "graph neural networks for social recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on the expressive power of graph neural networks")
  Member "adversarial training towards robust multimedia recommender system":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "recommender systems based on generative adversarial networks a problem driven perspective")
  Member "adversarial personalized ranking for recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "adversarial ranking attack and defense")
  Member "neural collaborative filtering":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "advances in collaborative filtering and ranking")
  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 "extracting implicit social relation for social recommendation techniques in user rating prediction":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "compressive closeness in networks")
  Member "line large scale information network embedding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "adversarial attacks and defenses on graphs a review and empirical study")

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)