human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "jointly learning explainable rules for recommendation with knowledge graph"
  Abstract: Explainability and effectiveness are two key aspects for building recommender systems. Prior efforts mostly focus on incorporating side information to achieve better recommendation performance. However, these methods have some weaknesses: (1) prediction of neural network-based embedding methods are hard to explain and debug; (2) symbolic, graph-based approaches (e.g., meta path-based models) require manual efforts and domain knowledge to define patterns and rules, and ignore the item association types (e.g. substitutable and complementary). In this paper, we propose a novel joint learning framework to integrate \textit{induction of explainable rules from knowledge graph} with \textit{construction of a rule-guided neural recommendation model}. The framework encourages two modules to complement each other in generating effective and explainable recommendation: 1) inductive rules, mined from item-centric knowledge graphs, summarize common multi-hop relational patterns for inferring different item associations and provide human-readable explanation for model prediction; 2) recommendation module can be augmented by induced rules and thus have better generalization ability dealing with the cold-start issue. Extensive experiments\footnote{Code and data can be found at: \url{this https URL}} show that our proposed method has achieved significant improvements in item recommendation over baselines on real-world datasets. Our model demonstrates robust performance over "noisy" item knowledge graphs, generated by linking item names to related entities.

Connected through hyperedge HE-1 (induced by source paper "prince provider side interpretability with counterfactual explanations in recommender systems"):
  with members:
    - "fairy a framework for understanding relationships between users actions and their social feeds"
    - "reinforcement knowledge graph reasoning for explainable recommendation"
    - "learning heterogeneous knowledge base embeddings for explainable recommendation"
    - "ripplenet propagating user preferences on the knowledge graph for recommender systems"
    - "explainable reasoning over knowledge graphs for recommendation"
    - "explainable recommendation via multi task learning in opinionated text data"
    - "explainable recommendation a survey and new perspectives"
    - "aurora auditing pagerank on large graphs"

Connected through hyperedge HE-2 (induced by source paper "distilling structured knowledge into embeddings for explainable and accurate recommendation"):
  with members:
    - "neural ir meets graph embedding a ranking model for product search"
    - "deep learning based recommender system a survey and new perspectives"
    - "ripplenet propagating user preferences on the knowledge graph for recommender systems"
    - "explainable recommendation a survey and new perspectives"
    - "neural factorization machines for sparse predictive analytics"
    - "deep mutual learning"
    - "neural collaborative filtering"
    - "heterogeneous information network embedding for recommendation"

Question: Please tell me which class the center node 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)