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 "characterizing slam benchmarks and methods for the robust perception age"):
  Abstract: The diversity of SLAM benchmarks affords extensive testing of SLAM algorithms to understand their performance, individually or in relative terms. The ad-hoc creation of these benchmarks does not necessarily illuminate the particular weak points of a SLAM algorithm when performance is evaluated. In this paper, we propose to use a decision tree to identify challenging benchmark properties for state-of-the-art SLAM algorithms and important components within the SLAM pipeline regarding their ability to handle these challenges. Establishing what factors of a particular sequence lead to track failure or degradation relative to these characteristics is important if we are to arrive at a strong understanding for the core computational needs of a robust SLAM algorithm. Likewise, we argue that it is important to profile the computational performance of the individual SLAM components for use when benchmarking. In particular, we advocate the use of time-dilation during ROS bag playback, or what we refer to as slo-mo playback. Using slo-mo to benchmark SLAM instantiations can provide clues to how SLAM implementations should be improved at the computational component level. Three prevalent VO/SLAM algorithms and two low-latency algorithms of our own are tested on selected typical sequences, which are generated from benchmark characterization, to further demonstrate the benefits achieved from computationally efficient components.

Includes members:
  Member "good feature matching towards accurate robust vo vslam with low latency":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "closed loop benchmarking of stereo visual inertial slam systems understanding the impact of drift and latency on tracking accuracy")
  Member "low latency visual slam with appearance enhanced local map building":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "good feature matching towards accurate robust vo vslam with low latency")
  Member "good feature selection for least squares pose optimization in vo vslam":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "good feature matching towards accurate robust vo vslam with low latency")
  Member "interiornet mega scale multi sensor photo realistic indoor scenes dataset":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lighthouse predicting lighting volumes for spatially coherent illumination")
  Member "the blackbird dataset a large scale dataset for uav perception in aggressive flight":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "airsim drone racing lab")
  Member "the tum vi benchmark for evaluating visual inertial odometry":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "good feature matching towards accurate robust vo vslam with low latency")
  Member "direct sparse odometry":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "good feature matching towards accurate robust vo vslam with low latency")
  Member "past present and future of simultaneous localization and mapping toward the robust perception age":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "perception and decision making of autonomous systems in the era of learning an overview")

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)