human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "byzantine resilient distributed observers for lti systems"):
  Abstract: Consider a linear time-invariant (LTI) dynamical system monitored by a network of sensors, modeled as nodes of an underlying directed communication graph. We study the problem of collaboratively estimating the state of the system when certain nodes are compromised by adversaries. Specifically, we consider a Byzantine adversary model, where a compromised node possesses complete knowledge of the system dynamics and the network, and can deviate arbitrarily from the rules of any prescribed algorithm. We first characterize certain fundamental limitations of any distributed state estimation algorithm in terms of the measurement and communication structure of the nodes. We then develop an attack-resilient, provably correct state estimation algorithm that admits a fully distributed implementation. To characterize feasible network topologies that guarantee success of our proposed technique, we introduce a notion of `strong-robustness' that captures both measurement and communication redundancy. Finally, by drawing connections to bootstrap percolation theory, we argue that given an LTI system and an associated sensor network, the `strong-robustness' property can be checked in polynomial time.

Includes members:
  Member "a distributed observer for a time invariant linear system":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a distributed observer for a discrete time linear system")
  Member "secure distributed state estimation of an lti system over time varying networks and analog erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "determining r and r s robustness of digraphs using mixed integer linear programming")
  Member "detection and mitigation of biasing attacks on distributed estimation networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secure distributed filtering for unstable dynamics under compromised observations")
  Member "detection of biasing attacks on distributed estimation networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "detection and mitigation of biasing attacks on distributed estimation networks")
  Member "distributed observers for lti systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a new approach for distributed hypothesis testing with extensions to byzantine resilience")
  Member "iterative approximate byzantine consensus in arbitrary directed graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "grand challenges of resilience autonomous system resilience through design and runtime measures")
  Member "distributing the kalman filter for large scale systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "coded distributed tracking")

Question: Please tell me which class the source paper 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)