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 "insufficiency of linear feedback schemes in gaussian broadcast channels with common message"):
  Abstract: We consider the K 2-user memoryless Gaussian broadcast channel (BC) with feedback and common message only. We show that linear-feedback schemes with a message point, in the spirit of Schalkwijk&Kailath’s scheme for point-to-point channels or Ozarow&Leung’s scheme for BCs with private messages, are strictly suboptimal for this setup. Even with perfect feedback, the largest rate achieved by these schemes is strictly smaller than capacity C (which is the same with and without feedback). In the extreme case where the number of receivers K ! 1, the largest rate achieved by linear-feedback schemes with a message point tends to 0. To contrast this negative result, we describe a scheme for rate-limited feedback that uses the feedback in an intermittent way, i.e., the receivers send feedback signals only in few channel uses. This scheme achieves all rates R up to capacity C with an L-th order exponential decay of the probability of error if the feedback rate Rfb is at least (L 1)R for some positive integer L.

Includes members:
  Member "lqg control approach to gaussian broadcast channels with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "youla coding and computation of gaussian feedback capacity")
  Member "feedback can double the prelog of some memoryless gaussian networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an achievable rate region for the broadcast channel with feedback")
  Member "variations on a theme by schalkwijk and kailath":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "feedback channel communication with low precision arithmetic")
  Member "achievable error exponents in the gaussian channel with rate limited feedback":
    also connected through other hyperedges:
      (none)
  Member "feedback capacity of stationary gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "capacity of continuous channels with memory via directed information neural estimator")

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)