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: "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"
  Abstract: Since its inception as a student project in 2001, initially just for the handling (as the name implies) of convex polyhedra, the Parma Polyhedra Library has been continuously improved and extended by joining scrupulous research on the theoretical foundations of (possibly non-convex) numerical abstractions to a total adherence to the best available practices in software development. Even though it is still not fully mature and functionally complete, the Parma Polyhedra Library already offers a combination of functionality, reliability, usability and performance that is not matched by similar, freely available libraries. In this paper, we present the main features of the current version of the library, emphasizing those that distinguish it from other similar libraries and those that are important for applications in the field of analysis and verification of hardware and software systems.

Connected through hyperedge HE-1 (induced by source paper "the deep learning compiler a comprehensive survey"):
  with members:
    - "shredder learning noise distributions to protect inference privacy"
    - "fusionstitching boosting execution efficiency of memory intensive computations for dl workloads"
    - "stripe tensor compilation via the nested polyhedral model"
    - "tensorflow eager a multi stage python embedded dsl for machine learning"
    - "privacy for rescue a new testimony why privacy is vulnerable in deep models"
    - "dissecting the graphcore ipu architecture via microbenchmarking"
    - "benchmarking tpu gpu and cpu platforms for deep learning"
    - "a comprehensive survey on graph neural networks"

Connected through hyperedge HE-2 (induced by source paper "automated synthesis of local time requirement for service composition"):
  with members:
    - "abstraction refinement algorithms for timed automata"
    - "revisiting reachability in timed automata"
    - "better abstractions for timed automata"

Connected through hyperedge HE-3 (induced by source paper "a novel approach to multivariate redundancy and synergy"):
  with members:
    - "understanding individual neuron importance using information theory"
    - "unique information and secret key agreement"
    - "comparison of channels criteria for domination by a symmetric channel"
    - "pointwise partial information decomposition using the specificity and ambiguity lattices"
    - "secret sharing and shared information"
    - "measuring multivariate redundant information with pointwise common change in surprisal"
    - "quantifying synergistic information using intermediate stochastic variables"
    - "on the input degradedness and input equivalence between channels"

Connected through hyperedge HE-4 (induced by source paper "what s decidable about parametric timed automata"):
  with members:
    - "language preservation problems in parametric timed automata"
    - "polynomial interrupt timed automata"
    - "language emptiness of continuous time parametric timed automata"
    - "interrupt timed automata with auxiliary clocks and parameters"
    - "mtl model checking of one clock parametric timed automata is undecidable"
    - "interrupt timed automata verification and expressiveness"
    - "on the decidability and complexity of metric temporal logic over finite words"
    - "real time model checking parameters everywhere"

Connected through hyperedge HE-5 (induced by source paper "tight polynomial worst case bounds for loop programs"):
  with members:
    - "polynomial invariants for affine programs"
    - "interval based resource usage verification by translation into horn clauses and an application to energy consumption"
    - "on multiphase linear ranking functions"
    - "flowchart programs regular expressions and decidability of polynomial growth rate"
    - "ranking functions for linear constraint loops"
    - "on decidable growth rate properties of imperative programs"
    - "efficient algorithms for deciding the type of growth of products of integer matrices"

Connected through hyperedge HE-6 (induced by source paper "parametric verification an introduction"):
  with members:
    - "what s decidable about parametric timed automata"
    - "minimal time synthesis for parametric timed automata"
    - "offline timed pattern matching under uncertainty"
    - "language preservation problems in parametric timed automata"
    - "goal driven unfolding of petri nets"
    - "language emptiness of continuous time parametric timed automata"
    - "on selective unboundedness of vass"

Connected through hyperedge HE-7 (induced by source paper "online parametric timed pattern matching with automata based skipping"):
  with members:
    - "offline timed pattern matching under uncertainty"
    - "monaa a tool for timed pattern matching with automata based acceleration"
    - "efficient online timed pattern matching by automata based skipping"
    - "montre a tool for monitoring timed regular expressions"
    - "a boyer moore type algorithm for timed pattern matching"

Connected through hyperedge HE-8 (induced by source paper "control flow refinement by partial evaluation and its application to termination and cost analysis"):
  with members:
    - "polyvariant program specialisation with property based abstraction"
    - "an iterative approach to precondition inference using constrained horn clauses"
    - "on multiphase linear ranking functions"
    - "t2 temporal property verification"
    - "ranking functions for linear constraint loops"

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.MS(Mathematical Software)