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: "scheduling nonlinear sensors for stochastic process estimation"
  Abstract: In this paper, we focus on activating only a few sensors, among many available, to estimate the state of a stochastic process of interest. This problem is important in applications such as target tracking and simultaneous localization and mapping (SLAM). It is challenging since it involves stochastic systems whose evolution is largely unknown, sensors with nonlinear measurements, and limited operational resources that constrain the number of active sensors at each measurement step. We provide an algorithm applicable to general stochastic processes and nonlinear measurements whose time complexity is linear in the planning horizon and whose performance is a multiplicative factor 1/2 away from the optimal performance. This is notable because the algorithm offers a significant computational advantage over the polynomial-time algorithm that achieves the best approximation factor 1/e. In addition, for important classes of Gaussian processes and nonlinear measurements corrupted with Gaussian noise, our algorithm enjoys the same time complexity as even the state-of-the-art algorithms for linear systems and measurements. We achieve our results by proving two properties for the entropy of the batch state vector conditioned on the measurements: a) it is supermodular in the choice of the sensors; b) it has a sparsity pattern (involves block tri-diagonal matrices) that facilitates its evaluation at each sensor set.

Connected through hyperedge HE-1 (induced by source paper "measurement scheduling for cooperative localization in resource constrained conditions"):
  with members:
    - "cooperative localization under limited connectivity"
    - "a resource aware approach to collaborative loop closure detection with provable performance guarantees"
    - "data efficient decentralized visual slam"
    - "server assisted distributed cooperative localization over unreliable communication links"
    - "cooperative localization for mobile agents a recursive decentralized algorithm based on kalman filter decoupling"

Connected through hyperedge HE-2 (induced by source paper "sensor assignment algorithms to improve observability while tracking targets"):
  with members:
    - "trackerbots autonomous unmanned aerial vehicle for real time localization and tracking of multiple radio tagged animals"
    - "trackerbots autonomous unmanned aerial vehicle for real time localization and tracking of multiple radio tagged animals"
    - "distributed state estimation using intermittently connected robot networks"
    - "active target tracking with self triggered communications in multi robot teams"
    - "distributed algorithms for feature extraction off loading in multi camera visual sensor networks"
    - "observability aware trajectory optimization for self calibration with application to uavs"

Connected through hyperedge HE-3 (induced by source paper "a randomized greedy algorithm for near optimal sensor scheduling in large scale sensor networks"):
  with members:
    - "minimal actuator placement with optimal control constraints"
    - "lazier than lazy greedy"

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)