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 "towards stable and efficient training of verifiably robust neural networks"):
  Abstract: Training neural networks with verifiable robustness guarantees is challenging. Several existing approaches utilize linear relaxation based neural network output bounds under perturbation, but they can slow down training by a factor of hundreds depending on the underlying network architectures. Meanwhile, interval bound propagation (IBP) based training is efficient and significantly outperforms linear relaxation based methods on many tasks, yet it may suffer from stability issues since the bounds are much looser especially at the beginning of training. In this paper, we propose a new certified adversarial training method, CROWN-IBP, by combining the fast IBP bounds in a forward bounding pass and a tight linear relaxation based bound, CROWN, in a backward bounding pass. CROWN-IBP is computationally efficient and consistently outperforms IBP baselines on training verifiably robust neural networks. We conduct large scale experiments on MNIST and CIFAR datasets, and outperform all previous linear relaxation and bound propagation based certified defenses in $\ell_\infty$ robustness. Notably, we achieve 7.02% verified test error on MNIST at $\epsilon=0.3$, and 66.94% on CIFAR-10 with $\epsilon=8/255$. Code is available at this https URL (TensorFlow) and this https URL (PyTorch).

Includes members:
  Member "meshadv adversarial meshes for visual recognition":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "semanticadv generating adversarial examples via attribute conditional image editing")
  Member "certified adversarial robustness via randomized smoothing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "a provable defense for deep residual networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parot a practical framework for robust deep neural network training")
  Member "theoretically principled trade off between robustness and accuracy":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "provably robust deep learning via adversarially trained smoothed classifiers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "verification of non linear specifications for neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "robustness verification for transformers")
  Member "a convex relaxation barrier to tight robustness verification of neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "overfitting in adversarially robust deep learning")
  Member "scaling provable adversarial defenses":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "overfitting in adversarially robust deep learning")

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)