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 "tight certificates of adversarial robustness for randomly smoothed classifiers"):
  Abstract: Strong theoretical guarantees of robustness can be given for ensembles of classifiers generated by input randomization. Specifically, an $\ell_2$ bounded adversary cannot alter the ensemble prediction generated by an additive isotropic Gaussian noise, where the radius for the adversary depends on both the variance of the distribution as well as the ensemble margin at the point of interest. We build on and considerably expand this work across broad classes of distributions. In particular, we offer adversarial robustness guarantees and associated algorithms for the discrete case where the adversary is $\ell_0$ bounded. Moreover, we exemplify how the guarantees can be tightened with specific assumptions about the function class of the classifier such as a decision tree. We empirically illustrate these results with and without functional restrictions across image and molecule datasets.

Includes members:
  Member "certified adversarial robustness via randomized smoothing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "certified robustness to adversarial word substitutions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robustness verification for transformers")
  Member "the logbarrier adversarial attack making effective use of decision boundary information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a principled approach for generating adversarial images under non smooth dissimilarity metrics")
  Member "towards robust locally linear deep networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "flexible and context specific ai explainability a multidisciplinary approach")
  Member "achieving verified robustness to symbol substitutions via interval bound propagation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "robustness verification for transformers")
  Member "scaling provable adversarial defenses":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "on the effectiveness of interval bound propagation for training verifiably robust models":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "a dual approach to scalable verification of deep networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "robustness verification for transformers")

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)