human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length"):
  Abstract: We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $\operatorname{PTIME}$ of languages computable in polynomial time in terms of differential equations with polynomial right-hand side. #R##N#This result gives a purely continuous (time and space) elegant and simple characterization of $\operatorname{PTIME}$. This is the first time such classes are characterized using only ordinary differential equations. Our characterization extends to functions computable in polynomial time over the reals in the sense of computable analysis. This extends to deterministic complexity classes above polynomial time. #R##N#This may provide a new perspective on classical complexity, by giving a way to define complexity classes, like $\operatorname{PTIME}$, in a very simple way, without any reference to a notion of (discrete) machine. This may also provide ways to state classical questions about computational complexity via ordinary differential equations, i.e.~by using the framework of analysis.

Includes members:
  Member "computational complexity of solving polynomial differential equations over unbounded domains":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parametrised second order complexity theory with applications to the study of interval computation")
  Member "computational complexity of solving polynomial differential equations over unbounded domains with non rational coefficients":
    also connected through other hyperedges:
      (none)
  Member "computing with polynomial ordinary differential equations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the functions generated by the general purpose analog computer")
  Member "on the functions generated by the general purpose analog computer":
    also connected through other hyperedges:
      (none)
  Member "on the complexity of solving initial value problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computational complexity of solving polynomial differential equations over unbounded domains")
  Member "lipschitz continuous ordinary differential equations are polynomial space complete":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parametrised second order complexity theory with applications to the study of interval computation")
  Member "probabilistic analysis of a differential equation for linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on analog models of computation")

Question: Please tell me which class the source paper 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)