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 "ranking templates for linear loops"):
  Abstract: We present a new method for the constraint-based synthesis of termination arguments for linear loop programs based on linear ranking templates. Linear ranking templates are parametrized, well-founded relations such that an assignment to the parameters gives rise to a ranking function. This approach generalizes existing methods and enables us to use templates for many different ranking functions with affine-linear components. We discuss templates for multiphase, piecewise, and lexicographic ranking functions. Because these ranking templates require both strict and non-strict inequalities, we use Motzkin’s Transposition Theorem instead of Farkas Lemma to transform the generated ∃ ∀-constraint into an ∃-constraint.

Includes members:
  Member "termination analysis by learning terminating programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "simulations in rank based b uchi automata complementation technical report")
  Member "ranking function synthesis for linear lasso programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ranking functions for linear constraint loops")
  Member "linear ranking for linear lasso programs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "proving liveness of parameterized programs")
  Member "eventual linear ranking functions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multiphase linear ranking functions and their relation to recurrent sets")
  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 "size change termination monotonicity constraints and ranking functions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a type based complexity analysis of object oriented 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)