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 "sparse depth sensing for resource constrained robots"):
  Abstract: We consider the case in which a robot has to navigate in an unknown environment but does not have enough on-board power or payload to carry a traditional depth sensor (e.g., a 3D lidar) and thus can only acquire a few (point-wise) depth measurements. We address the following question: is it possible to reconstruct the geometry of an unknown environment using sparse and incomplete depth measurements? Reconstruction from incomplete data is not possible in general, but when the robot operates in man-made environments, the depth exhibits some regularity (e.g., many planar surfaces with only a few edges); we leverage this regularity to infer depth from a small number of measurements. Our first contribution is a formulation of the depth reconstruction problem that bridges robot perception with the compressive sensing literature in signal processing. The second contribution includes a set of formal results that ascertain the exactness and stability of the depth reconstruction in 2D and 3D problems, and completely characterize the geometry of the profiles that we can reconstruct. Our third contribution is a set of practical algorithms for depth reconstruction: our formulation directly translates into algorithms for depth estimation based on convex programming. In real-world problems, these convex programs are very large and general-purpose solvers are relatively slow. For this reason, we discuss ad-hoc solvers that enable fast depth reconstruction in real problems. The last contribution is an extensive experimental evaluation in 2D and 3D problems, including Monte Carlo runs on simulated instances and testing on multiple real datasets. Empirical results confirm that the proposed approach ensures accurate depth reconstruction, outperforms interpolation-based strategies, and performs well even when the assumption of structured environment is violated.

Includes members:
  Member "deep depth completion of a single rgb d image":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "depth estimation by learning triangulation and densification of sparse points for multi view stereo")
  Member "compressed sensing for scalable robotic tactile skins":
    also connected through other hyperedges:
      (none)
  Member "deeper depth prediction with fully convolutional residual networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "domain decluttering simplifying images to mitigate synthetic real domain shift and improve depth estimation")
  Member "adaptive foveated single pixel imaging with dynamic super sampling":
    also connected through other hyperedges:
      (none)
  Member "orb slam a versatile and accurate monocular slam system":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mvp unified motion and visual self supervised learning for large scale robotic navigation")
  Member "high performance and tunable stereo reconstruction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "incremental visual inertial 3d mesh generation with structural regularities")
  Member "depth reconstruction from sparse samples representation algorithm and sampling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning guided convolutional network for depth completion")
  Member "stable image reconstruction using total variation minimization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "compressed sensing with 1d total variation breaking sample complexity barriers via non uniform recovery")

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)