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: "certified robustness to label flipping attacks via randomized smoothing"
  Abstract: Machine learning algorithms are known to be susceptible to data poisoning attacks, where an adversary manipulates the training data to degrade performance of the resulting classifier. While many heuristic defenses have been proposed, few defenses exist which are certified against worst-case corruption of the training data. In this work, we propose a strategy to build linear classifiers that are certifiably robust against a strong variant of label-flipping, where each test example is targeted independently. In other words, for each test point, our classifier makes a prediction and includes a certification that its prediction would be the same had some number of training labels been changed adversarially. Our approach leverages randomized smoothing, a technique that has previously been used to guarantee---with high probability---test-time robustness to adversarial manipulation of the input to a classifier. We derive a variant which provides a deterministic, analytical bound, sidestepping the probabilistic certificates that traditionally result from the sampling subprocedure. Further, we obtain these certified bounds with no additional runtime cost over standard classification. We generalize our results to the multi-class case, providing what we believe to be the first multi-class classification algorithm that is certifiably robust to label-flipping attacks.

Connected through hyperedge HE-1 (induced by source paper "rab provable robustness against backdoor attacks"):
  with members:
    - "dynamic backdoor attacks against machine learning models"
    - "backdoor attacks against transfer learning with pre trained deep learning models"
    - "provable robust learning based on transformation specific smoothing"
    - "on certifying robustness against backdoor attacks via randomized smoothing"
    - "certified adversarial robustness via randomized smoothing"
    - "strip a defence against trojan attacks on deep neural networks"
    - "detecting backdoor attacks on deep neural networks by activation clustering"
    - "sentinet detecting physical attacks against deep learning systems"

Connected through hyperedge HE-2 (induced by source paper "de randomized smoothing for certifiable defense against patch attacks"):
  with members:
    - "curse of dimensionality on randomized smoothing for certifiable robustness"
    - "randomized smoothing of all shapes and sizes"
    - "random smoothing might be unable to certify ell_ infty robustness for high dimensional images"
    - "certified defenses for adversarial patches"
    - "tight certificates of adversarial robustness for randomly smoothed classifiers"
    - "robustness certificates for sparse adversarial attacks by randomized ablation"
    - "certified adversarial robustness via randomized smoothing"
    - "certifiably robust interpretation in deep learning"

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)