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 "binarized collaborative filtering with distilling graph convolutional networks"):
  Abstract: The efficiency of top-K item recommendation based on implicit feedback are vital to recommender systems in real world, but it is very challenging due to the lack of negative samples and the large number of candidate items. To address the challenges, we firstly introduce an improved Graph Convolutional Network~(GCN) model with high-order feature interaction considered. Then we distill the ranking information derived from GCN into binarized collaborative filtering, which makes use of binary representation to improve the efficiency of online recommendation. However, binary codes are not only hard to be optimized but also likely to incur the loss of information during the training processing. Therefore, we propose a novel framework to convert the binary constrained optimization problem into an equivalent continuous optimization problem with a stochastic penalty. The binarized collaborative filtering model is then easily optimized by many popular solvers like SGD and Adam. The proposed algorithm is finally evaluated on three real-world datasets and shown the superiority to the competing baselines.

Includes members:
  Member "ranking distillation learning compact ranking models with high performance for recommender system":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "aibench an agile domain specific benchmarking methodology and an ai benchmark suite")
  Member "towards binary valued gates for robust lstm training":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "training progressively binarizing deep networks using fpgas")
  Member "learning from history and present next item recommendation via discriminatively exploiting user behaviors":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep learning for sequential recommendation algorithms influential factors and evaluations")
  Member "large scale learnable graph convolutional networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "transferring robustness for graph neural network against poisoning attacks")
  Member "geometric matrix completion with recurrent multi graph neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "advances in collaborative filtering and ranking")
  Member "deep cross network for ad click predictions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cross gcn enhancing graph convolutional network with k order feature interactions")
  Member "darkrank accelerating deep metric learning via cross sample similarities transfer":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "binaryconnect training deep neural networks with binary weights during propagations":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "sparse weight activation training")

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)