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: "non unique games over compact groups and orientation estimation in cryo em"
  Abstract: Let $\mathcal{G}$ be a compact group and let $f_{ij} \in L^2(\mathcal{G})$. We define the Non-Unique Games (NUG) problem as finding $g_1,\dots,g_n \in \mathcal{G}$ to minimize $\sum_{i,j=1}^n f_{ij} \left( g_i g_j^{-1}\right)$. We devise a relaxation of the NUG problem to a semidefinite program (SDP) by taking the Fourier transform of $f_{ij}$ over $\mathcal{G}$, which can then be solved efficiently. The NUG framework can be seen as a generalization of the little Grothendieck problem over the orthogonal group and the Unique Games problem and includes many practically relevant problems, such as the maximum likelihood estimator} to registering bandlimited functions over the unit sphere in $d$-dimensions and orientation estimation in cryo-Electron Microscopy.

Connected through hyperedge HE-1 (induced by source paper "single particle cryo electron microscopy mathematical theory computational challenges and opportunities"):
  with members:
    - "unsupervised particle sorting for high resolution single particle cryo em"
    - "a common lines approach for ab initio modeling of cyclically symmetric molecules"
    - "multi target detection with application to cryo electron microscopy"
    - "apple picker automatic particle picking a low effort cryo em framework"
    - "toward single particle reconstruction without particle picking breaking the detection limit"
    - "estimation in the group action channel"
    - "bispectrum inversion with application to multireference alignment"
    - "heterogeneous multireference alignment a single pass approach"

Connected through hyperedge HE-2 (induced by source paper "multi frequency phase synchronization"):
  with members:
    - "message passing algorithms for synchronization problems over compact groups"
    - "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-3 (induced by source paper "hyper molecules on the representation and recovery of dynamical structures with application to flexible macro molecular structures in cryo em"):
  with members:
    - "continuously heterogeneous hyper objects in cryo em and 3 d movies of many temporal dimensions"
    - "a representation theory perspective on simultaneous alignment and classification"
    - "covariance estimation using conjugate gradient for 3d classification in cryo em"

Connected through hyperedge HE-4 (induced by source paper "spectral methods from tensor networks"):
  with members:
    - "message passing algorithms for synchronization problems over compact groups"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "message passing algorithms for synchronization problems over compact groups"):
  with members:
    - "finite sample analysis of approximate message passing algorithms"
    - "the projected power method an efficient algorithm for joint alignment from pairwise differences"
    - "mutual information in rank one matrix estimation"
    - "mutual information for symmetric rank one matrix estimation a proof of the replica formula"
    - "phase transitions in sparse pca"
    - "mmse of probabilistic low rank matrix estimation universality with respect to the output channel"
    - "semidefinite programs on sparse random graphs and their application to community detection"
    - "information theoretically optimal sparse pca"

Connected through hyperedge HE-6 (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"
    - "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-7 (induced by source paper "fourier phase retrieval uniqueness and algorithms"):
  with members:
    - "message passing algorithms for synchronization problems over compact groups"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "the sample complexity of multi reference alignment"):
  with members:
    - "bispectrum inversion with application to multireference alignment"
    - "multireference alignment is easier with an aperiodic translation distribution"
    - "sample complexity of the boolean multireference alignment problem"
    - "a representation theory perspective on simultaneous alignment and classification"
    - "fundamental limits in multi image alignment"
    - "multireference alignment using semidefinite programming"
    - "fourier pca and robust tensor decomposition"
    - "settling the polynomial learnability of mixtures of gaussians"

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)