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: "lower bounds and approximations for the information rate of the isi channel"
  Abstract: We consider the discrete-time intersymbol interference (ISI) channel model, with additive Gaussian noise and fixed i.i.d. inputs. In this setting, we investigate the expression put forth by Shamai and Laroia as a conjectured lower bound for the input-output mutual information after application of a MMSE-DFE receiver. A low-SNR expansion is used to prove that the conjectured bound does not hold under general conditions, and to characterize inputs for which it is particularly ill-suited. One such input is used to construct a counterexample, indicating that the Shamai-Laroia expression does not always bound even the achievable rate of the channel, thus excluding a natural relaxation of the original conjectured bound. However, this relaxed bound is then shown to hold for any finite entropy input and ISI channel, when the SNR is sufficiently high. Finally, new simple bounds for the achievable rate are proven, and compared to other known bounds. Information-Estimation relations and estimation-theoretic bounds play a key role in establishing our results.

Connected through hyperedge HE-1 (induced by source paper "oblivious fronthaul constrained relay for a gaussian channel"):
  with members:
    - "fundamental distortion limits of analog to digital compression"
    - "distortion rate function of sub nyquist sampled gaussian sources"
    - "oblivious processing in a fronthaul constrained gaussian channel"
    - "remarks on the most informative function conjecture at fixed mean"
    - "on the capacity of the dither quantized gaussian channel"
    - "shannon meets nyquist capacity of sampled gaussian channels"
    - "capacity of the discrete time awgn channel under output quantization"
    - "distributed mimo receiver achievable rates and upper bounds"

Connected through hyperedge HE-2 (induced by source paper "comparison of the achievable rates in ofdm and single carrier modulation with i i d inputs"):
  with members:
    - "high snr asymptotics of mutual information for discrete constellations with applications to bicm"
    - "comparison of ofdm and sc dfe capacities without channel knowledge at the transmitter"
    - "easily computed lower bounds on the information rate of intersymbol interference channels"
    - "spatially coupled codes and threshold saturation on intersymbol interference channels"
    - "estimation in gaussian noise properties of the minimum mean square error"
    - "hessian and concavity of mutual information differential entropy and entropy power in linear vector gaussian channels"
    - "mutual information and minimum mean square error in gaussian channels"

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)