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: "robustness of information diffusion algorithms to locally bounded adversaries"
  Abstract: We consider the problem of diffusing information in networks that contain malicious nodes. We assume that each normal node in the network has no knowledge of the network topology other than an upper bound on the number of malicious nodes in its neighborhood. We introduce a topological property known as r-robustness of a graph, and show that this property provides improved bounds on tolerating malicious behavior, in comparison to traditional concepts such as connectivity and minimum degree. We use this topological property to analyze the canonical problems of distributed consensus and broadcasting, and provide sufficient conditions for these operations to succeed. Finally, we provide a construction for r-robust graphs and show that the common preferential-attachment model for scale-free networks produces a robust graph.

Connected through hyperedge HE-1 (induced by source paper "inner attention supported adaptive cooperation for heterogeneous multi robots teaming based on multi agent reinforcement learning"):
  with members:
    - "graph policy gradients for large scale robot control"
    - "learning agile and dynamic motor skills for legged robots"
    - "enabling intuitive human robot teaming using augmented reality and gesture control"
    - "cleaning tasks knowledge transfer between heterogeneous robots a deep learning approach"
    - "zero shot autonomous vehicle policy transfer from simulation to real world via adversarial learning"
    - "a comprehensive review of shepherding as a bio inspired swarm robotics guidance approach"
    - "learning attentional communication for multi agent cooperation"
    - "qt opt scalable deep reinforcement learning for vision based robotic manipulation"

Connected through hyperedge HE-2 (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-3 (induced by source paper "exact byzantine consensus on undirected graphs under local broadcast model"):
  with members:
    - "byzantine consensus under local broadcast model tight sufficient condition"
    - "exact byzantine consensus under local broadcast model"
    - "iterative byzantine vector consensus in incomplete graphs"
    - "exact byzantine consensus in directed graphs"
    - "broadcast using certified propagation algorithm in presence of byzantine faults"
    - "iterative approximate byzantine consensus under a generalized fault model"
    - "iterative approximate byzantine consensus in arbitrary directed graphs"

Connected through hyperedge HE-4 (induced by source paper "byzantine consensus under local broadcast model tight sufficient condition"):
  with members:
    - "exact byzantine consensus under local broadcast model"
    - "exact byzantine consensus in directed graphs"
    - "broadcast using certified propagation algorithm in presence of byzantine faults"

Connected through hyperedge HE-5 (induced by source paper "resilience by reconfiguration exploiting heterogeneity in robot teams"):
  with members:
    - "graph drawing by stochastic gradient descent"
    - "circle packing for origami design is hard"

Connected through hyperedge HE-6 (induced by source paper "resilient consensus for multi agent systems subject to differential privacy requirements"):
  with members:
    - "resilient consensus of second order agent networks asynchronous update rules with delays"
    - "resilient randomized quantized consensus"
    - "r robustness and r s robustness of circulant graphs"
    - "exploiting nodes symmetries to control synchronization and consensus patterns in multiagent systems"
    - "a jamming resilient algorithm for self triggered network coordination"
    - "reaching approximate byzantine consensus with multi hop communication"
    - "differentially private distributed optimization"
    - "differentially private iterative synchronous consensus"

Connected through hyperedge HE-7 (induced by source paper "determining r robustness of arbitrary digraphs using zero one linear integer programming"):
  with members:
    - "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"
    - "distributed optimization under adversarial nodes"
    - "robustness and algebraic connectivity of random interdependent networks"
    - "reaching approximate byzantine consensus with multi hop communication"
    - "byzantine vector consensus in complete graphs"
    - "resilient continuous time consensus in fractional robust networks"

Connected through hyperedge HE-8 (induced by source paper "resilient leader follower consensus to arbitrary reference values"):
  with members:
    - "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"
    - "r robustness and r s robustness of circulant graphs"
    - "resilient continuous time consensus in fractional robust networks"

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.SI(Social and Information Networks)