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 "oblivious fronthaul constrained relay for a gaussian channel"):
  Abstract: We consider systems in which the transmitter conveys messages to the receiver through a capacity-limited relay station. The channel between the transmitter and the relay-station is assumed to be a frequency selective additive Gaussian noise channel. It is assumed that the transmitter can shape the spectrum and adapt the coding technique so as to optimize performance. The relay operation is oblivious (nomadic transmitters), that is, the specific codebooks used are unknown. We find the reliable information rate that can be achieved with Gaussian signaling in this setting, and to that end, employ Gaussian bottleneck results combined with Shannon's incremental frequency approach. We also prove that, unlike classical water-pouring, the allocated spectrum (power and bit-rate) of the optimal solution could frequently be discontinuous. These results can be applied to a MIMO transmission scheme. We also investigate the case of an entropy limited relay. We present lower and upper bounds on the optimal performance (in terms of mutual information), and derive an analytical approximation.

Includes members:
  Member "fundamental distortion limits of analog to digital compression":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gaussian approximation of quantization error for estimation from compressed data")
  Member "distortion rate function of sub nyquist sampled gaussian sources":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analog to digital compression a new paradigm for converting signals to bits")
  Member "oblivious processing in a fronthaul constrained gaussian channel":
    also connected through other hyperedges:
      (none)
  Member "remarks on the most informative function conjecture at fixed mean":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "guessing with a bit of help")
  Member "lower bounds and approximations for the information rate of the isi channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "comparison of the achievable rates in ofdm and single carrier modulation with i i d inputs")
  Member "on the capacity of the dither quantized gaussian channel":
    also connected through other hyperedges:
      (none)
  Member "shannon meets nyquist capacity of sampled gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the capacity of memoryless channels with sampled cyclostationary gaussian noise")
  Member "capacity of the discrete time awgn channel under output quantization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "new equivalent model of quantizer with noisy input and its application for adc resolution determination in an uplink mimo receiver")

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)