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 calculus for modular loop acceleration"):
  Abstract: Loop acceleration can be used to prove safety, reachability, runtime bounds, and (non-)termination for programs operating on integers. To this end, a variety of acceleration techniques has been proposed. However, all of them are monolithic: Either they accelerate a loop successfully or they fail completely. In contrast, we present a calculus that allows for combining acceleration techniques in a modular way and we show how to integrate many existing acceleration techniques into our calculus. Moreover, we propose two novel acceleration techniques that can be incorporated into our calculus seamlessly. An empirical evaluation demonstrates the applicability of our approach.

Includes members:
  Member "on the decidability of termination for polynomial loops":
    also connected through other hyperedges:
      (none)
  Member "proving non termination via loop acceleration":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the decidability of termination for polynomial loops")
  Member "inferring lower runtime bounds for integer programs":
    also connected through other hyperedges:
      (none)
  Member "underapproximation of procedure summaries for integer programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tree dimension in verification of constrained horn clauses")
  Member "on termination of integer linear loops":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computing expected runtimes for constant probability programs")
  Member "deciding conditional termination":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the decidability of termination for polynomial loops")
  Member "abstract acceleration of general linear loops":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "inferring lower runtime bounds for integer programs")
  Member "abstracting path conditions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "inferring lower runtime bounds for integer programs")

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)