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: "symbolic methods to enhance the precision of numerical abstract domains"
  Abstract: We present lightweight and generic symbolic methods to improve the precison of numerical static analyses based on Abstract Interpretation. The main idea is to simplify numerical expressions before they are fed to abstract transfer functions. An important novelty is that these simplifications are performed on-the-fly, using information gathered dynamically by the analyzer. A first method, called "linearization," allows abstracting arbitrary expressions into affine forms with interval coefficients while simplifying them. A second method, called "symbolic constant propagation," enhances the simplification feature of the linearization by propagating assigned expressions in a symbolic way. Combined together, these methods increase the relationality level of numerical abstract domains and make them more robust against program transformations. We show how they can be integrated within the classical interval, octagon and polyhedron domains. These methods have been incorporated within the Astr\'{e}e static analyzer that checks for the absence of run-time errors in embedded critical avionics software. We present an experimental proof of their usefulness.

Connected through hyperedge HE-1 (induced by source paper "automatically proving microkernels free from privilege escalation from their executable"):
  with members:
    - "get rid of inline assembly through verification oriented lifting"
    - "structural analysis shape information via points to computation"
    - "field sensitive value analysis of embedded c programs with union types and pointer arithmetics"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-2 (induced by source paper "perfectly parallel fairness certification of neural networks"):
  with members:
    - "probabilistic verification of fairness properties via concentration"
    - "a provable defense for deep residual networks"
    - "a survey on bias and fairness in machine learning"
    - "analyzing deep neural networks with symbolic propagation towards higher precision and faster verification"
    - "the efficacy of shield under different threat models"
    - "deepsearch simple and effective blackbox fuzzing of deep neural networks"
    - "formal security analysis of neural networks using symbolic intervals"
    - "symbolic execution for deep neural networks"

Connected through hyperedge HE-3 (induced by source paper "hypercollecting semantics and its application to static analysis of information flow"):
  with members:
    - "a temporal logic for hyperproperties"
    - "abstract interpretation based approaches to security a survey on abstract non interference and its challenging applications"
    - "a survey on product operators in abstract interpretation"
    - "on bounding problems of quantitative information flow"
    - "the octagon abstract domain"

Connected through hyperedge HE-4 (induced by source paper "abstract interpretation using a language of symbolic approximation"):
  with members:
    - "modular construction of shape numeric analyzers"
    - "field sensitive value analysis of embedded c programs with union types and pointer arithmetics"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-5 (induced by source paper "compositional invariant generation via linear recurrence analysis"):
  with members:
    - "abstract acceleration of general linear loops"
    - "an algebraic framework for compositional program analysis"
    - "automatic modular abstractions for linear constraints"

Connected through hyperedge HE-6 (induced by source paper "on computable abstractions a conceptual introduction"):
  with members:
    - "natural language processing almost from scratch"

Connected through hyperedge HE-7 (induced by source paper "efficient generation of correctness certificates for the abstract domain of polyhedra"):
  with members:
    - "pagai a path sensitive static analyzer"
    - "on using floating point computations to help an exact linear arithmetic decision procedure"
    - "a minimalistic look at widening operators"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"
    - "computing convex hulls with a linear solver"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-8 (induced by source paper "abstract acceleration of general linear loops"):
  with members:
    - "automatic modular abstractions for linear constraints"
    - "the octagon abstract domain"
    - "a static analyzer for large safety critical software"

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)