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 "the gaussian channel with noisy feedback near capacity performance via simple interaction"):
  Abstract: Consider a pair of terminals connected by two independent additive white Gaussian noise channels, and limited by individual power constraints. The first terminal would like to reliably send information to the second terminal, within a given error probability. We construct an explicit interactive scheme consisting of only (non-linear) scalar operations, by endowing the Schalkwijk-Kailath noiseless feedback scheme with modulo arithmetic. Our scheme achieves a communication rate close to the Shannon limit, in a small number of rounds. For example, for an error probability of $10^{-6}$, if the Signal to Noise Ratio ($\mathrm{SNR}$) of the feedback channel exceeds the $\mathrm{SNR}$ of the forward channel by $20\mathrm{dB}$, our scheme operates $0.8\mathrm{dB}$ from the Shannon limit with only $19$ rounds of interaction. In comparison, attaining the same performance using state of the art Forward Error Correction (FEC) codes requires two orders of magnitude increase in delay and complexity. On the other extreme, a minimal delay uncoded system with the same error probability is bounded away by $9\mathrm{dB}$ from the Shannon limit.

Includes members:
  Member "on reliability function of bsc with noisy feedback":
    also connected through other hyperedges:
      (none)
  Member "optimal feedback communication via posterior matching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "feedback channel communication with low precision arithmetic")
  Member "concatenated coding for the awgn channel with noisy feedback":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "feedback channel communication with low precision arithmetic")

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)