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: "identifying robust landmarks in feature based maps"
  Abstract: To operate in an urban environment, an automated vehicle must be capable of accurately estimating its position within a global map reference frame. This is necessary for optimal path planning and safe navigation. To accomplish this over an extended period of time, the global map requires long-term maintenance. This includes the addition of newly observable features and the removal of transient features belonging to dynamic objects. The latter is especially important for the long-term use of the map as matching against a map with features that no longer exist can result in incorrect data associations, and consequently erroneous localisation. This paper addresses the problem of removing features from the map that correspond to objects that are no longer observable/present in the environment. This is achieved by assigning a single score which depends on the geometric distribution and characteristics when the features are re-detected (or not) on different occasions. Our approach not only eliminates ephemeral features, but also can be used as a reduction algorithm for highly dense maps. We tested our approach using half a year of weekly drives over the same 500-metre section of road in an urban environment. The results presented demonstrate the validity of the long-term approach to map maintenance.

Connected through hyperedge HE-1 (induced by source paper "large scale real time visual inertial localization revisited"):
  with members:
    - "deep auxiliary learning for visual localization and odometry"
    - "maplab an open framework for research in visual inertial mapping and localization"
    - "hybrid scene compression for visual localization"
    - "inloc indoor visual localization with dense matching and view synthesis"
    - "geometric loss functions for camera pose regression with deep learning"
    - "benchmarking 6dof urban visual localization in changing conditions"
    - "learning less is more 6d camera localization via 3d surface regression"
    - "3d visual perception for self driving cars using a multi camera system calibration mapping localization and obstacle detection"

Connected through hyperedge HE-2 (induced by source paper "towards provably not at fault control of autonomous robots in arbitrary dynamic environments"):
  with members:
    - "occlusion aware risk assessment for autonomous driving in urban environments"
    - "bridging the gap between safety and real time performance in receding horizon trajectory design for mobile robots"
    - "a scalable framework for real time multi robot multi human collision avoidance"
    - "fastrack a modular framework for fast and guaranteed safe motion planning"
    - "on a formal model of safe and scalable self driving cars"
    - "safe trajectory synthesis for autonomous driving in unforeseen environments"
    - "funnel libraries for real time robust feedback motion planning"
    - "a unifying formalism for shortest path problems with expensive edge evaluations via lazy best first search over paths with edge selectors"

Connected through hyperedge HE-3 (induced by source paper "geographical map registration and fusion of lidar aerial orthoimagery in gis"):
  with members:
    - "metrics for the evaluation of localisation robustness"
    - "robust and precise vehicle localization based on multi sensor fusion in diverse city scenes"
    - "monocular urban localization using street view"

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)