human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "data poisoning attacks on factorization based collaborative filtering"
  Abstract: Recommendation and collaborative filtering systems are important in modern information and e-commerce applications. As these systems are becoming increasingly popular in the industry, their outputs could affect business decision making, introducing incentives for an adversarial party to compromise the availability or integrity of such systems. We introduce a data poisoning attack on collaborative filtering systems. We demonstrate how a powerful attacker with full knowledge of the learner can generate malicious data so as to maximize his/her malicious objectives, while at the same time mimicking normal user behavior to avoid being detected. While the complete knowledge assumption seems extreme, it enables a robust assessment of the vulnerability of collaborative filtering schemes to highly motivated attacks. We present efficient solutions for two popular factorization-based collaborative filtering algorithms: the \emph{alternative minimization} formulation and the \emph{nuclear norm minimization} method. Finally, we test the effectiveness of our proposed algorithms on real-world data and discuss potential defensive strategies.

Connected through hyperedge HE-1 (induced by source paper "humpty dumpty controlling word meanings via corpus poisoning"):
  with members:
    - "towards a robust deep neural network in text domain a survey"
    - "universal adversarial triggers for attacking and analyzing nlp"
    - "cross lingual alignment of contextual word embeddings with applications to zero shot dependency parsing"
    - "understanding the origins of bias in word embeddings"
    - "adversarial attacks on node embeddings via graph poisoning"
    - "black box generation of adversarial text sequences to evade deep learning classifiers"
    - "deep text classification can be fooled"
    - "towards understanding linear word analogies"

Connected through hyperedge HE-2 (induced by source paper "dataset distillation"):
  with members:
    - "network dissection quantifying interpretability of deep visual representations"
    - "few shot adversarial domain adaptation"
    - "data distillation towards omni supervised learning"
    - "mobilenets efficient convolutional neural networks for mobile vision applications"
    - "towards poisoning of deep learning algorithms with back gradient optimization"
    - "data free knowledge distillation for deep neural networks"
    - "delving deep into rectifiers surpassing human level performance on imagenet classification"
    - "understanding deep image representations by inverting them"

Connected through hyperedge HE-3 (induced by source paper "influence function based data poisoning attacks to top n recommender systems"):
  with members:
    - "private and communication efficient edge learning a sparse differential gaussian masking distributed sgd approach"
    - "byzantine resilient stochastic gradient descent for distributed learning a lipschitz inspired coordinate wise median approach"
    - "on the accuracy of influence functions for measuring group effects"
    - "local model poisoning attacks to byzantine robust federated learning"
    - "attacking graph based classification via manipulating the graph structure"
    - "poisoning attacks to graph based recommender systems"
    - "data dropout optimizing training data for convolutional neural networks"
    - "byzantine robust distributed learning towards optimal statistical rates"

Connected through hyperedge HE-4 (induced by source paper "action manipulation attacks against stochastic bandits attacks and defense"):
  with members:
    - "robust stochastic bandit algorithms under probabilistic unbounded adversarial attack"
    - "data poisoning attacks on stochastic bandits"
    - "the intrinsic robustness of stochastic bandits to strategic manipulation"
    - "stochastic bandits robust to adversarial corruptions"
    - "data poisoning attacks in contextual bandits"
    - "is feature selection secure against training data poisoning"
    - "adversarial attacks on neural network policies"
    - "tactics of adversarial attack on deep reinforcement learning agents"

Connected through hyperedge HE-5 (induced by source paper "adversarial attacks on linear contextual bandits"):
  with members:
    - "stochastic linear optimization with adversarial corruption"
    - "data poisoning attacks on stochastic bandits"
    - "corruption robust exploration in episodic reinforcement learning"
    - "better algorithms for stochastic bandits with adversarial corruptions"
    - "targeted attacks on deep reinforcement learning agents through adversarial observations"
    - "manipulating machine learning poisoning attacks and countermeasures for regression learning"
    - "data poisoning attacks in contextual bandits"
    - "adversarial bandits with knapsacks"

Connected through hyperedge HE-6 (induced by source paper "defending against machine learning based inference attacks via adversarial examples opportunities and challenges"):
  with members:
    - "certified adversarial robustness via randomized smoothing"
    - "misleading authorship attribution of source code using adversarial learning"
    - "mockingbird defending against deep learning based website fingerprinting attacks with adversarial traces"
    - "tagvisor a privacy advisor for sharing hashtags"
    - "generative adversarial privacy"
    - "poisoning attacks to graph based recommender systems"
    - "graph based security and privacy analytics via collective classification with joint weight learning and propagation"
    - "adversarial binaries for authorship identification"

Connected through hyperedge HE-7 (induced by source paper "attacking graph based classification via manipulating the graph structure"):
  with members:
    - "adversarial attacks on graph neural networks via meta learning"
    - "certifiable robustness and robust training for graph convolutional networks"
    - "adversarial attack on graph structured data"
    - "adversarial attacks on node embeddings via graph poisoning"
    - "poisoning attacks to graph based recommender systems"
    - "graph based security and privacy analytics via collective classification with joint weight learning and propagation"
    - "structure based sybil detection in social networks via local rule based propagation"
    - "manipulating machine learning poisoning attacks and countermeasures for regression learning"

Connected through hyperedge HE-8 (induced by source paper "local model poisoning attacks to byzantine robust federated learning"):
  with members:
    - "attacking graph based classification via manipulating the graph structure"
    - "analyzing federated learning through an adversarial lens"
    - "exploiting unintended feature leakage in collaborative learning"
    - "federated learning strategies for improving communication efficiency"
    - "poisoning attacks to graph based recommender systems"
    - "byzantine robust distributed learning towards optimal statistical rates"
    - "manipulating machine learning poisoning attacks and countermeasures for regression learning"
    - "is feature selection secure against training data poisoning"

Question: Please tell me which class the center node 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.LG(Machine Learning)