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: "message passing algorithms for synchronization problems over compact groups"
  Abstract: Various alignment problems arising in cryo-electron microscopy, community detection, time synchronization, computer vision, and other fields fall into a common framework of synchronization problems over compact groups such as Z/L, U(1), or SO(3). The goal of such problems is to estimate an unknown vector of group elements given noisy relative observations. We present an efficient iterative algorithm to solve a large class of these problems, allowing for any compact group, with measurements on multiple 'frequency channels' (Fourier modes, or more generally, irreducible representations of the group). Our algorithm is a highly efficient iterative method following the blueprint of approximate message passing (AMP), which has recently arisen as a central technique for inference problems such as structured low-rank estimation and compressed sensing. We augment the standard ideas of AMP with ideas from representation theory so that the algorithm can work with distributions over compact groups. Using standard but non-rigorous methods from statistical physics we analyze the behavior of our algorithm on a Gaussian noise model, identifying phases where the problem is easy, (computationally) hard, and (statistically) impossible. In particular, such evidence predicts that our algorithm is information-theoretically optimal in many cases, and that the remaining cases show evidence of statistical-to-computational gaps.

Connected through hyperedge HE-1 (induced by source paper "multi frequency phase synchronization"):
  with members:
    - "non unique games over compact groups and orientation estimation in cryo em"
    - "solving random quadratic systems of equations is nearly as easy as solving linear systems"
    - "phase retrieval via wirtinger flow theory and algorithms"
    - "information recovery from pairwise measurements"
    - "global registration of multiple point clouds using semidefinite programming"
    - "approximating the little grothendieck problem over the orthogonal and unitary groups"

Connected through hyperedge HE-2 (induced by source paper "spectral methods from tensor networks"):
  with members:
    - "estimation in the group action channel"
    - "bispectrum inversion with application to multireference alignment"
    - "heterogeneous multireference alignment a single pass approach"
    - "the sample complexity of multi reference alignment"
    - "exact tensor completion with sum of squares"
    - "sample complexity of the boolean multireference alignment problem"
    - "a nearly tight sum of squares lower bound for the planted clique problem"
    - "polynomial time tensor decompositions with sum of squares"

Connected through hyperedge HE-3 (induced by source paper "bispectrum inversion with application to multireference alignment"):
  with members:
    - "on signal reconstruction from frog measurements"
    - "fourier phase retrieval uniqueness and algorithms"
    - "on the uniqueness of frog methods"
    - "the sample complexity of multi reference alignment"
    - "non convex phase retrieval from stft measurements"
    - "the projected power method an efficient algorithm for joint alignment from pairwise differences"
    - "fundamental limits in multi image alignment"
    - "near optimal joint object matching via convex relaxation"

Connected through hyperedge HE-4 (induced by source paper "the noise sensitivity phase transition in spectral group synchronization over compact groups"):
  with members:
    - "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"
    - "cramer rao bounds for synchronization of rotations"
    - "multireference alignment using semidefinite programming"
    - "exact and stable recovery of rotations for robust synchronization"
    - "estimation and registration on graphs"

Connected through hyperedge HE-5 (induced by source paper "fourier phase retrieval uniqueness and algorithms"):
  with members:
    - "bispectrum inversion with application to multireference alignment"
    - "on fienup methods for sparse phase retrieval"
    - "on signal reconstruction from frog measurements"
    - "on the 2d phase retrieval problem"
    - "multiple illumination phaseless super resolution mips with applications to phaseless doa estimation and diffraction imaging"
    - "on the uniqueness of frog methods"
    - "improved recovery guarantees for phase retrieval from coded diffraction patterns"
    - "multireference alignment is easier with an aperiodic translation distribution"

Connected through hyperedge HE-6 (induced by source paper "non convex phase retrieval from stft measurements"):
  with members:
    - "bispectrum inversion with application to multireference alignment"
    - "on fienup methods for sparse phase retrieval"
    - "on signal reconstruction from frog measurements"
    - "fourier phase retrieval uniqueness and algorithms"
    - "on the uniqueness of frog methods"
    - "improved recovery guarantees for phase retrieval from coded diffraction patterns"
    - "stft phase retrieval uniqueness guarantees and recovery algorithms"
    - "the projected power method an efficient algorithm for joint alignment from pairwise differences"

Connected through hyperedge HE-7 (induced by source paper "a representation theory perspective on simultaneous alignment and classification"):
  with members:
    - "heterogeneous multireference alignment a single pass approach"
    - "multisection in the stochastic block model using semidefinite programming"
    - "continuously heterogeneous hyper objects in cryo em and 3 d movies of many temporal dimensions"
    - "a max cut approach to heterogeneity in cryo electron microscopy"
    - "the projected power method an efficient algorithm for joint alignment from pairwise differences"
    - "non unique games over compact groups and orientation estimation in cryo em"
    - "covariance estimation using conjugate gradient for 3d classification in cryo em"
    - "multireference alignment using semidefinite programming"

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)