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: "cramer rao bounds for synchronization of rotations"
  Abstract: Synchronization of rotations is the problem of estimating a set of rotations Ri 2 SO(n);i = 1:::N based on noisy measurements of relative rotations RiR > . This fundamental problem has found many recent applications, most importantly in structural biology. We provide a framework to study synchronization as estimation on Riemannian manifolds for arbitrary n under a large family of noise models. The noise models we address encompass zero-mean isotropic noise, and we develop tools for Gaussian-like as well as heavy-tail types of noise in particular. As a main contribution, we derive the Cram er-Rao bounds of synchronization, that is, lower-bounds on the variance of unbiased estimators. We nd that these bounds are structured by the pseudoinverse of the measurement graph Laplacian, where edge weights are proportional to measurement quality. We leverage this to provide interpretation in terms of random walks and visualization tools for these bounds in both the anchored and anchor-free scenarios. Similar bounds previously established were limited to rotations in the plane and Gaussian-like noise. Synchronization of rotations, estimation on manifolds, estimation on graphs, graph Laplacian, Fisher information, Cram er-Rao bounds, distributions on the rotation group, Langevin. 2000 Math Subject Classication: 62F99, 94C15, 22C05, 05C12,

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"
    - "exact and stable recovery of rotations for robust synchronization"
    - "a tutorial on spectral clustering"

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"
    - "robust camera location estimation by convex programming"
    - "low rank modeling and its applications in image analysis"

Connected through hyperedge HE-3 (induced by source paper "the noise sensitivity phase transition in spectral group synchronization over compact groups"):
  with members:
    - "message passing algorithms for synchronization problems over compact groups"
    - "spectral synchronization of multiple views in se 3"
    - "non unique games over compact groups and orientation estimation in cryo em"
    - "synchronization over z2 and community detection in signed multiplex networks with constraints"
    - "a solution for multi alignment by transformation synchronisation"
    - "multireference alignment using semidefinite programming"
    - "exact and stable recovery of rotations for robust synchronization"
    - "estimation and registration on graphs"

Connected through hyperedge HE-4 (induced by source paper "a certifiably correct algorithm for synchronization over the special euclidean group"):
  with members:
    - "spectral synchronization of multiple views in se 3"
    - "non unique games over compact groups and orientation estimation in cryo em"
    - "manopt a matlab toolbox for optimization on manifolds"
    - "exact and stable recovery of rotations for robust synchronization"
    - "from angular manifolds to the integer lattice guaranteed orientation estimation with application to pose graph optimization"
    - "stable principal component pursuit"
    - "robust principal component analysis"

Connected through hyperedge HE-5 (induced by source paper "lagrangian duality in 3d slam verification techniques and optimal solutions"):
  with members:
    - "from angular manifolds to the integer lattice guaranteed orientation estimation with application to pose graph optimization"

Connected through hyperedge HE-6 (induced by source paper "decoding binary node labels from censored edge measurements phase transition and efficient recovery"):
  with members:
    - "near optimal joint object matching via convex relaxation"
    - "exact recovery in the stochastic block model"
    - "approximating the little grothendieck problem over the orthogonal and unitary groups"
    - "exact and stable recovery of rotations for robust synchronization"
    - "community detection in the labelled stochastic block model"
    - "phase retrieval with polarization"
    - "correlation clustering with a fixed number of clusters"

Connected through hyperedge HE-7 (induced by source paper "concentration of the kirchhoff index for erdős renyi graphs"):
  with members:
    - "exact and stable recovery of rotations for robust synchronization"
    - "eigenvector synchronization graph rigidity and the molecule problem"
    - "estimation and registration on graphs"

Connected through hyperedge HE-8 (induced by source paper "exact and stable recovery of rotations for robust synchronization"):
  with members:
    - "efficient rounding for the noncommutative grothendieck inequality"
    - "eigenvector synchronization graph rigidity and the molecule problem"
    - "estimation and registration on graphs"
    - "max cut and the smallest eigenvalue"

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)