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: "abstract acceleration of general linear loops"
  Abstract: We present abstract acceleration techniques for computing loop invariants for numerical programs with linear assignments and conditionals. Whereas abstract interpretation techniques typically over-approximate the set of reachable states iteratively, abstract acceleration captures the effect of the loop with a single, non-iterative transfer function applied to the initial states at the loop head. In contrast to previous acceleration techniques, our approach applies to any linear loop without restrictions. Its novelty lies in the use of the Jordan normal form decomposition of the loop body to derive symbolic expressions for the entries of the matrix modeling the effect of n>=0 iterations of the loop. The entries of such a matrix depend on $n$ through complex polynomial, exponential and trigonometric functions. Therefore, we introduces an abstract domain for matrices that captures the linear inequality relations between these complex expressions. This results in an abstract matrix for describing the fixpoint semantics of the loop. #R##N#Our approach integrates smoothly into standard abstract interpreters and can handle programs with nested loops and loops containing conditional branches. We evaluate it over small but complex loops that are commonly found in control software, comparing it with other tools for computing linear loop invariants. The loops in our benchmarks typically exhibit polynomial, exponential and oscillatory behaviors that present challenges to existing approaches. Our approach finds non-trivial invariants to prove useful bounds on the values of variables for such loops, clearly outperforming the existing approaches in terms of precision while exhibiting good performance.

Connected through hyperedge HE-1 (induced by source paper "a calculus for modular loop acceleration"):
  with members:
    - "on the decidability of termination for polynomial loops"
    - "proving non termination via loop acceleration"
    - "inferring lower runtime bounds for integer programs"
    - "underapproximation of procedure summaries for integer programs"
    - "on termination of integer linear loops"
    - "deciding conditional termination"
    - "abstracting path conditions"
    - "purrs towards computer algebra support for fully automatic worst case complexity analysis"

Connected through hyperedge HE-2 (induced by source paper "inferring lower runtime bounds for integer programs"):
  with members:
    - "computing expected runtimes for constant probability programs"
    - "termination of triangular integer loops is decidable"
    - "proving non termination via loop acceleration"
    - "aiming low is harder inductive proof rules for lower bounds on weakest preexpectations in probabilistic program verification"
    - "towards automatic resource bound analysis for ocaml"
    - "ranking functions for linear constraint loops"
    - "abstracting path conditions"
    - "purrs towards computer algebra support for fully automatic worst case complexity analysis"

Connected through hyperedge HE-3 (induced by source paper "complexity and information in invariant inference"):
  with members:
    - "horn ice learning for synthesizing invariantsand contracts"
    - "learning disjunctions of predicates"
    - "interactive program synthesis"
    - "abstract learning frameworks for synthesis"
    - "a theory of formal synthesis via inductive learning"
    - "ic3 modulo theories via implicit predicate abstraction"
    - "tight bounds on proper equivalence query learning of dnf"
    - "interpolant based transition relation approximation"

Connected through hyperedge HE-4 (induced by source paper "termination of linear loops over the integers"):
  with members:
    - "multiphase linear ranking functions and their relation to recurrent sets"
    - "effective divergence analysis for linear recurrence sequences"
    - "on multiphase linear ranking functions"
    - "on termination of integer linear loops"
    - "positivity problems for low order linear recurrence sequences"
    - "ranking functions for linear constraint loops"

Connected through hyperedge HE-5 (induced by source paper "proving non termination via loop acceleration"):
  with members:
    - "multiphase linear ranking functions and their relation to recurrent sets"
    - "geometric nontermination arguments"
    - "t2 temporal property verification"
    - "purrs towards computer algebra support for fully automatic worst case complexity analysis"

Connected through hyperedge HE-6 (induced by source paper "verifying array manipulating programs by tiling"):
  with members:
    - "scaling bounded model checking by transforming programs with arrays"
    - "a simple abstraction of arrays and maps by program translation"
    - "smt based model checking for recursive programs"

Connected through hyperedge HE-7 (induced by source paper "synthesizing invariants by solving solvable loops"):
  with members:
    - "polynomial invariants by linear algebra"
    - "using dynamic analysis to generate disjunctive invariants"
    - "coupling policy iteration with semi definite relaxation to compute accurate numerical invariants in static analysis"

Connected through hyperedge HE-8 (induced by source paper "compositional invariant generation via linear recurrence analysis"):
  with members:
    - "an algebraic framework for compositional program analysis"
    - "automatic modular abstractions for linear constraints"
    - "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)