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: "consensus of multi agent networks in the presence of adversaries using only local information"
  Abstract: This paper addresses the problem of resilient consensus in the presence of misbehaving nodes. Although it is typical to assume knowledge of at least some nonlocal information when studying secure and fault-tolerant consensus algorithms, this assumption is not suitable for large-scale dynamic networks. To remedy this, we emphasize the use of local strategies to deal with resilience to security breaches. We study a consensus protocol that uses only local information and we consider worst-case security breaches, where the compromised nodes have full knowledge of the network and the intentions of the other nodes. We provide necessary and sufficient conditions for the normal nodes to reach consensus despite the influence of the malicious nodes under different threat assumptions. These conditions are stated in terms of a novel graph-theoretic property referred to as network robustness.

Connected through hyperedge HE-1 (induced by source paper "determining r and r s robustness of digraphs using mixed integer linear programming"):
  with members:
    - "determining r robustness of arbitrary digraphs using zero one linear integer programming"
    - "secure distributed state estimation of an lti system over time varying networks and analog erasure channels"
    - "resilient consensus of second order agent networks asynchronous update rules with delays"
    - "on connectivity and robustness in random intersection graphs"
    - "resilient randomized quantized consensus"
    - "r robustness and r s robustness of circulant graphs"
    - "distributed optimization under adversarial nodes"
    - "robustness and algebraic connectivity of random interdependent networks"

Connected through hyperedge HE-2 (induced by source paper "on adversary robust consensus protocols through joint agent interactions"):
  with members:
    - "evaluating user reputation in online rating systems via an iterative group based ranking method"
    - "continuous time consensus under non instantaneous reciprocity"

Connected through hyperedge HE-3 (induced by source paper "effects of topology knowledge and relay depth on asynchronous consensus"):
  with members:
    - "gracefully degrading consensus and k set agreement in directed dynamic networks"
    - "reliable communication in a dynamic network in the presence of byzantine faults"
    - "approximate consensus in highly dynamic networks the role of averaging algorithms"
    - "reaching approximate byzantine consensus with multi hop communication"
    - "iterative approximate byzantine consensus under a generalized fault model"
    - "iterative approximate byzantine consensus in arbitrary directed graphs"
    - "robustness of complex networks with implications for consensus and contagion"
    - "easy impossibility proofs for k set agreement in message passing systems"

Connected through hyperedge HE-4 (induced by source paper "finite time resilient formation control with bounded inputs"):
  with members:
    - "secure distributed state estimation of an lti system over time varying networks and analog erasure channels"
    - "resilient leader follower consensus to arbitrary reference values"
    - "resilient consensus of second order agent networks asynchronous update rules with delays"
    - "resilient continuous time consensus in fractional robust networks"

Connected through hyperedge HE-5 (induced by source paper "attack analysis and resilient control design for discrete time distributed multi agent systems"):
  with members:
    - "resilient active target tracking with multiple robots"
    - "resilient leader follower consensus to arbitrary reference values"
    - "interdependent security games on networks under behavioral probability weighting"
    - "resilient randomized quantized consensus"

Connected through hyperedge HE-6 (induced by source paper "r robustness and r s robustness of circulant graphs"):
  with members:
    - "resilient consensus of second order agent networks asynchronous update rules with delays"
    - "on connectivity and robustness in random intersection graphs"
    - "resilient randomized quantized consensus"
    - "robustness and algebraic connectivity of random interdependent networks"
    - "resilient continuous time consensus in fractional robust networks"
    - "iterative approximate byzantine consensus in arbitrary directed graphs"
    - "robustness of complex networks with implications for consensus and contagion"
    - "robustness of information diffusion algorithms to locally bounded adversaries"

Connected through hyperedge HE-7 (induced by source paper "defending non bayesian learning against adversarial attacks"):
  with members:
    - "learning without recall a case for log linear learning"
    - "finite time analysis of the distributed detection problem"
    - "reaching approximate byzantine consensus with multi hop communication"
    - "byzantine vector consensus in complete graphs"
    - "iterative byzantine vector consensus in incomplete graphs"
    - "exponentially fast parameter estimation in networks using distributed dual averaging"
    - "distributed detection over noisy networks large deviations analysis"
    - "large deviations performance of consensus innovations distributed detection with non gaussian observations"

Connected through hyperedge HE-8 (induced by source paper "byzantine multi agent optimization part ii"):
  with members:
    - "data falsification attacks on consensus based detection systems"
    - "matrix representation of iterative approximate byzantine consensus in directed graphs"
    - "iterative approximate byzantine consensus in arbitrary directed graphs"

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.DC(Distributed, Parallel, and Cluster Computing)