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: "automatic modular abstractions for template numerical constraints"
  Abstract: We propose a method for automatically generating abstract transformers for static analysis by abstract interpretation. The method focuses on linear constraints on programs operating on rational, real or floating-point variables and containing linear assignments and tests. In addition to loop-free code, the same method also applies for obtaining least fixed points as functions of the precondition, which permits the analysis of loops and recursive functions. Our algorithms are based on new quantifier elimination and symbolic manipulation techniques. Given the specification of an abstract domain, and a program block, our method automatically outputs an implementation of the corresponding abstract transformer. It is thus a form of program transformation. The motivation of our work is data-flow synchronous programming languages, used for building control-command embedded systems, but it also applies to imperative and functional programming.

Connected through hyperedge HE-1 (induced by source paper "program analysis with local policy iteration"):
  with members:
    - "invariant generation through strategy iteration in succinctly represented control flow graphs"
    - "pagai a path sensitive static analyzer"
    - "using bounded model checking to focus fixpoint iterations"
    - "cpachecker a tool for configurable software verification"
    - "the octagon abstract domain"

Connected through hyperedge HE-2 (induced by source paper "scaling up logico numerical strategy iteration extended version"):
  with members:
    - "invariant generation through strategy iteration in succinctly represented control flow graphs"
    - "optimization in smt with la q cost functions"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-3 (induced by source paper "invariant generation through strategy iteration in succinctly represented control flow graphs"):
  with members:
    - "succinct representations for abstract interpretation"
    - "optimization in smt with la q cost functions"
    - "numerical invariants through convex relaxation and max strategy iteration"
    - "using bounded model checking to focus fixpoint iterations"
    - "improving strategies via smt solving"
    - "the octagon abstract domain"
    - "symbolic methods to enhance the precision of numerical abstract domains"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-4 (induced by source paper "transfer function synthesis without quantifier elimination"):
  with members:
    - "automatic modular abstractions for linear constraints"
    - "logic programming with satisfiability"
    - "accelerated data flow analysis"
    - "the octagon abstract domain"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-5 (induced by source paper "stratified static analysis based on variable dependencies"):
  with members:
    - "a minimalistic look at widening operators"
    - "symbolic methods to enhance the precision of numerical abstract domains"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-6 (induced by source paper "using bounded model checking to focus fixpoint iterations"):
  with members:
    - "improving strategies via smt solving"
    - "automatic modular abstractions for linear constraints"
    - "symbolic methods to enhance the precision of numerical abstract domains"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-7 (induced by source paper "modular abstractions of reactive nodes using disjunctive invariants"):
  with members:
    - "improving strategies via smt solving"

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)