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: "function spaces for second order polynomial time"
  Abstract: In the context of second-order polynomial-time computability, we prove that there is no general function space construction. We proceed to identify restrictions on the domain or the codomain that do provide a function space with polynomial-time function evaluation containing all polynomial-time computable functions of that type. #R##N#As side results we show that a polynomial-time counterpart to admissibility of a representation is not a suitable criterion for natural representations, and that the Weihrauch degrees embed into the polynomial-time Weihrauch degrees.

Connected through hyperedge HE-1 (induced by source paper "quantitative continuity and computable analysis in coq"):
  with members:
    - "type two polynomial time and restricted lookahead"
    - "bounded time computation on metric spaces and banach spaces"
    - "representations and evaluation strategies for feasibly approximable functions"
    - "parametrised second order complexity theory with applications to the study of interval computation"
    - "comparing representations for function spaces in computable analysis"
    - "wave equation numerical resolution a comprehensive mechanized proof of a c program"
    - "complexity theory for operators in analysis"
    - "essential incompleteness of arithmetic verified by coq"

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

Connected through hyperedge HE-3 (induced by source paper "many one reductions and the category of multivalued functions"):
  with members:
    - "on the algebraic structure of weihrauch degrees"
    - "the degree structure of weihrauch reducibility"
    - "complexity theory for operators in analysis"
    - "computation with advice"
    - "on the complexity of local search for weighted standard set problems"
    - "on the semi lattices induced by continuous reducibilities"

Connected through hyperedge HE-4 (induced by source paper "bounded time computation on metric spaces and banach spaces"):
  with members:
    - "complexity theory for spaces of integrable functions"
    - "polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length journal version"
    - "complexity theory for operators in analysis"

Connected through hyperedge HE-5 (induced by source paper "complexity theory for spaces of integrable functions"):
  with members:
    - "complexity theory for operators in analysis"

Connected through hyperedge HE-6 (induced by source paper "on function spaces and polynomial time computability"):
  with members:
    - "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"

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)