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: "near optimal budgeted data exchange for distributed loop closure detection"
  Abstract: Inter-robot loop closure detection is a core problem in collaborative SLAM (CSLAM). Establishing inter-robot loop closures is a resource-demanding process, during which robots must consume a substantial amount of mission-critical resources (e.g., battery and bandwidth) to exchange sensory data. However, even with the most resource-efficient techniques, the resources available onboard may be insufficient for verifying every potential loop closure. This work addresses this critical challenge by proposing a resource-adaptive framework for distributed loop closure detection. We seek to maximize task-oriented objectives subject to a budget constraint on total data transmission. This problem is in general NP-hard. We approach this problem from different perspectives and leverage existing results on monotone submodular maximization to provide efficient approximation algorithms with performance guarantees. The proposed approach is extensively evaluated using the KITTI odometry benchmark dataset and synthetic Manhattan-like datasets.

Connected through hyperedge HE-1 (induced by source paper "door slam distributed online and outlier resilient slam for robotic teams"):
  with members:
    - "active rendezvous for multi robot pose graph optimization using sensing over wi fi"
    - "a resource aware approach to collaborative loop closure detection with provable performance guarantees"
    - "convex relaxations for pose graph optimization with outliers"
    - "modeling perceptual aliasing in slam via discrete continuous graphical models"
    - "talk resource efficiently to me optimal communication planning for distributed loop closure detection"
    - "data efficient decentralized visual slam"
    - "distributed mapping with privacy and communication constraints lightweight algorithms and object based models"
    - "netvlad cnn architecture for weakly supervised place recognition"

Connected through hyperedge HE-2 (induced by source paper "resource aware algorithms for distributed loop closure detection with provable performance guarantees"):
  with members:
    - "orb slam2 an open source slam system for monocular stereo and rgb d cameras"
    - "data efficient decentralized visual slam"
    - "distributed mapping with privacy and communication constraints lightweight algorithms and object based models"
    - "designing sparse reliable pose graph slam a graph theoretic approach"

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