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 by linear algebra"
  Abstract: We present in this paper a new technique for generating polynomial invariants, divided in two independent parts : a procedure that reduces polynomial assignments composed loops analysis to linear loops under certain hypotheses and a procedure for generating inductive invariants for linear loops. Both of these techniques have a polynomial complexity for a bounded number of variables and we guarantee the completeness of the technique for a bounded degree which we successfully implemented for C programs verification.

Connected through hyperedge HE-1 (induced by source paper "polynomial invariant generation for non deterministic recursive programs"):
  with members:
    - "polynomial invariants for affine programs"
    - "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"
    - "termination analysis of probabilistic programs through positivstellensatz s"

Connected through hyperedge HE-2 (induced by source paper "polynomial invariants for affine programs"):
  with members:
    - "invariant generation for multi path loops with polynomial assignments"
    - "o minimal invariants for linear loops"
    - "semialgebraic invariant synthesis for the kannan lipton orbit problem"

Connected through hyperedge HE-3 (induced by source paper "left eigenvectors are certificates of the orbit problem"):
  with members:
    - "semialgebraic invariant synthesis for the kannan lipton orbit problem"
    - "synthesizing invariants by solving solvable loops"

Connected through hyperedge HE-4 (induced by source paper "invariant generation for multi path loops with polynomial assignments"):
  with members:
    - "automated generation of non linear loop invariants utilizing hypergeometric sequences"
    - "summation theory ii characterizations of boldsymbol r pi sigma extensions and algorithmic aspects"

Connected through hyperedge HE-5 (induced by source paper "automated generation of non linear loop invariants utilizing hypergeometric sequences"):
  with members:
    - "summation theory ii characterizations of boldsymbol r pi sigma extensions and algorithmic aspects"

Connected through hyperedge HE-6 (induced by source paper "synthesizing invariants by solving solvable loops"):
  with members:
    - "using dynamic analysis to generate disjunctive invariants"
    - "abstract acceleration of general linear loops"
    - "coupling policy iteration with semi definite relaxation to compute accurate numerical invariants in static analysis"

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)