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: "a new numerical abstract domain based on difference bound matrices"
  Abstract: This paper presents a new numerical abstract domain for static analysis by abstract interpretation. This domain allows us to represent invariants of the form (x-y<=c) and (+/-x<=c), where x and y are variables values and c is an integer or real constant. Abstract elements are represented by Difference-Bound Matrices, widely used by model-checkers, but we had to design new operators to meet the needs of abstract interpretation. The result is a complete lattice of infinite height featuring widening, narrowing and common transfer functions. We focus on giving an efficient O(n2) representation and graph-based O(n3) algorithms - where n is the number of variables|and claim that this domain always performs more precisely than the well-known interval domain. To illustrate the precision/cost tradeoff of this domain, we have implemented simple abstract interpreters for toy imperative and parallel languages which allowed us to prove some non-trivial algorithms correct.

Connected through hyperedge HE-1 (induced by source paper "a hypergraph based approach for the 4 constraint satisfaction problem tractability"):
  with members:
    - "language emptiness of continuous time parametric timed automata"
    - "schaefer s theorem for graphs"
    - "the octagon abstract domain"
    - "a static analyzer for large safety critical software"
    - "the essence of constraint propagation"

Connected through hyperedge HE-2 (induced by source paper "deterministic parallel fixpoint computation"):
  with members:
    - "abstract interpretation with higher dimensional ellipsoids and conic extrapolation"
    - "efficiently intertwining widening and narrowing"
    - "relational abstract domains for the detection of floating point run time errors"
    - "the octagon abstract domain"
    - "the parallel implementation of the astree static analyzer"

Connected through hyperedge HE-3 (induced by source paper "runtime monitoring neuron activation patterns"):
  with members:
    - "feature squeezing detecting adversarial examples in deep neural networks"
    - "reluplex an efficient smt solver for verifying deep neural networks"
    - "on the statistical detection of adversarial examples"
    - "visualizing and understanding convolutional networks"
    - "deep inside convolutional networks visualising image classification models and saliency maps"

Connected through hyperedge HE-4 (induced by source paper "separation logic with linearly compositional inductive predicates and set data constraints"):
  with members:
    - "on automated lemma generation for separation logic with inductive definitions"
    - "ptime computation of transitive closures of octagonal relations"

Connected through hyperedge HE-5 (induced by source paper "numerical invariants through convex relaxation and max strategy iteration"):
  with members:
    - "coupling policy iteration with semi definite relaxation to compute accurate numerical invariants in static analysis"
    - "exponential lower bounds for policy iteration"
    - "using ellipsoidal domains to analyze control systems software"
    - "the octagon abstract domain"

Connected through hyperedge HE-6 (induced by source paper "improving strategies via smt solving"):
  with members:
    - "coupling policy iteration with semi definite relaxation to compute accurate numerical invariants in static analysis"
    - "a quantifier elimination algorithm for linear real arithmetic"
    - "automatic modular abstractions for linear constraints"
    - "accelerated data flow analysis"
    - "the octagon abstract domain"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-7 (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"
    - "perturbed affine arithmetic for invariant computation in numerical program analysis"

Connected through hyperedge HE-8 (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"
    - "perturbed affine arithmetic for invariant computation in numerical program analysis"
    - "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.PL(Programming Languages)