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 "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.

Includes members:
  Member "robust computation of linear models by convex relaxation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "robust camera location estimation by convex programming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning transformation synchronization")
  Member "global registration of multiple point clouds using semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "probabilistic permutation synchronization using the riemannian structure of the birkhoff polytope")
  Member "exact and stable recovery of rotations for robust synchronization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the distribution of minima in intrinsic metric rotation averaging")
  Member "phaselift exact and stable signal recovery from magnitude measurements via convex programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deep s 3 pr simultaneous source separation and phase retrieval using deep generative models")
  Member "robust pca via outlier pursuit":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "on affine rigidity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a unified dissertation on bearing rigidity theory")
  Member "robust principal component analysis":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")

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