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: "perturbed affine arithmetic for invariant computation in numerical program analysis"
  Abstract: We completely describe a new domain for abstract interpretation of numerical programs. Fixpoint iteration in this domain is proved to converge to finite precise invariants for (at least) the class of stable linear recursive filters of any order. Good evidence shows it behaves well also for some non-linear schemes. The result, and the structure of the domain, rely on an interesting interplay between order and topology.

Connected through hyperedge HE-1 (induced by source paper "a provable defense for deep residual networks"):
  with members:
    - "scaling provable adversarial defenses"
    - "on the geometry of adversarial examples"
    - "on the effectiveness of interval bound propagation for training verifiably robust models"
    - "training verified learners with learned verifiers"
    - "mixtrain scalable training of formally robust neural networks"
    - "adversarially robust generalization requires more data"
    - "generating adversarial examples with adversarial networks"
    - "certified defenses against adversarial examples"

Connected through hyperedge HE-2 (induced by source paper "robustness analysis of finite precision implementations"):
  with members:
    - "a non local method for robustness analysis of floating point programs"
    - "a theory of robust software synthesis"
    - "a logical product approach to zonotope intersection"
    - "a zonotopic framework for functional abstractions"

Connected through hyperedge HE-3 (induced by source paper "a logical product approach to zonotope intersection"):
  with members:
    - "coupling policy iteration with semi definite relaxation to compute accurate numerical invariants in static analysis"
    - "a zonotopic framework for functional abstractions"
    - "a new numerical abstract domain based on difference bound matrices"

Connected through hyperedge HE-4 (induced by source paper "a zonotopic framework for functional abstractions"):
  with members:
    - "robustness analysis of finite precision implementations"
    - "coupling policy iteration with semi definite relaxation to compute accurate numerical invariants in static analysis"
    - "a logical product approach to zonotope intersection"
    - "a new numerical abstract domain based on difference bound matrices"
    - "symbolic methods to enhance the precision of numerical abstract domains"

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.LO(Logic in Computer Science)