human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "lower bounds and approximations for the information rate of the isi channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "oblivious fronthaul constrained relay for a gaussian channel")
  Member "high snr asymptotics of mutual information for discrete constellations with applications to bicm":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "introducing enumerative sphere shaping for optical communication systems with short blocklengths")
  Member "comparison of ofdm and sc dfe capacities without channel knowledge at the transmitter":
    also connected through other hyperedges:
      (none)
  Member "easily computed lower bounds on the information rate of intersymbol interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lower bounds and approximations for the information rate of the isi channel")
  Member "spatially coupled codes and threshold saturation on intersymbol interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a simple proof of maxwell saturation for coupled scalar recursions")
  Member "estimation in gaussian noise properties of the minimum mean square error":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "compressed coding amp based decoding and analog spatial coupling")
  Member "hessian and concavity of mutual information differential entropy and entropy power in linear vector gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the geometry of community detection via the mmse matrix")
  Member "mutual information and minimum mean square error in gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")

Question: Please tell me which class the source paper 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)