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 "randomized prediction games for adversarial machine learning"):
  Abstract: In spam and malware detection, attackers exploit randomization to obfuscate malicious data and increase their chances of evading detection at test time, e.g., malware code is typically obfuscated using random strings or byte sequences to hide known exploits. Interestingly, randomization has also been proposed to improve security of learning algorithms against evasion attacks, as it results in hiding information about the classifier to the attacker. Recent work has proposed game-theoretical formulations to learn secure classifiers, by simulating different evasion attacks and modifying the classification function accordingly. However, both the classification function and the simulated data manipulations have been modeled in a deterministic manner, without accounting for any form of randomization. In this paper, we overcome this limitation by proposing a randomized prediction game, namely, a noncooperative game-theoretic formulation in which the classifier and the attacker make randomized strategy selections according to some probability distribution defined over the respective strategy set. We show that our approach allows one to improve the tradeoff between attack detection and false alarms with respect to the state-of-the-art secure classifiers, even against attacks that are different from those hypothesized during design, on application examples including handwritten digit recognition, spam, and malware detection.

Includes members:
  Member "is feature selection secure against training data poisoning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "certified robustness to label flipping attacks via randomized smoothing")
  Member "is data clustering in adversarial settings secure":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adversarial learning in statistical classification a comprehensive review of defenses against attacks")
  Member "security evaluation of pattern classifiers under attack":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fault sneaking attack a stealthy framework for misleading deep neural networks")
  Member "security evaluation of support vector machines in adversarial environments":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "adversarial security attacks and perturbations on machine learning and deep learning methods")
  Member "evasion attacks against machine learning at test time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure and robust machine learning for healthcare a survey")
  Member "poisoning attacks against support vector machines":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure and robust machine learning for healthcare a survey")
  Member "stackelberg vs nash in security games an extended investigation of interchangeability equivalence and uniqueness":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "spatial temporal moving target defense a markov stackelberg game model")

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.LG(Machine Learning)