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: "the gaussian channel with noisy feedback improving reliability via interaction"
  Abstract: Consider a pair of terminals connected by two independent (feedforward and feedback) Additive White Gaussian Noise (AWGN) channels, and limited by individual power constraints. The first terminal would like to reliably send information to the second terminal at a given rate. While the reliability in the cases of no feedback and of noiseless feedback is well studied, not much is known about the case of noisy feedback. In this work, we present an interactive scheme that significantly improves the reliability relative to the no-feedback setting, whenever the feedback Signal to Noise Ratio (SNR) is sufficiently larger than the feedforward SNR. The scheme combines Schalkwijk-Kailath (S-K) coding and modulo--lattice analog transmission.

Connected through hyperedge HE-1 (induced by source paper "achievable error exponents of one way and two way awgn channels"):
  with members:
    - "gaussian channel with noisy feedback and peak energy constraint"
    - "error exponents for the gaussian channel with active noisy feedback"
    - "error exponents for variable length block codes with feedback and cost constraints"

Connected through hyperedge HE-2 (induced by source paper "interactive schemes for the awgn channel with noisy feedback"):
  with members:
    - "the gaussian channel with noisy feedback near capacity performance via simple interaction"
    - "gaussian channel with noisy feedback and peak energy constraint"
    - "variations on a theme by schalkwijk and kailath"
    - "error exponents for the gaussian channel with active noisy feedback"
    - "optimal feedback communication via posterior matching"
    - "concatenated coding for the awgn channel with noisy feedback"
    - "joint wyner ziv dirty paper coding by modulo lattice modulation"

Connected through hyperedge HE-3 (induced by source paper "the awgn bc with mac feedback a reduction to noiseless feedback via interaction"):
  with members:
    - "the gaussian channel with noisy feedback near capacity performance via simple interaction"
    - "mimo mac bc duality with linear feedback coding schemes"
    - "an achievable rate region for the broadcast channel with feedback"
    - "lqg control approach to gaussian broadcast channels with feedback"
    - "on the capacity of the discrete memoryless broadcast channel with feedback"
    - "joint wyner ziv dirty paper coding by modulo lattice modulation"

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)