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: "on termination of integer linear loops"
  Abstract: A fundamental problem in program verification concerns the termination of simple linear loops of the form x := u ; while Bx >= b do {x := Ax + a} where x is a vector of variables, u, a, and c are integer vectors, and A and B are integer matrices. Assuming the matrix A is diagonalisable, we give a decision procedure for the problem of whether, for all initial integer vectors u, such a loop terminates. The correctness of our algorithm relies on sophisticated tools from algebraic and analytic number theory, Diophantine geometry, and real algebraic geometry. To the best of our knowledge, this is the first substantial advance on a 10-year-old open problem of Tiwari (2004) and Braverman (2006).

Connected through hyperedge HE-1 (induced by source paper "a calculus for modular loop acceleration"):
  with members:
    - "on the decidability of termination for polynomial loops"
    - "proving non termination via loop acceleration"
    - "inferring lower runtime bounds for integer programs"
    - "underapproximation of procedure summaries for integer programs"
    - "deciding conditional termination"
    - "abstract acceleration of general linear loops"
    - "abstracting path conditions"
    - "purrs towards computer algebra support for fully automatic worst case complexity analysis"

Connected through hyperedge HE-2 (induced by source paper "computing expected runtimes for constant probability programs"):
  with members:
    - "termination of triangular integer loops is decidable"
    - "automated recurrence analysis for almost linear expected runtime bounds"
    - "bounded expectations resource analysis for probabilistic programs"
    - "a new proof rule for almost sure termination"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "on the hardness of almost sure termination"
    - "minimizing expected termination time in one counter markov decision processes"

Connected through hyperedge HE-3 (induced by source paper "on the decidability of termination for polynomial loops"):
  with members:
    - "termination of triangular integer loops is decidable"
    - "proving non termination via loop acceleration"
    - "termination of linear loops over the integers"
    - "on multiphase linear ranking functions"
    - "geometric nontermination arguments"
    - "ranking templates for linear loops"
    - "mixed integer quadratic programming is in np"
    - "deciding conditional termination"

Connected through hyperedge HE-4 (induced by source paper "on the mortality problem from multiplicative matrix equations to linear recurrence sequences and beyond"):
  with members:
    - "on the identity problem for the special linear group and the heisenberg group"
    - "solvability of matrix exponential equations"
    - "on the skolem problem for continuous linear dynamical systems"
    - "tighter undecidability bounds for matrix mortality zero in the corner problems and more"
    - "on the positivity problem for simple linear recurrence sequences"
    - "on the complexity of the orbit problem"
    - "positivity problems for low order linear recurrence sequences"

Connected through hyperedge HE-5 (induced by source paper "termination of linear loops over the integers"):
  with members:
    - "multiphase linear ranking functions and their relation to recurrent sets"
    - "effective divergence analysis for linear recurrence sequences"
    - "on multiphase linear ranking functions"
    - "abstract acceleration of general linear loops"
    - "positivity problems for low order linear recurrence sequences"
    - "ranking functions for linear constraint loops"

Connected through hyperedge HE-6 (induced by source paper "decidability of the mortality problem from multiplicative matrix equations to linear recurrence sequences and beyond"):
  with members:
    - "on the identity problem for the special linear group and the heisenberg group"
    - "solvability of matrix exponential equations"

Connected through hyperedge HE-7 (induced by source paper "termination of triangular integer loops is decidable"):
  with members:
    - "t2 temporal property verification"
    - "deciding conditional termination"

Connected through hyperedge HE-8 (induced by source paper "o minimal invariants for linear loops"):
  with members:
    - "on the complexity of the orbit problem"

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.CC(Computational Complexity)