human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "a quantifier elimination algorithm for linear real arithmetic":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "loop summarization with rational vector addition systems extended version")
  Member "the pitfalls of verifying floating point computations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "abstract compilation for verification of numerical accuracy properties")
  Member "automatic modular abstractions for linear constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compositional invariant generation via linear recurrence analysis")
  Member "relational abstract domains for the detection of floating point run time errors":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "exploiting verified neural networks via floating point numerical error")
  Member "accelerated data flow analysis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "transfer function synthesis without quantifier elimination")
  Member "the octagon abstract domain":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reludiff differential verification of deep neural networks")
  Member "symbolic methods to enhance the precision of numerical abstract domains":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "automatically proving microkernels free from privilege escalation from their executable")
  Member "a static analyzer for large safety critical software":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "automatically proving microkernels free from privilege escalation from their executable")

Question: Please tell me which class the source paper 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)