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 "determining r robustness of arbitrary digraphs using zero one linear integer programming"):
  Abstract: There has been an increase in the use of resilient control algorithms based on the graph theoretic properties of $r$- and $(r,s)$-robustness. These algorithms guarantee consensus of normally behaving agents in the presence of a bounded number of arbitrarily misbehaving agents if the values of the integers $r$ and $s$ are sufficiently high. However, determining the largest integer $r$ for which an arbitrary digraph is $r$-robust is highly nontrivial. This paper introduces a novel method for calculating this value using zero-one integer programming. The method only requires knowledge of the graph Laplacian matrix, and can be formulated with affine objective and constraints, except for the integer constraint. Integer programming methods such as branch-and-bound can allow both lower and upper bounds on $r$ to be iteratively tightened. Simulations suggest the proposed method demonstrates greater efficiency than prior algorithms.

Includes members:
  Member "secure distributed state estimation of an lti system over time varying networks and analog erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "determining r and r s robustness of digraphs using mixed integer linear programming")
  Member "resilient consensus of second order agent networks asynchronous update rules with delays":
    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 "on connectivity and robustness in random intersection graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "determining r and r s robustness of digraphs using mixed integer linear programming")
  Member "distributed optimization under adversarial nodes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "resilient cyberphysical systems and their application drivers a technology roadmap")
  Member "robustness and algebraic connectivity of random interdependent networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "determining r and r s robustness of digraphs using mixed integer linear programming")
  Member "reaching approximate byzantine consensus with multi hop communication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "determining r and r s robustness of digraphs using mixed integer linear programming")
  Member "byzantine vector consensus in complete graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "determining r and r s robustness of digraphs using mixed integer linear programming")
  Member "resilient continuous time consensus in fractional robust networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "determining r and r s robustness of digraphs using mixed integer linear programming")

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)