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 "practical privacy preserving poi recommendation"):
  Abstract: Point-of-Interest (POI) recommendation has been extensively studied and successfully applied in industry recently. However, most existing approaches build centralized models on the basis of collecting users' data. Both private data and models are held by the recommender, which causes serious privacy concerns. In this paper, we propose a novel Privacy preserving POI Recommendation (PriRec) framework. First, to protect data privacy, users' private data (features and actions) are kept on their own side, e.g., Cellphone or Pad. Meanwhile, the public data need to be accessed by all the users are kept by the recommender to reduce the storage costs of users' devices. Those public data include: (1) static data only related to the status of POI, such as POI categories, and (2) dynamic data depend on user-POI actions such as visited counts. The dynamic data could be sensitive, and we develop local differential privacy techniques to release such data to public with privacy guarantees. Second, PriRec follows the representations of Factorization Machine (FM) that consists of linear model and the feature interaction model. To protect the model privacy, the linear models are saved on users' side, and we propose a secure decentralized gradient descent protocol for users to learn it collaboratively. The feature interaction model is kept by the recommender since there is no privacy risk, and we adopt secure aggregation strategy in federated learning paradigm to learn it. To this end, PriRec keeps users' private raw data and models in users' own hands, and protects user privacy to a large extent. We apply PriRec in real-world datasets, and comprehensive experiments demonstrate that, compared with FM, PriRec achieves comparable or even better recommendation accuracy.

Includes members:
  Member "semi supervised learning meets factorization learning to recommend with chain graph model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure social recommendation based on secret sharing")
  Member "privacy preserving point of interest recommendation using decentralized matrix factorization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "federated clustering via matrix factorization models from model averaging to gradient sharing")
  Member "secure social recommendation based on secret sharing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "industrial scale privacy preserving deep neural network")
  Member "federated learning strategies for improving communication efficiency":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "trends and advancements in deep neural network communication")
  Member "billion scale commodity embedding for e commerce recommendation in alibaba":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey of adversarial learning on graphs")
  Member "distributed collaborative hashing and its applications in ant financial":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure social recommendation based on secret sharing")
  Member "neural collaborative filtering":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "advances in collaborative filtering and ranking")
  Member "deepfm a factorization machine based neural network for ctr prediction":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")

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.CR(Cryptography and Security)