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: "parameterized uniform complexity in numerics from smooth to analytic from np hard to polytime"
  Abstract: The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are known to map (even high-order differentiable) polynomial-time computable functions to instances which are `hard' for classical complexity classes NP, #P, and CH; but, restricted to analytic functions, map polynomial-time computable ones to polynomial-time computable ones -- non-uniformly! #R##N#We investigate the uniform parameterized complexity of the above operators in the setting of Weihrauch's TTE and its second-order extension due to KawamuraC and within what running time, in terms of these parameters and the guaranteed output precision 2^(-n). #R##N#It turns out that Gevrey's hierarchy of functions climbing from analytic to smooth corresponds to the computational complexity of maximization growing from polytime to NP-hard. Proof techniques involve mainly the Theory of (discrete) Computation, Hard Analysis, and Information-Based Complexity.

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"
    - "lipschitz continuous ordinary differential equations are polynomial space complete"

Connected through hyperedge HE-2 (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"
    - "lipschitz continuous ordinary differential equations are polynomial space complete"

Connected through hyperedge HE-3 (induced by source paper "on function spaces and polynomial time computability"):
  with members:
    - "function spaces for second order polynomial time"
    - "the degree structure of weihrauch reducibility"
    - "complexity theory for operators in analysis"

Connected through hyperedge HE-4 (induced by source paper "computational complexity of smooth differential equations"):
  with members:
    - "complexity theory for operators in analysis"
    - "lipschitz continuous ordinary differential equations are polynomial space complete"

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.NA(Numerical Analysis)