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: "nonlinear pomdps for active state tracking with sensing costs"
  Abstract: Active state tracking is needed in object classification, target tracking, medical diagnosis and estimation of sparse signals among other various applications. Herein, active state tracking of a discrete-time, finite-state Markov chain is considered. Noisy Gaussian observations are dynamically collected by exerting appropriate control over their information content, while incurring a related sensing cost. The objective is to devise sensing strategies to optimize the trade-off between tracking performance and sensing cost. A recently proposed Kalman-like estimator \cite{ZoisTSP14} is employed for state tracking. The associated mean-squared error and a generic sensing cost metric are then used in a partially observable Markov decision process formulation, and the optimal sensing strategy is derived via a dynamic programming recursion. The resulting recursion proves to be non-linear, challenging control policy design. Properties of the related cost functions are derived and sufficient conditions are provided regarding the structure of the optimal control policy enabling characterization of when passive state tracking is optimal. To overcome the associated computational burden of the optimal sensing strategy, two lower complexity strategies are proposed, which exploit the aforementioned properties. The performance of the proposed strategies is illustrated in a wireless body sensing application, where cost savings as high as $60\%$ are demonstrated for a $4\%$ detection error with respect to a static equal allocation sensing strategy.

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.SY(Systems and Control)