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: "non deterministic computation and the jayne rogers theorem"
  Abstract: We provide a simple proof of a computable analogue to the Jayne Rogers Theorem from descriptive set theory. The difficulty of the proof is delegated to a simulation result pertaining to non-deterministic type-2 machines. Thus, we demonstrate that developments in computational models can have applications in fields thought to be far removed from it.

Connected through hyperedge HE-1 (induced by source paper "a comparison of concepts from computable analysis and effective descriptive set theory"):
  with members:
    - "towards synthetic descriptive set theory an instantiation with represented spaces"
    - "products of effective topological spaces and a uniformly computable tychonoff theorem"
    - "real hypercomputation and continuity"

Connected through hyperedge HE-2 (induced by source paper "a topological view on algebraic computation models"):
  with members:
    - "on the algebraic structure of weihrauch degrees"
    - "computability on the countable ordinals and the hausdorff kuratowski theorem"
    - "representations of analytic functions and weihrauch degrees"
    - "comparing representations for function spaces in computable analysis"
    - "weihrauch completeness for layerwise computability"
    - "the degree structure of weihrauch reducibility"
    - "real analytic machines and degrees"
    - "noncomputable functions in the blum shub smale model"

Connected through hyperedge HE-3 (induced by source paper "computability on the countable ordinals and the hausdorff kuratowski theorem"):
  with members:
    - "a topological view on algebraic computation models"
    - "on the algebraic structure of weihrauch degrees"
    - "infinite sequential games with real valued payoffs"
    - "the descriptive theory of represented spaces"
    - "weihrauch degrees of finding equilibria in sequential games"
    - "the degree structure of weihrauch reducibility"
    - "on the semi lattices induced by continuous reducibilities"
    - "real hypercomputation and continuity"

Connected through hyperedge HE-4 (induced by source paper "comparing representations for function spaces in computable analysis"):
  with members:
    - "representations of analytic functions and weihrauch degrees"
    - "weihrauch completeness for layerwise computability"
    - "towards synthetic descriptive set theory an instantiation with represented spaces"
    - "on the semi lattices induced by continuous reducibilities"
    - "infinite oracle queries in type 2 machines extended abstract"

Connected through hyperedge HE-5 (induced by source paper "weihrauch completeness for layerwise computability"):
  with members:
    - "on the algebraic structure of weihrauch degrees"
    - "the degree structure of weihrauch reducibility"
    - "on the semi lattices induced by continuous reducibilities"
    - "infinite oracle queries in type 2 machines extended abstract"
    - "computability of probability measures and martin lof randomness over metric spaces"

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.LO(Logic in Computer Science)