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 "behavior mixing with minimum global and subgroup connectivity maintenance for large scale multi robot systems"):
  Abstract: In many cases the multi-robot systems are desired to execute simultaneously multiple behaviors with different controllers, and sequences of behaviors in real time, which we call \textit{behavior mixing}. Behavior mixing is accomplished when different subgroups of the overall robot team change their controllers to collectively achieve given tasks while maintaining connectivity within and across subgroups in one connected communication graph. In this paper, we present a provably minimum connectivity maintenance framework to ensure the subgroups and overall robot team stay connected at all time while providing the highest freedom for behavior mixing. In particular, we propose a real-time distributed Minimum Connectivity Constraint Spanning Tree (MCCST) algorithm to select the minimum inter-robot connectivity constraints preserving subgroup and global connectivity that are \textit{least likely to be violated} by the original controllers. With the employed control barrier functions for the activated connectivity constraints as well as collision avoidance, the behavior mixing controllers are thus modified in a minimally invasive manner. We demonstrate the effectiveness and scalability of our approach via simulations of up to 100 robots in presence of multiple behaviors.

Includes members:
  Member "control barrier functions theory and applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "safety considerations in deep control policies with safety barrier certificates under uncertainty")
  Member "decentralized connectivity preserving deployment of large scale robot swarms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "self healing ground and air connectivity chains")
  Member "a time and message optimal distributed algorithm for minimum spanning trees":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "improved algorithm for min cuts in distributed networks")
  Member "multi objective compositions for collision free connectivity maintenance in teams of mobile robots":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a set theoretic approach to multi task execution and prioritization")
  Member "distributed verification and hardness of distributed approximation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "beyond alice and bob improved inapproximability for maximum independent set in congest")

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.RO(Robotics)