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: "an iterative receiver for ofdm with sparsity based parametric channel estimation"
  Abstract: In this paper, we design a receiver that iteratively passes soft information between the channel estimation and data decoding stages. The receiver incorporates sparsity-based parametric channel estimation. State-of-the-art sparsity-based iterative receivers simplify the channel estimation problem by restricting the multipath delays to a grid. Our receiver does not impose such a restriction. As a result, it does not suffer from the leakage effect, which destroys sparsity. Communication at near capacity rates in high SNR requires a large modulation order. Due to the close proximity of modulation symbols in such systems, the grid-based approximation is of insufficient accuracy. We show numerically that a state-of-the-art iterative receiver with grid-based sparse channel estimation exhibits a bit-error-rate floor in the high SNR regime. On the contrary, our receiver performs very close to the perfect channel state information bound for all SNR values. We also demonstrate both theoretically and numerically that parametric channel estimation works well in dense channels, i.e., when the number of multipath components is large and each individual component cannot be resolved.

Connected through hyperedge HE-1 (induced by source paper "expectation propagation line spectral estimation"):
  with members:
    - "a unified bayesian inference framework for generalized linear models"
    - "bilinear adaptive generalized vector approximate message passing"
    - "sparse methods for direction of arrival estimation"
    - "multi snapshot newtonized orthogonal matching pursuit for line spectrum estimation with multiple measurement vectors"
    - "variational bayesian inference of line spectra"
    - "newtonized orthogonal matching pursuit frequency estimation over the continuum"
    - "off the grid line spectrum denoising and estimation with multiple measurement vectors"
    - "robust spectral compressed sensing via structured matrix completion"

Connected through hyperedge HE-2 (induced by source paper "variational bayesian inference of line spectral estimation with multiple measurement vectors"):
  with members:
    - "grid less variational bayesian inference of line spectral from quantized samples"
    - "newtonized orthogonal matching pursuit for line spectrum estimation with multiple measurement vectors"
    - "variational bayesian inference of line spectra"
    - "newtonized orthogonal matching pursuit frequency estimation over the continuum"
    - "off the grid line spectrum denoising and estimation with multiple measurement vectors"
    - "robust spectral compressed sensing via structured matrix completion"
    - "continuous compressed sensing with a single or multiple measurement vectors"
    - "enhancing sparsity and resolution via reweighted atomic norm minimization"

Connected through hyperedge HE-3 (induced by source paper "unifying message passing algorithms under the framework of constrained bethe free energy minimization"):
  with members:
    - "hybrid vector perturbation precoding the blessing of approximate message passing"
    - "random access in c ran for user activity detection with limited capacity fronthaul"
    - "a bp mf ep based iterative receiver for joint phase noise estimation equalization and decoding"
    - "gaussian message passing iterative detection for mimo noma systems with massive access"
    - "message passing receiver for joint channel estimation and decoding in 3d massive mimo ofdm systems"
    - "optimality of large mimo detection via approximate message passing"
    - "s amp approximate message passing for general matrix ensembles"
    - "expectation propagation for approximate bayesian inference"

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)