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: "lipschitz continuous ordinary differential equations are polynomial space complete"
  Abstract: In answer to Ko's question raised in 1983, we show that an initial value problem given by a polynomial-time computable, Lipschitz continuous function can have a polynomial-space complete solution. The key insight is simple: the Lipschitz condition means that the feedback in the differential equation is weak. We define a class of polynomial-space computation tableaux with equally restricted feedback, and show that they are still polynomial-space complete. The same technique also settles Ko's two later questions on Volterra integral equations.

Connected through hyperedge HE-1 (induced by source paper "parametrised second order complexity theory with applications to the study of interval computation"):
  with members:
    - "bounded time computation on metric spaces and banach spaces"
    - "polynomial running times for polynomial time oracle machines"
    - "complexity theory for spaces of integrable functions"
    - "computational complexity of solving polynomial differential equations over unbounded domains"
    - "function spaces for second order polynomial time"
    - "on function spaces and polynomial time computability"
    - "complexity theory for operators in analysis"
    - "parameterized uniform complexity in numerics from smooth to analytic from np hard to polytime"

Connected through hyperedge HE-2 (induced by source paper "polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length"):
  with members:
    - "computational complexity of solving polynomial differential equations over unbounded domains"
    - "computational complexity of solving polynomial differential equations over unbounded domains with non rational coefficients"
    - "computing with polynomial ordinary differential equations"
    - "on the functions generated by the general purpose analog computer"
    - "on the complexity of solving initial value problems"
    - "probabilistic analysis of a differential equation for linear programming"

Connected through hyperedge HE-3 (induced by source paper "computational complexity of solving polynomial differential equations over unbounded domains"):
  with members:
    - "on the complexity of solving initial value problems"
    - "fast computation of power series solutions of systems of differential equations"

Connected through hyperedge HE-4 (induced by source paper "polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length journal version"):
  with members:
    - "probabilistic analysis of a differential equation for linear programming"

Connected through hyperedge HE-5 (induced by source paper "function spaces for second order polynomial time"):
  with members:
    - "on function spaces and polynomial time computability"
    - "computational complexity of smooth differential equations"
    - "towards synthetic descriptive set theory an instantiation with represented spaces"
    - "the degree structure of weihrauch reducibility"
    - "complexity theory for operators in analysis"
    - "parameterized uniform complexity in numerics from smooth to analytic from np hard to polytime"

Connected through hyperedge HE-6 (induced by source paper "revisiting the complexity of stability of continuous and hybrid systems"):
  with members:
    - "delta decidability over the reals"
    - "delta complete decision procedures for satisfiability over the reals"

Connected through hyperedge HE-7 (induced by source paper "computational complexity of smooth differential equations"):
  with members:
    - "complexity theory for operators in analysis"
    - "parameterized uniform complexity in numerics from smooth to analytic from np hard to polytime"

Connected through hyperedge HE-8 (induced by source paper "complexity theory for operators in analysis"):
  with members:
    - "computational complexity of smooth differential equations"
    - "zone diagrams in euclidean spaces and in other normed spaces"
    - "distance k sectors exist"
    - "on the complexity of real functions"

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)