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 "transfer function synthesis without quantifier elimination"):
  Abstract: Traditionally, transfer functions have been designed manually for each#N#operation in a program, instruction by instruction. In such a setting, a#N#transfer function describes the semantics of a single instruction, detailing#N#how a given abstract input state is mapped to an abstract output state. The net#N#effect of a sequence of instructions, a basic block, can then be calculated by#N#composing the transfer functions of the constituent instructions. However,#N#precision can be improved by applying a single transfer function that captures#N#the semantics of the block as a whole. Since blocks are program-dependent, this#N#approach necessitates automation. There has thus been growing interest in#N#computing transfer functions automatically, most notably using techniques based#N#on quantifier elimination. Although conceptually elegant, quantifier#N#elimination inevitably induces a computational bottleneck, which limits the#N#applicability of these methods to small blocks. This paper contributes a method#N#for calculating transfer functions that finesses quantifier elimination#N#altogether, and can thus be seen as a response to this problem. The#N#practicality of the method is demonstrated by generating transfer functions for#N#input and output states that are described by linear template constraints,#N#which include intervals and octagons.

Includes members:
  Member "automatic modular abstractions for template numerical constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "program analysis with local policy iteration")
  Member "automatic modular abstractions for linear constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "compositional invariant generation via linear recurrence analysis")
  Member "logic programming with satisfiability":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "boolean equi propagation for concise and efficient sat encodings of combinatorial problems")
  Member "accelerated data flow analysis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "improving strategies via smt solving")
  Member "the octagon abstract domain":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reludiff differential verification of deep neural networks")
  Member "a static analyzer for large safety critical software":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)