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 "poisoning attacks to graph based recommender systems"):
  Abstract: Recommender system is an important component of many web services to help users locate items that match their interests. Several studies showed that recommender systems are vulnerable to poisoning attacks, in which an attacker injects fake data to a recommender system such that the system makes recommendations as the attacker desires. However, these poisoning attacks are either agnostic to recommendation algorithms or optimized to recommender systems (e.g., association-rule-based or matrix-factorization-based recommender systems) that are not graph-based. Like association-rule-based and matrix-factorization-based recommender systems, graph-based recommender system is also deployed in practice, e.g., eBay, Huawei App Store (a big app store in China). However, how to design optimized poisoning attacks for graph-based recommender systems is still an open problem.   In this work, we perform a systematic study on poisoning attacks to graph-based recommender systems. We consider an attacker's goal is to promote a target item to be recommended to as many users as possible. To achieve this goal, our a"acks inject fake users with carefully crafted rating scores to the recommender system. Due to limited resources and to avoid detection, we assume the number of fake users that can be injected into the system is bounded. The key challenge is how to assign rating scores to the fake users such that the target item is recommended to as many normal users as possible. To address the challenge, we formulate the poisoning attacks as an optimization problem, solving which determines the rating scores for the fake users. We also propose techniques to solve the optimization problem. We evaluate our attacks and compare them with existing attacks under white-box (recommendation algorithm and its parameters are known), gray-box (recommendation algorithm is known but its parameters are unknown), and blackbox (recommendation algorithm is unknown) settings using two real-world datasets. Our results show that our attack is effective and outperforms existing attacks for graph-based recommender systems. For instance, when 1% of users are injected fake users, our attack can make a target item recommended to 580 times more normal users in certain scenarios.

Includes members:
  Member "graph convolutional neural networks for web scale recommender systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on the expressive power of graph neural networks")
  Member "structure based sybil detection in social networks via local rule based propagation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "attacking graph based classification via manipulating the graph structure")
  Member "attriguard a practical defense against attribute inference attacks via adversarial machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dynamic backdoor attacks against machine learning models")
  Member "neural collaborative filtering":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "advances in collaborative filtering and ranking")
  Member "a graph based push service platform":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deeper insights into graph convolutional networks for semi supervised learning")
  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 "sybilbelief a semi supervised learning approach for structure based sybil detection":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "defending against machine learning based inference attacks via adversarial examples opportunities and challenges")

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)