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: "purrs towards computer algebra support for fully automatic worst case complexity analysis"
  Abstract: Fully automatic worst-case complexity analysis has a number of applications in computer-assisted program manipulation. A classical and powerful approach to complexity analysis consists in formally deriving, from the program syntax, a set of constraints expressing bounds on the resources required by the program, which are then solved, possibly applying safe approximations. In several interesting cases, these constraints take the form of recurrence relations. While techniques for solving recurrences are known and implemented in several computer algebra systems, these do not completely fulfill the needs of fully automatic complexity analysis: they only deal with a somewhat restricted class of recurrence relations, or sometimes require user intervention, or they are restricted to the computation of exact solutions that are often so complex to be unmanageable, and thus useless in practice. In this paper we briefly describe PURRS, a system and software library aimed at providing all the computer algebra services needed by applications performing or exploiting the results of worst-case complexity analyses. The capabilities of the system are illustrated by means of examples derived from the analysis of programs written in a domain-specific functional programming language for real-time embedded systems.

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"
    - "on termination of integer linear loops"
    - "deciding conditional termination"
    - "abstract acceleration of general linear loops"
    - "abstracting path conditions"

Connected through hyperedge HE-2 (induced by source paper "inferring lower runtime bounds for integer programs"):
  with members:
    - "computing expected runtimes for constant probability programs"
    - "termination of triangular integer loops is decidable"
    - "proving non termination via loop acceleration"
    - "aiming low is harder inductive proof rules for lower bounds on weakest preexpectations in probabilistic program verification"
    - "towards automatic resource bound analysis for ocaml"
    - "abstract acceleration of general linear loops"
    - "ranking functions for linear constraint loops"
    - "abstracting path conditions"

Connected through hyperedge HE-3 (induced by source paper "proving non termination via loop acceleration"):
  with members:
    - "multiphase linear ranking functions and their relation to recurrent sets"
    - "geometric nontermination arguments"
    - "t2 temporal property verification"
    - "abstract acceleration of general linear loops"

Connected through hyperedge HE-4 (induced by source paper "automated recurrence analysis for almost linear expected runtime bounds"):
  with members:
    - "termination of nondeterministic recursive probabilistic programs"
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "reasoning about recursive probabilistic programs"
    - "a simple and scalable static analysis for bound analysis and amortized complexity analysis"

Connected through hyperedge HE-5 (induced by source paper "resource usage analysis of logic programs via abstract interpretation using sized types"):
  with members:
    - "more precise yet efficient type inference for logic programs"

Connected through hyperedge HE-6 (induced by source paper "towards an abstract domain for resource analysis of logic programs using sized types"):
  with members:
    - "more precise yet efficient type inference for logic programs"

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.MS(Mathematical Software)