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 "r robustness and r s robustness of circulant graphs"):
  Abstract: There has been recent growing interest in graph theoretical properties known as r- and (r,s)-robustness. These properties serve as sufficient conditions guaranteeing the success of certain consensus algorithms in networks with misbehaving agents present. Due to the complexity of determining the robustness for an arbitrary graph, several methods have previously been proposed for identifying the robustness of specific classes of graphs or constructing graphs with specified robustness levels. The majority of such approaches have focused on undirected graphs. In this paper we identify a class of scalable directed graphs whose edge set is determined by a parameter k and prove that the robustness of these graphs is also determined by k. We support our results through computer simulations.

Includes members:
  Member "resilient consensus of second order agent networks asynchronous update rules with delays":
    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 "on connectivity and robustness in random intersection graphs":
    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 "resilient randomized quantized consensus":
    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 "robustness and algebraic connectivity of random interdependent networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "determining r and r s robustness of digraphs using mixed integer linear programming")
  Member "consensus of multi agent networks in the presence of adversaries using only local information":
    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 "iterative approximate byzantine consensus in arbitrary directed graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "grand challenges of resilience autonomous system resilience through design and runtime measures")
  Member "robustness of complex networks with implications for consensus and contagion":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the strength of connectivity of random graphs induced by pairwise key predistribution schemes implications on security and reliability of heterogeneous sensor networks")

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)