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: "a mathematical theory of co design"
  Abstract: This paper describes a mathematical theory of "co-design", in which the objects of investigation are "design problems", defined as tuples of "functionality space", "implementation space", and "resources space", together with a feasibility relation. "Monotone" design problems are those for which functionality and resources are partially ordered and related by an order-preserving map. This condition is essentially the core of engineering: increasing the functionality does not decrease the resources needed. Specific examples are given for the domain of Robotics. Everything generalizes to everything else in engineering. #R##N#Monotone Co-Design Problems (MCDPs) are defined as the composition of monotone design problems by three operations, equivalent to the concepts of series, parallel, and feedback. Monotonicity is preserved by these operations. Furthermore, the invariance group for these properties are all order isomorphisms, thus this is a completely intrinsic theory. #R##N#As a class of optimization problems, MCDPs are multi-objective, nonconvex, nondifferentiable, noncontinuous, and not even defined on continuous spaces. Yet there exists a complete solution: if there exists a procedure to solve the primitive design problems, then there exists a systematic procedure to solve the larger MCDP. The solution of an MCDP can be cast as the problem of finding the least fixed point of a certain map on the set of resources antichains, a concept similar to Pareto fronts. The solution can be obtained by the iterative application of a map. In particular, no differential operators are needed. The iteration always converges: if it converges to finite values, that is guaranteed to be the set of minimal resources. If it converges to infinity (in a sense to be specified), then the sequence is a certificate of infeasibility.

Connected through hyperedge HE-1 (induced by source paper "robot co design beyond the monotone case"):
  with members:
    - "scalable co optimization of morphology and control in embodied machines"

Connected through hyperedge HE-2 (induced by source paper "sensor synthesis for pomdps with reachability objectives"):
  with members:
    - "a symbolic sat based algorithm for almost sure reachability with small strategies in pomdps"
    - "qualitative analysis of pomdps with temporal logic specifications for robotics applications"
    - "a theory of goal oriented mdps with dead ends"
    - "heuristic search value iteration for pomdps"
    - "qualitative analysis of partially observable markov decision processes"
    - "algorithms for omega regular games with imperfect information"
    - "reinforcement learning a survey"

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)