human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "linear ranking for linear lasso programs"
  Abstract: The general setting of this work is the constraint-based synthesis of termination arguments. We consider a restricted class of programs called lasso programs. The termination argument for a lasso program is a pair of a ranking function and an invariant. We present the---to the best of our knowledge---first method to synthesize termination arguments for lasso programs that uses linear arithmetic. We prove a completeness theorem. The completeness theorem establishes that, even though we use only linear (as opposed to non-linear) constraint solving, we are able to compute termination arguments in several interesting cases. The key to our method lies in a constraint transformation that replaces a disjunction by a sum.

Connected through hyperedge HE-1 (induced by source paper "proving liveness of parameterized programs"):
  with members:
    - "model checking parameterized asynchronous shared memory systems"
    - "termination analysis by learning terminating programs"

Connected through hyperedge HE-2 (induced by source paper "ranking templates for linear loops"):
  with members:
    - "termination analysis by learning terminating programs"
    - "ranking function synthesis for linear lasso programs"
    - "eventual linear ranking functions"
    - "ranking functions for linear constraint loops"
    - "size change termination monotonicity constraints and ranking functions"

Connected through hyperedge HE-3 (induced by source paper "termination analysis by learning terminating programs"):
  with members:
    - "ranking templates for linear loops"
    - "state of buchi complementation"
    - "proving termination starting from the end"
    - "buchi complementation and size change termination"
    - "size change termination monotonicity constraints and ranking functions"

Connected through hyperedge HE-4 (induced by source paper "unrestricted termination and non termination arguments for bit vector programs"):
  with members:
    - "ranking templates for linear loops"
    - "second order propositional satisfiability"
    - "ranking functions for linear constraint loops"
    - "size change termination monotonicity constraints and ranking functions"
    - "a general framework for automatic termination analysis of logic programs"

Connected through hyperedge HE-5 (induced by source paper "the hardness of finding linear ranking functions for lasso programs"):
  with members:
    - "deciding conditional termination"
    - "positivity problems for low order linear recurrence sequences"
    - "ranking functions for linear constraint loops"

Connected through hyperedge HE-6 (induced by source paper "ranking functions for linear constraint loops"):
  with members:
    - "ranking function synthesis for linear lasso programs"
    - "deciding conditional termination"
    - "proving termination starting from the end"
    - "eventual linear ranking functions"
    - "monotonicity constraints for termination in the integer domain"
    - "an improved tight closure algorithm for integer octagonal constraints"
    - "the octagon abstract domain"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

Question: Please tell me which class the center node 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)