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 "inferring lower runtime bounds for integer programs"):
  Abstract: We present a technique to infer lower bounds on the worst-case runtime complexity of integer programs, where in contrast to earlier work, our approach is not restricted to tail-recursion. Our technique constructs symbolic representations of program executions using a framework for iterative, under-approximating program simplification. The core of this simplification is a method for (under-approximating) program acceleration based on recurrence solving and a variation of ranking functions. Afterwards, we deduce asymptotic lower bounds from the resulting simplified programs using a special-purpose calculus and an SMT encoding. We implemented our technique in our tool LoAT and show that it infers non-trivial lower bounds for a large class of examples.

Includes members:
  Member "computing expected runtimes for constant probability programs":
    also connected through other hyperedges:
      (none)
  Member "termination of triangular integer loops is decidable":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "computing expected runtimes for constant probability programs")
  Member "proving non termination via loop acceleration":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a calculus for modular loop acceleration")
  Member "aiming low is harder inductive proof rules for lower bounds on weakest preexpectations in probabilistic program verification":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tail bound analysis for probabilistic programs via central moments")
  Member "towards automatic resource bound analysis for ocaml":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "session types with arithmetic refinements and their application to work analysis")
  Member "abstract acceleration of general linear loops":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a calculus for modular loop acceleration")
  Member "ranking functions for linear constraint loops":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "tight polynomial worst case bounds for loop programs")
  Member "abstracting path conditions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a calculus for modular loop acceleration")

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)