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: "stable camera motion estimation using convex programming"
  Abstract: We study the inverse problem of estimating n locations $t_1, ..., t_n$ (up to global scale, translation and negation) in $R^d$ from noisy measurements of a subset of the (unsigned) pairwise lines that connect them, that is, from noisy measurements of $\pm (t_i - t_j)/\|t_i - t_j\|$ for some pairs (i,j) (where the signs are unknown). This problem is at the core of the structure from motion (SfM) problem in computer vision, where the $t_i$'s represent camera locations in $R^3$. The noiseless version of the problem, with exact line measurements, has been considered previously under the general title of parallel rigidity theory, mainly in order to characterize the conditions for unique realization of locations. For noisy pairwise line measurements, current methods tend to produce spurious solutions that are clustered around a few locations. This sensitivity of the location estimates is a well-known problem in SfM, especially for large, irregular collections of images. #R##N#In this paper we introduce a semidefinite programming (SDP) formulation, specially tailored to overcome the clustering phenomenon. We further identify the implications of parallel rigidity theory for the location estimation problem to be well-posed, and prove exact (in the noiseless case) and stable location recovery results. We also formulate an alternating direction method to solve the resulting semidefinite program, and provide a distributed version of our formulation for large numbers of locations. Specifically for the camera location estimation problem, we formulate a pairwise line estimation method based on robust camera orientation and subspace estimation. Lastly, we demonstrate the utility of our algorithm through experiments on real images.

Connected through hyperedge HE-1 (induced by source paper "algebraic representations for volumetric frame fields"):
  with members:
    - "an approach to quad meshing based on harmonic cross valued maps and the ginzburg landau theory"
    - "manopt a matlab toolbox for optimization on manifolds"

Connected through hyperedge HE-2 (induced by source paper "robust rotation synchronization via low rank and sparse matrix decomposition"):
  with members:
    - "a survey of structure from motion"
    - "shapefit and shapekick for robust scalable structure from motion"
    - "spectral synchronization of multiple views in se 3"
    - "on computing the translations norm in the epipolar graph"
    - "practical matrix completion and corruption recovery using proximal alternating robust subspace minimization"
    - "a solution for multi alignment by transformation synchronisation"
    - "cramer rao bounds for synchronization of rotations"
    - "robust camera location estimation by convex programming"

Connected through hyperedge HE-3 (induced by source paper "bayesian pose graph optimization via bingham distributions and tempered geodesic mcmc"):
  with members:
    - "convex relaxations for pose graph optimization with outliers"
    - "local optimality and generalization guarantees for the langevin algorithm via empirical metastability"
    - "rotation averaging and strong duality"
    - "non convex learning via stochastic gradient langevin dynamics a nonasymptotic analysis"
    - "a hitting time analysis of stochastic gradient langevin dynamics"
    - "cad priors for accurate and flexible instance reconstruction"
    - "camera pose filtering with local regression geodesics on the riemannian manifold of dual quaternions"
    - "a certifiably correct algorithm for synchronization over the special euclidean group"

Connected through hyperedge HE-4 (induced by source paper "exact camera location recovery by least unsquared deviations"):
  with members:
    - "baseline desensitizing in translation averaging"
    - "estimation of camera locations in highly corrupted scenarios all about that base no shape trouble"
    - "a new rank constraint on multi view fundamental matrices and its application to camera location recovery"
    - "a survey of structure from motion"
    - "shapefit and shapekick for robust scalable structure from motion"
    - "shapefit exact location recovery from corrupted pairwise directions"
    - "robust computation of linear models by convex relaxation"
    - "robust camera location estimation by convex programming"

Connected through hyperedge HE-5 (induced by source paper "estimation of camera locations in highly corrupted scenarios all about that base no shape trouble"):
  with members:
    - "exact camera location recovery by least unsquared deviations"
    - "a new rank constraint on multi view fundamental matrices and its application to camera location recovery"
    - "a survey of structure from motion"
    - "shapefit and shapekick for robust scalable structure from motion"
    - "shapefit exact location recovery from corrupted pairwise directions"
    - "robust camera location estimation by convex programming"

Connected through hyperedge HE-6 (induced by source paper "hardness results for structured linear systems"):
  with members:
    - "computing maximum flow with augmenting electrical flows"
    - "geometric median in nearly linear time"
    - "sparsified cholesky and multigrid solvers for connection laplacians"
    - "efficient inverse maintenance and faster algorithms for linear programming"
    - "sketching as a tool for numerical linear algebra"
    - "approximate undirected maximum flows in o m polylog n time"
    - "an almost linear time algorithm for approximate max flow in undirected graphs and its multicommodity generalizations"
    - "navigating central path with electrical flows from flows to matchings and back"

Connected through hyperedge HE-7 (induced by source paper "a survey of structure from motion"):
  with members:
    - "a survey on non filter based monocular visual slam systems"
    - "shapefit and shapekick for robust scalable structure from motion"
    - "shapefit exact location recovery from corrupted pairwise directions"
    - "exact simultaneous recovery of locations and structure from known orientations and corrupted point correspondences"
    - "robust inference for visual inertial sensor fusion"
    - "robust camera location estimation by convex programming"
    - "exact and stable recovery of rotations for robust synchronization"
    - "eigenvector synchronization graph rigidity and the molecule problem"

Connected through hyperedge HE-8 (induced by source paper "a new rank constraint on multi view fundamental matrices and its application to camera location recovery"):
  with members:
    - "shapefit and shapekick for robust scalable structure from motion"
    - "robust camera location estimation by convex programming"
    - "exact matrix completion via convex optimization"

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.CV(Computer Vision and Pattern Recognition)