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 "data poisoning attacks on neighborhood based recommender systems"):
  Abstract: Nowadays, collaborative filtering recommender systems have been widely deployed in many commercial companies to make profit. Neighbourhood-based collaborative filtering is common and effective. To date, despite its effectiveness, there has been little effort to explore their robustness and the impact of data poisoning attacks on their performance. Can the neighbourhood-based recommender systems be easily fooled? To this end, we shed light on the robustness of neighbourhood-based recommender systems and propose a novel data poisoning attack framework encoding the purpose of attack and constraint against them. We firstly illustrate how to calculate the optimal data poisoning attack, namely UNAttack. We inject a few well-designed fake users into the recommender systems such that target items will be recommended to as many normal users as possible. Extensive experiments are conducted on three real-world datasets to validate the effectiveness and the transferability of our proposed method. Besides, some interesting phenomenons can be found. For example, 1) neighbourhood-based recommender systems with Euclidean Distance-based similarity have strong robustness. 2) the fake users can be transferred to attack the state-of-the-art collaborative filtering recommender systems such as Neural Collaborative Filtering and Bayesian Personalized Ranking Matrix Factorization.

Includes members:
  Member "data poisoning against differentially private learners attacks and defenses":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the effectiveness of mitigating data poisoning attacks with gradient shaping")
  Member "data poisoning attack against knowledge graph embedding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey of adversarial learning on graphs")
  Member "are we really making much progress a worrying analysis of recent neural recommendation approaches":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "simple and effective graph autoencoders with one hop linear models")
  Member "poisoning attacks to graph based recommender systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mga momentum gradient attack on network")
  Member "transferability in machine learning from phenomena to black box attacks using adversarial samples":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "adversarial ranking attack and defense")
  Member "you are who you know and how you behave attribute inference attacks via users social friends and behaviors":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "everything about you a multimodal approach towards friendship inference in online social networks")
  Member "data poisoning attacks on factorization based collaborative filtering":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "humpty dumpty controlling word meanings via corpus poisoning")
  Member "adversarial machine learning at scale":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "adversarial ranking attack and defense")

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)