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: "bounds on the achievable rate of noisy feedback gaussian channels under linear feedback coding scheme"
  Abstract: In this paper, we investigate the additive Gaussian noise channel with noisy feedback. We consider the setup of linear coding of the feedback information and Gaussian signaling of the message (i.e. Cover-Pombra Scheme). Then, we derive the upper and lower bounds on the largest achievable rate for this setup. We show that these two bounds can be obtained by solving two convex optimization problems. Finally, we present some simulations and discussion.

Connected through hyperedge HE-1 (induced by source paper "youla coding and computation of gaussian feedback capacity"):
  with members:
    - "control approach to computing the feedback capacity for stationary finite dimensional gaussian channels"
    - "upper bound on the capacity of gaussian channels with noisy feedback"
    - "lqg control approach to gaussian broadcast channels with feedback"
    - "interpretations of directed information in portfolio theory data compression and hypothesis testing"
    - "optimal feedback communication via posterior matching"
    - "convergence of fundamental limitations in feedback communication estimation and feedback control over gaussian channels"
    - "on the feedback capacity of power constrained gaussian noise channels with memory"
    - "a coding theorem for a class of stationary channels with feedback"

Connected through hyperedge HE-2 (induced by source paper "control approach to computing the feedback capacity for stationary finite dimensional gaussian channels"):
  with members:
    - "upper bound on the capacity of gaussian channels with noisy feedback"
    - "interpretations of directed information in portfolio theory data compression and hypothesis testing"
    - "optimal feedback communication via posterior matching"
    - "convergence of fundamental limitations in feedback communication estimation and feedback control over gaussian channels"
    - "on the feedback capacity of power constrained gaussian noise channels with memory"
    - "a coding theorem for a class of stationary channels with feedback"
    - "feedback capacity of stationary gaussian channels"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-3 (induced by source paper "information flow decompositions in feedback systems general case study"):
  with members:
    - "interpretations of directed information in portfolio theory data compression and hypothesis testing"
    - "a coding theorem for a class of stationary channels with feedback"
    - "finite state channels with time invariant deterministic feedback"
    - "feedback capacity of stationary gaussian channels"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-4 (induced by source paper "information flow decomposition in feedback systems linear time invariant systems with gaussian channels"):
  with members:
    - "a coding theorem for a class of stationary channels with feedback"
    - "finite state channels with time invariant deterministic feedback"
    - "feedback capacity of stationary gaussian channels"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-5 (induced by source paper "an information identity for state dependent channels with feedback"):
  with members:
    - "a coding theorem for a class of stationary channels with feedback"
    - "finite state channels with time invariant deterministic feedback"
    - "feedback capacity of stationary gaussian channels"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-6 (induced by source paper "upper bound on the capacity of gaussian channels with noisy feedback"):
  with members:
    - "the information flow and capacity of channels with noisy feedback"
    - "concatenated coding for the awgn channel with noisy feedback"
    - "feedback capacity of stationary gaussian channels"
    - "the capacity of channels with feedback"

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)