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 "achieving verified robustness to symbol substitutions via interval bound propagation"):
  Abstract: Neural networks are part of many contemporary NLP systems, yet their empirical successes come at the price of vulnerability to adversarial attacks. Previous work has used adversarial training and data augmentation to partially mitigate such brittleness, but these are unlikely to find worst-case adversaries due to the complexity of the search space arising from discrete text perturbations. In this work, we approach the problem from the opposite direction: to formally verify a system's robustness against a predefined class of adversarial attacks. We study text classification under synonym replacements or character flip perturbations. We propose modeling these input perturbations as a simplex and then using Interval Bound Propagation -- a formal model verification method. We modify the conventional log-likelihood training objective to train models that can be efficiently verified, which would otherwise come with exponential search complexity. The resulting models show only little difference in terms of nominal accuracy, but have much improved verified accuracy under perturbations and come with an efficiently computable formal guarantee on worst case adversaries.

Includes members:
  Member "knowing when to stop evaluation and verification of conformity to output size specifications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adversarial machine learning perspectives from adversarial risk analysis")
  Member "formal security analysis of neural networks using symbolic intervals":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robustness verification for transformers")
  Member "adversarial example generation with syntactically controlled paraphrase networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "stress test evaluation of transformer based models in natural language understanding tasks")
  Member "breaking nli systems with sentences that require simple lexical inferences":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "stance detection benchmark how robust is your stance detection")
  Member "training verified learners with learned verifiers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "black box smoothing a provable defense for pretrained classifiers")
  Member "seq2sick evaluating the robustness of sequence to sequence models with adversarial examples":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "robustness verification for transformers")
  Member "deep contextualized word representations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multi simlex a large scale evaluation of multilingual and cross lingual lexical semantic similarity")
  Member "certified defenses against adversarial examples":
    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.CL(Computation and Language)