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 "computing expected runtimes for constant probability programs"):
  Abstract: We introduce the class of constant probability (CP) programs and show that classical results from probability theory directly yield a simple decision procedure for (positive) almost sure termination of programs in this class. Moreover, asymptotically tight bounds on their expected runtime can always be computed easily. Based on this, we present an algorithm to infer the exact expected runtime of any CP program.

Includes members:
  Member "termination of triangular integer loops is decidable":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the decidability of termination for polynomial loops")
  Member "automated recurrence analysis for almost linear expected runtime bounds":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cost analysis of nondeterministic probabilistic programs")
  Member "bounded expectations resource analysis for probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exponential automatic amortized resource analysis")
  Member "a new proof rule for almost sure termination":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cost analysis of nondeterministic probabilistic programs")
  Member "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cost analysis of nondeterministic probabilistic programs")
  Member "weakest precondition reasoning for expected run times of probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "exponential automatic amortized resource analysis")
  Member "on the hardness of almost sure termination":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "aiming low is harder inductive proof rules for lower bounds on weakest preexpectations in probabilistic program verification")
  Member "on termination of integer linear loops":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)