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 "uniwalk explainable and accurate recommendation for rating and network data"):
  Abstract: How can we leverage social network data and observed ratings to correctly recommend proper items and provide a persuasive explanation for the recommendations? Many online services provide social networks among users, and it is crucial to utilize social information since recommendation by a friend is more likely to grab attention than the one from a random user. Also, explaining why items are recommended is very important in encouraging the users' actions such as actual purchases. Exploiting both ratings and social graph for recommendation, however, is not trivial because of the heterogeneity of the data. #R##N#In this paper, we propose UniWalk, an explainable and accurate recommender system that exploits both social network and rating data. UniWalk combines both data into a unified graph, learns latent features of users and items, and recommends items to each user through the features. Importantly, it explains why items are recommended together with the recommendation results. Extensive experiments show that UniWalk provides the best explainability and achieves the state-of-the-art-accuracy.

Includes members:
  Member "fast accurate and scalable method for sparse coupled matrix tensor factorization":
    also connected through other hyperedges:
      (none)
  Member "node2vec scalable feature learning for networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deep graph matching consensus")
  Member "why should i trust you explaining the predictions of any classifier":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure and robust machine learning for healthcare a survey")
  Member "line large scale information network embedding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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)