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: "comparison of the achievable rates in ofdm and single carrier modulation with i i d inputs"
  Abstract: We compare the maximum achievable rates in single-carrier (SC) and orthogonal frequency-division multiplexing (OFDM) modulation schemes, under the practical assumptions of independent identically distributed finite alphabet inputs and linear intersymbol interference with additive Gaussian noise. We show that the Shamai-Laroia approximation serves as a bridge between the two rates: while it is well known that this approximation is often a lower bound on the SC achievable rate, it is revealed to also essentially upper bound the OFDM achievable rate. We apply information-estimation relations in order to rigorously establish this result for both general input distributions and to sharpen it for commonly used pulse-amplitude modulation (PAM) and quadratic-amplitude modulation constellations. To this end, novel bounds on minimum mean-square error estimation of PAM inputs to a scalar Gaussian channel are derived, which may be of general interest. Our results show that, under reasonable assumptions, optimal SC schemes may offer spectral efficiency significantly superior to that of OFDM, motivating further research of such systems.

Connected through hyperedge HE-1 (induced by source paper "orthogonal time frequency space modulation"):
  with members:
    - "on otfs modulation for high doppler fading channels"
    - "a simple two stage equalizer with simplified orthogonal time frequency space modulation over rapidly time varying channels"
    - "low complexity equalization for orthogonal time and frequency signaling otfs"
    - "analysis of discrete time mimo ofdm based orthogonal time frequency space modulation"
    - "orthogonal precoding for ultra reliable wireless communication links"
    - "low complexity modem structure for ofdm based orthogonal time frequency space modulation"
    - "otfs orthogonal time frequency space"
    - "what will 5g be"

Connected through hyperedge HE-2 (induced by source paper "on the capacity of narrowband plc channels"):
  with members:
    - "for the grid and through the grid the role of power line communications in the smart grid"

Connected through hyperedge HE-3 (induced by source paper "lower bounds and approximations for the information rate of the isi channel"):
  with members:
    - "easily computed lower bounds on the information rate of intersymbol interference channels"
    - "estimation in gaussian noise properties of the minimum mean square error"
    - "a coordinate system for gaussian networks"
    - "optimization of information rate upper and lower bounds for channels with memory"
    - "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)