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: "heterogeneous multireference alignment a single pass approach"
  Abstract: Multireference alignment (MRA) is the problem of estimating a signal from many noisy and cyclically shifted copies of itself. In this paper, we consider an extension called heterogeneous MRA, where $K$ signals must be estimated, and each observation comes from one of those signals, unknown to us. This is a simplified model for the heterogeneity problem notably arising in cryo-electron microscopy. We propose an algorithm which estimates the $K$ signals without estimating either the shifts or the classes of the observations. It requires only one pass over the data and is based on low-order moments that are invariant under cyclic shifts. Given sufficiently many measurements, one can estimate these invariant features averaged over the $K$ signals. We then design a smooth, non-convex optimization problem to compute a set of signals which are consistent with the estimated averaged features. We find that, in many cases, the proposed approach estimates the set of signals accurately despite non-convexity, and conjecture the number of signals $K$ that can be resolved as a function of the signal length $L$ is $\sim \sqrt{L}$.

Connected through hyperedge HE-1 (induced by source paper "harmonic alignment"):
  with members:
    - "magan aligning biological manifolds"
    - "geometry based data generation"
    - "product manifold filter non rigid shape correspondence via kernel density estimation in the product space"
    - "learning to discover cross domain relations with generative adversarial networks"
    - "unpaired image to image translation using cycle consistent adversarial networks"
    - "the emerging field of signal processing on graphs extending high dimensional data analysis to networks and other irregular domains"

Connected through hyperedge HE-2 (induced by source paper "computational hardness of certifying bounds on constrained pca problems"):
  with members:
    - "mean field approximation convex hierarchies and the optimality of correlation rounding a unified perspective"
    - "community detection in hypergraphs spiked tensor models and sum of squares"
    - "the lov asz theta function for random regular graphs and community detection in the hard regime"
    - "the power of sum of squares for detecting hidden structures"
    - "bayesian estimation from few samples community detection and related problems"
    - "sum of squares lower bounds for refuting any csp"
    - "a nearly tight sum of squares lower bound for the planted clique problem"
    - "mutual information in rank one matrix estimation"

Connected through hyperedge HE-3 (induced by source paper "multi target detection with application to cryo electron microscopy"):
  with members:
    - "multi target detection with an arbitrary spacing distribution"
    - "toward single particle reconstruction without particle picking breaking the detection limit"
    - "bispectrum inversion with application to multireference alignment"
    - "fourier phase retrieval uniqueness and algorithms"
    - "the sample complexity of multi reference alignment"
    - "multireference alignment is easier with an aperiodic translation distribution"
    - "rapid robust and reliable blind deconvolution via nonconvex optimization"
    - "fundamental limits in multi image alignment"

Connected through hyperedge HE-4 (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"
    - "multireference alignment is easier with an aperiodic translation distribution"

Connected through hyperedge HE-5 (induced by source paper "multi target detection with an arbitrary spacing distribution"):
  with members:
    - "multi target detection with application to cryo electron microscopy"
    - "toward single particle reconstruction without particle picking breaking the detection limit"
    - "bispectrum inversion with application to multireference alignment"
    - "fundamental limits in multi image alignment"
    - "manopt a matlab toolbox for optimization on manifolds"

Connected through hyperedge HE-6 (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"
    - "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-7 (induced by source paper "toward single particle reconstruction without particle picking breaking the detection limit"):
  with members:
    - "bispectrum inversion with application to multireference alignment"
    - "anisotropic twicing for single particle reconstruction using autocorrelation analysis"
    - "steerable principal components for space frequency localized images"
    - "multireference alignment is easier with an aperiodic translation distribution"
    - "fast steerable principal component analysis"
    - "manopt a matlab toolbox for optimization on manifolds"

Connected through hyperedge HE-8 (induced by source paper "a representation theory perspective on simultaneous alignment and classification"):
  with members:
    - "message passing algorithms for synchronization problems over compact groups"
    - "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)