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: "spectral synchronization of multiple views in se 3"
  Abstract: This paper addresses the problem of rigid-motion synchronization (a.k.a. motion averaging) in the Special Euclidean Group SE(3), which finds application in structure-from-motion and registration of multiple three-dimensional (3D) point-sets. After relaxing the geometric constraints of rigid motions, we derive a simple closed-form solution based on a spectral decomposition, which is then projected onto SE(3). Our formulation is extremely efficient, as rigid-motion synchronization is cast to an eigenvalue decomposition problem. Robustness to outliers is gained through Iteratively Reweighted Least Squares. Besides providing a theoretically appealing solution, since our method recovers at the same time both rotations and translations, we demonstrate through experimental results that our approach is significantly faster than the state of the art, while providing accurate estimates of rigid motions.

Connected through hyperedge HE-1 (induced by source paper "learning multiview 3d point cloud registration"):
  with members:
    - "4d spatio temporal convnets minkowski convolutional neural networks"
    - "efficient and robust registration on the 3d special euclidean group"
    - "3d local features for direct pairwise registration"
    - "deep closest point learning representations for point cloud registration"
    - "learning transformation synchronization"
    - "ppfnet global context aware local features for robust 3d point matching"
    - "latent ransac"
    - "deepmapping unsupervised map estimation from multiple point clouds"

Connected through hyperedge HE-2 (induced by source paper "probabilistic permutation synchronization using the riemannian structure of the birkhoff polytope"):
  with members:
    - "synchronisation of partial multi matchings via non negative factorisations"
    - "ppfnet global context aware local features for robust 3d point matching"
    - "bayesian pose graph optimization via bingham distributions and tempered geodesic mcmc"
    - "averaging stochastic gradient descent on riemannian manifolds"
    - "orb slam2 an open source slam system for monocular stereo and rgb d cameras"
    - "cad priors for accurate and flexible instance reconstruction"
    - "consistent multiple graph matching with multi layer random walks synchronization"
    - "multi image semantic matching by mining consistent features"

Connected through hyperedge HE-3 (induced by source paper "synchronisation of partial multi matchings via non negative factorisations"):
  with members:
    - "ds a flexible scalable and provably tight relaxation for matching problems"
    - "distributable consistent multi object matching"
    - "a constrained clustering based approach for matching a collection of feature sets"
    - "efficient and non convex coordinate descent for symmetric nonnegative matrix factorization"
    - "multi graph matching via affinity optimization with graduated consistency regularization"
    - "a dual ascent framework for lagrangean decomposition of combinatorial problems"
    - "alternating direction graph matching"
    - "a solution for multi alignment by transformation synchronisation"

Connected through hyperedge HE-4 (induced by source paper "learning transformation synchronization"):
  with members:
    - "open3d a modern library for 3d data processing"
    - "recurrent transformer networks for semantic correspondence"
    - "robust rotation synchronization via low rank and sparse matrix decomposition"
    - "learning to find good correspondences"
    - "a large dataset of object scans"
    - "a solution for multi alignment by transformation synchronisation"
    - "multi image matching via fast alternating minimization"
    - "near optimal joint object matching via convex relaxation"

Connected through hyperedge HE-5 (induced by source paper "robust motion segmentation from pairwise matches"):
  with members:
    - "motion segmentation by exploiting complementary geometric models"
    - "multi class model fitting by energy minimization and mode seeking"
    - "a survey of structure from motion"
    - "shape interaction matrix revisited and robustified efficient subspace clustering with corrupted and incomplete data"
    - "on constrained spectral clustering and its applications"
    - "robust recovery of subspace structures by low rank representation"
    - "generalized principal component analysis gpca"
    - "sparse subspace clustering algorithm theory and applications"

Connected through hyperedge HE-6 (induced by source paper "least squares registration of point sets over se d using closed form projections"):
  with members:
    - "go icp a globally optimal solution to 3d icp point set registration"
    - "a solution for multi alignment by transformation synchronisation"
    - "global registration of multiple point clouds using semidefinite programming"
    - "outlier robust icp for minimizing fractional rmsd"

Connected through hyperedge HE-7 (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"
    - "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"
    - "low rank modeling and its applications in image analysis"

Connected through hyperedge HE-8 (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"

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)