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 "a survey of satisfiability modulo theory"):
  Abstract: Satisfiability modulo theory (SMT) consists in testing the satisfiability of first-order formulas over linear integer or real arithmetic, or other theories. In this survey, we explain the combination of propositional satisfiability and decision procedures for conjunctions known as DPLL(T), and the alternative "natural domain" approaches. We also cover quantifiers, Craig interpolants, polynomial arithmetic, and how SMT solvers are used in automated software analysis.

Includes members:
  Member "proof tree preserving interpolation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient interpolation for the theory of arrays")
  Member "how to compute worst case execution time by optimization modulo theory and a clever encoding of program semantics":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "scalable and precise estimation and debugging of the worst case execution time for analysis friendly processors a comeback of model checking")
  Member "generating non linear interpolants by semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "synthesizing basic semialgebraic invariants by semidefinite programming")
  Member "invariant generation through strategy iteration in succinctly represented control flow graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "how hard is it to verify flat affine counter systems with the finite monoid property")
  Member "pagai a path sensitive static analyzer":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an observational investigation of reverse engineers processes")
  Member "succinct representations for abstract interpretation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficiently intertwining widening and narrowing")
  Member "optimization in smt with la q cost functions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "from minizinc to optimization modulo theories and back extended version")
  Member "on using floating point computations to help an exact linear arithmetic decision procedure":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "efficient generation of correctness certificates for the abstract domain of polyhedra")

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)