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 "learning to hash with graph neural networks for recommender systems"):
  Abstract: Graph representation learning has attracted much attention in supporting high quality candidate search at scale. Despite its effectiveness in learning embedding vectors for objects in the user-item interaction network, the computational costs to infer users' preferences in continuous embedding space are tremendous. In this work, we investigate the problem of hashing with graph neural networks (GNNs) for high quality retrieval, and propose a simple yet effective discrete representation learning framework to jointly learn continuous and discrete codes. Specifically, a deep hashing with GNNs (HashGNN) is presented, which consists of two components, a GNN encoder for learning node representations, and a hash layer for encoding representations to hash codes. The whole architecture is trained end-to-end by jointly optimizing two losses, i.e., reconstruction loss from reconstructing observed links, and ranking loss from preserving the relative ordering of hash codes. A novel discrete optimization strategy based on straight through estimator (STE) with guidance is proposed. The principal idea is to avoid gradient magnification in back-propagation of STE with continuous embedding guidance, in which we begin from learning an easier network that mimic the continuous embedding and let it evolve during the training until it finally goes back to STE. Comprehensive experiments over three publicly available and one real-world Alibaba company datasets demonstrate that our model not only can achieve comparable performance compared with its continuous counterpart but also runs multiple times faster during inference.

Includes members:
  Member "is a single vector enough exploring node polysemy for network embedding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deep structured cross modal anomaly detection")
  Member "deep representation learning for social network analysis":
    also connected through other hyperedges:
      (none)
  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 "neural graph collaborative filtering":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lightgcn simplifying and powering graph convolution network for recommendation")
  Member "deep learning based recommender system a survey and new perspectives":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")
  Member "graph convolutional neural networks for web scale recommender systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on the expressive power of graph neural networks")
  Member "network embedding as matrix factorization unifying deepwalk line pte and node2vec":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "adversarial attacks and defenses on graphs a review and empirical study")
  Member "hierarchical graph representation learning with differentiable pooling":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "memory based graph networks")

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)