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: "towards generation and evaluation of comprehensive mapping robot datasets"
  Abstract: This paper presents a fully hardware synchronized mapping robot with support for a hardware synchronized external tracking system, for super-precise timing and localization. We also employ a professional, static 3D scanner for ground truth map collection. Three datasets are generated to evaluate the performance of mapping algorithms within a room and between rooms. Based on these datasets we generate maps and trajectory data, which is then fed into evaluation algorithms. The mapping and evaluation procedures are made in a very easily reproducible manner for maximum comparability. In the end we can draw a couple of conclusions about the tested SLAM algorithms.

Connected through hyperedge HE-1 (induced by source paper "fast 2d map matching based on area graphs"):
  with members:
    - "heterogeneous multi sensor calibration based on graph optimization"
    - "furniture free mapping using 3d lidars"
    - "area graph generation of topological maps using the voronoi diagram"
    - "2d map alignment with region decomposition"

Connected through hyperedge HE-2 (induced by source paper "furniture free mapping using 3d lidars"):
  with members:
    - "fast 2d map matching based on area graphs"
    - "heterogeneous multi sensor calibration based on graph optimization"
    - "mapping with reflection detection and utilization of reflection in 3d lidar scans"
    - "area graph generation of topological maps using the voronoi diagram"

Connected through hyperedge HE-3 (induced by source paper "furniture free mapping"):
  with members:
    - "fast 2d map matching based on area graphs"
    - "heterogeneous multi sensor calibration based on graph optimization"
    - "mapping with reflection detection and utilization of reflection in 3d lidar scans"
    - "area graph generation of topological maps using the voronoi diagram"

Connected through hyperedge HE-4 (induced by source paper "mapping with reflection detection and utilization of reflection in 3d lidar scans"):
  with members:
    - "past present and future of simultaneous localization and mapping toward the robust perception age"

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)