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

Includes members:
  Member "exact and stable recovery of rotations for robust synchronization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the distribution of minima in intrinsic metric rotation averaging")
  Member "eigenvector synchronization graph rigidity and the molecule problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an mbo scheme for clustering and semi supervised clustering of signed networks")
  Member "estimation and registration on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the noise sensitivity phase transition in spectral group synchronization over compact groups")

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