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: "exact and stable recovery of rotations for robust synchronization"
  Abstract: The synchronization problem over the special orthogonal group $SO(d)$ consists of estimating a set of unknown rotations $R_1,R_2,...,R_n$ from noisy measurements of a subset of their pairwise ratios $R_{i}^{-1}R_{j}$. The problem has found applications in computer vision, computer graphics, and sensor network localization, among others. Its least squares solution can be approximated by either spectral relaxation or semidefinite programming followed by a rounding procedure, analogous to the approximation algorithms of \textsc{Max-Cut}. The contribution of this paper is three-fold: First, we introduce a robust penalty function involving the sum of unsquared deviations and derive a relaxation that leads to a convex optimization problem; Second, we apply the alternating direction method to minimize the penalty function; Finally, under a specific model of the measurement noise and for both complete and random measurement graphs, we prove that the rotations are exactly and stably recovered, exhibiting a phase transition behavior in terms of the proportion of noisy measurements. Numerical simulations confirm the phase transition behavior for our method as well as its improved accuracy compared to existing methods.

Connected through hyperedge HE-1 (induced by source paper "on the distribution of minima in intrinsic metric rotation averaging"):
  with members:
    - "rotation averaging and strong duality"
    - "cramer rao bounds for synchronization of rotations"
    - "a tutorial on spectral clustering"

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"
    - "spectral synchronization of multiple views in se 3"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "convex optimisation for inverse kinematics"):
  with members:
    - "reticam real time human performance capture from monocular video"
    - "convex relaxations for pose graph optimization with outliers"
    - "rotation averaging and strong duality"
    - "ganerated hands for real time 3d hand tracking from monocular rgb"
    - "vnect real time 3d human pose estimation with a single rgb camera"
    - "real time hand tracking under occlusion from an egocentric rgb d sensor"
    - "non iterative rigid 2d 3d point set registration using semidefinite programming"
    - "near optimal joint object matching via convex relaxation"

Connected through hyperedge HE-5 (induced by source paper "zoomout spectral upsampling for efficient shape correspondence"):
  with members:
    - "continuous and orientation preserving correspondences via functional maps"
    - "unsupervised deep learning for structured shape matching"
    - "fast and accurate intrinsic symmetry detection"
    - "farm functional automatic registration method for 3d human bodies"
    - "reversible harmonic maps between discrete surfaces"
    - "product manifold filter non rigid shape correspondence via kernel density estimation in the product space"
    - "localized manifold harmonics for spectral shape analysis"
    - "point wise map recovery and refinement from functional correspondence"

Connected through hyperedge HE-6 (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"
    - "spectral synchronization of multiple views in se 3"
    - "a large dataset of object scans"
    - "a solution for multi alignment by transformation synchronisation"
    - "multi image matching via fast alternating minimization"

Connected through hyperedge HE-7 (induced by source paper "cryo electron microscopy image analysis using multi frequency vector diffusion maps"):
  with members:
    - "apple picker automatic particle picking a low effort cryo em framework"
    - "the steerable graph laplacian and its application to filtering image data sets"
    - "denoising and covariance estimation of single particle cryo em images"
    - "fast steerable principal component analysis"
    - "fourier bessel rotational invariant eigenimages"

Connected through hyperedge HE-8 (induced by source paper "optimal learning of joint alignments with a faulty oracle"):
  with members:
    - "joint alignment from pairwise differences with a noisy oracle"
    - "predicting positive and negative links with noisy queries theory practice"
    - "the projected power method an efficient algorithm for joint alignment from pairwise differences"
    - "near optimal joint object matching via convex relaxation"
    - "streaming graph partitioning in the planted partition model"

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.IT(Information Theory)