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: "abstractions and sensor design in partial information reactive controller synthesis"
  Abstract: Automated synthesis of reactive control protocols from temporal logic specifications has recently attracted considerable attention in various applications in, for example, robotic motion planning, network management, and hardware design. An implicit and often unrealistic assumption in this past work is the availability of complete and precise sensing information during the execution of the controllers. In this paper, we use an abstraction procedure for systems with partial observation and propose a formalism to investigate effects of limitations in sensing. The abstraction procedure enables the existing synthesis methods with partial observation to be applicable and efficient for systems with infinite (or finite but large number of) states. This formalism enables us to systematically discover sensing modalities necessary in order to render the underlying synthesis problems feasible. We use counterexamples, which witness unrealizability potentially due to the limitations in sensing and the coarseness in the abstract system, and interpolation-based techniques to refine the model and the sensing modalities, i.e., to identify new sensors to be included, in such synthesis problems. We demonstrate the method on examples from robotic motion planning.

Connected through hyperedge HE-1 (induced by source paper "compositional abstraction refinement for control synthesis"):
  with members:
    - "synthesis of separable controlled invariant sets for modular local control design"
    - "an iterative abstraction algorithm for reactive correct by construction controller synthesis"
    - "assume guarantee abstraction refinement for probabilistic systems"

Connected through hyperedge HE-2 (induced by source paper "integrating active sensing into reactive synthesis with temporal logic constraints under partial observations"):
  with members:
    - "replanning in domains with partial information and sensing actions"
    - "control of probabilistic systems under dynamic partially known environments with temporal logic specifications"
    - "partial observation stochastic games how to win when belief fails"
    - "algorithms for omega regular games with imperfect information"
    - "decisive markov chains"

Connected through hyperedge HE-3 (induced by source paper "qualitative analysis of pomdps with temporal logic specifications for robotics applications"):
  with members:
    - "what is decidable about partially observable markov decision processes with omega regular objectives"
    - "point based pomdp algorithms improved analysis and implementation"
    - "heuristic search value iteration for pomdps"
    - "control of noisy differential drive vehicles from time bounded temporal logic specifications"
    - "from nondeterministic b uchi and streett automata to deterministic parity automata"

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)