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: "error exponents for the gaussian channel with active noisy feedback"
  Abstract: We study the best exponential decay in the blocklength of the probability of error that can be achieved in the transmission of a single bit over the Gaussian channel with an active noisy Gaussian feedback link. We impose an \emph{expected} block power constraint on the forward link and study both \emph{almost-sure} and \emph{expected} block power constraints on the feedback link. In both cases the best achievable error exponents are finite and grow approximately proportionally to the larger between the signal-to-noise ratios on the forward and feedback links. The error exponents under almost-sure block power constraints are typically strictly smaller than under expected constraints. Some of the results extend to communication at arbitrary rates below capacity and to general discrete memoryless channels.

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

Connected through hyperedge HE-2 (induced by source paper "on the reliability function of the common message broadcast channel with variable length feedback"):
  with members:
    - "common message broadcast channels with feedback in the nonasymptotic regime full feedback"
    - "on awgn channels and gaussian macs with variable length feedback"
    - "on gaussian macs with variable length feedback and non vanishing error probabilities"
    - "variable length coding with stop feedback for the common message broadcast channel in the nonasymptotic regime"
    - "on gaussian channels with feedback under expected power constraints and with non vanishing error probabilities"
    - "on using feedback in a gaussian channel"
    - "broadcasting a common message with variable length stop feedback codes"
    - "opportunistic capacity and error exponent regions for compound channel with feedback"

Connected through hyperedge HE-3 (induced by source paper "interactive schemes for the awgn channel with noisy feedback"):
  with members:
    - "the gaussian channel with noisy feedback improving reliability via interaction"
    - "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"
    - "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-4 (induced by source paper "the gaussian channel with noisy feedback improving reliability via interaction"):
  with members:
    - "the gaussian channel with noisy feedback near capacity performance via simple interaction"
    - "optimal feedback communication via posterior matching"
    - "joint wyner ziv dirty paper coding by modulo lattice modulation"

Connected through hyperedge HE-5 (induced by source paper "information friction and its implications on minimum energy required for communication"):
  with members:
    - "the hot bit i the szilard landauer correspondence"
    - "towards a communication theoretic understanding of system level power consumption"

Connected through hyperedge HE-6 (induced by source paper "low latency communications"):
  with members:
    - "reliability bounds for delay constrained multi hop networks"

Connected through hyperedge HE-7 (induced by source paper "errors and erasures decoding for block codes with feedback"):
  with members:
    - "variations on a theme by schalkwijk and kailath"
    - "achievable error exponents for channel with side information erasure and list decoding"
    - "a simple converse of burnashev s reliability function"
    - "a neyman pearson approach to universal erasure and list decoding"
    - "error exponents for variable length block codes with feedback and cost constraints"
    - "error exponents of erasure list decoding revisited via moments of distance enumerators"
    - "on the error exponents of arq channels with deadlines"

Connected through hyperedge HE-8 (induced by source paper "aligned interference neutralization and the degrees of freedom of the 2x2x2 interference channel"):
  with members:
    - "distributed data storage with minimum storage regenerating codes exact and functional repair are asymptotically equally efficient"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "sum capacity and the unique separability of the parallel gaussian mac z bc network"
    - "capacity bounds for two hop interference networks"
    - "real interference alignment with real numbers"
    - "on the degrees of freedom of the k user gaussian interference channel"
    - "on the sum capacity of a class of cyclically symmetric deterministic interference channels"
    - "ergodic interference alignment"

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)