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 "tight polynomial worst case bounds for loop programs"):
  Abstract: In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language---representing non-deterministic imperative programs with bounded loops, and arithmetics limited to addition and multiplication - it is possible to decide precisely whether a program has certain growth-rate properties, in particular whether a computed value, or the program's running time, has a polynomial growth rate. #R##N#A natural and intriguing problem was to move from answering the decision problem to giving a quantitative result, namely, a tight polynomial upper bound. This paper shows how to obtain asymptotically-tight, multivariate, disjunctive polynomial bounds for this class of programs. This is a complete solution: whenever a polynomial bound exists it will be found. #R##N#A pleasant surprise is that the algorithm is quite simple; but it relies on some subtle reasoning. An important ingredient in the proof is the forest factorization theorem, a strong structural result on homomorphisms into a finite monoid.

Includes members:
  Member "polynomial invariants for affine programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "synthesizing basic semialgebraic invariants by semidefinite programming")
  Member "interval based resource usage verification by translation into horn clauses and an application to energy consumption":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards a general framework for static cost analysis of parallel logic programs")
  Member "on multiphase linear ranking functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the decidability of termination for polynomial loops")
  Member "flowchart programs regular expressions and decidability of polynomial growth rate":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "smarter features simpler learning")
  Member "ranking functions for linear constraint loops":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "inferring lower runtime bounds for integer programs")
  Member "on decidable growth rate properties of imperative programs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a generic imperative language for polynomial time")
  Member "efficient algorithms for deciding the type of growth of products of integer matrices":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on nonnegative integer matrices and short killing words")
  Member "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the deep learning compiler a comprehensive survey")

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)