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: "polynomial invariants for affine programs"
  Abstract: We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-deterministic (as opposed to conditional) branching and all of whose assignments are given by affine expressions). Our main tool is an algebraic result of independent interest: given a finite set of rational square matrices of the same dimension, we show how to compute the Zariski closure of the semigroup that they generate.

Connected through hyperedge HE-1 (induced by source paper "tight polynomial worst case bounds for loop programs"):
  with members:
    - "interval based resource usage verification by translation into horn clauses and an application to energy consumption"
    - "on multiphase linear ranking functions"
    - "flowchart programs regular expressions and decidability of polynomial growth rate"
    - "ranking functions for linear constraint loops"
    - "on decidable growth rate properties of imperative programs"
    - "efficient algorithms for deciding the type of growth of products of integer matrices"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

Connected through hyperedge HE-2 (induced by source paper "synthesizing basic semialgebraic invariants by semidefinite programming"):
  with members:
    - "horn ice learning for synthesizing invariantsand contracts"
    - "abstraction of elementary hybrid systems by variable transformation"
    - "julia a fresh approach to numerical computing"
    - "generating non linear interpolants by semidefinite programming"
    - "predicate generation for learning based quantifier free loop invariant inference"

Connected through hyperedge HE-3 (induced by source paper "polynomial invariant generation for non deterministic recursive programs"):
  with members:
    - "bounded expectations resource analysis for probabilistic programs"
    - "automated generation of non linear loop invariants utilizing hypergeometric sequences"
    - "non polynomial worst case analysis of recursive programs"
    - "polynomial invariants by linear algebra"
    - "termination analysis of probabilistic programs through positivstellensatz s"

Connected through hyperedge HE-4 (induced by source paper "loop summarization with rational vector addition systems extended version"):
  with members:
    - "invariant generation for multi path loops with polynomial assignments"
    - "approaching the coverability problem continuously"
    - "integer vector addition systems with states"
    - "a simple and scalable static analysis for bound analysis and amortized complexity analysis"
    - "a quantifier elimination algorithm for linear real arithmetic"

Connected through hyperedge HE-5 (induced by source paper "on the monniaux problem in abstract interpretation"):
  with members:
    - "o minimal invariants for linear loops"
    - "on the decidability of the existence of polyhedral invariants in transition systems"
    - "semialgebraic invariant synthesis for the kannan lipton orbit problem"
    - "ultimate positivity is decidable for simple linear recurrence sequences"
    - "the octagon abstract domain"

Connected through hyperedge HE-6 (induced by source paper "on reachability problems for low dimensional matrix semigroups"):
  with members:
    - "on the identity problem for the special linear group and the heisenberg group"
    - "tighter undecidability bounds for matrix mortality zero in the corner problems and more"
    - "positivity problems for low order linear recurrence sequences"

Connected through hyperedge HE-7 (induced by source paper "lonely points in simplices"):
  with members:
    - "automated generation of non linear loop invariants utilizing hypergeometric sequences"
    - "factorization of c finite sequences"

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)