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 "geometric nontermination arguments"):
  Abstract: We present a new kind of nontermination argument, called geometric nontermination argument. The geometric nontermination argument is a finite representation of an infinite execution that has the form of a sum of several geometric series. For so-called linear lasso programs we can decide the existence of a geometric nontermination argument using a nonlinear algebraic $\exists$-constraint. We show that a deterministic conjunctive loop program with nonnegative eigenvalues is nonterminating if an only if there exists a geometric nontermination argument. Furthermore, we present an evaluation that demonstrates that our method is feasible in practice.

Includes members:
  Member "t2 temporal property verification":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "control flow refinement by partial evaluation and its application to termination and cost analysis")
  Member "extracting verified decision procedures dpll and resolution":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "up to techniques for branching bisimilarity")
  Member "ranking templates for linear loops":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the decidability of termination for polynomial loops")
  Member "termination analysis by learning terminating programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "simulations in rank based b uchi automata complementation technical report")
  Member "on termination of integer linear loops":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a calculus for modular loop acceleration")
  Member "unrestricted termination and non termination arguments for bit vector programs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "using program synthesis for program analysis")
  Member "ranking functions for linear constraint loops":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)