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: "any positive feedback rate increases the capacity of strictly less noisy broadcast channels"
  Abstract: We propose two coding schemes for discrete memoryless broadcast channels (DMBCs) with rate-limited feedback from only one receiver. For any positive feedback rate and for the class of strictly less-noisy DMBCs, our schemes strictly improve over the no-feedback capacity region.

Connected through hyperedge HE-1 (induced by source paper "on the noisy feedback capacity of gaussian broadcast channels"):
  with members:
    - "mimo mac bc duality with linear feedback coding schemes"
    - "an achievable rate region for the broadcast channel with feedback"
    - "on the capacity of the discrete memoryless broadcast channel with feedback"

Connected through hyperedge HE-2 (induced by source paper "mimo mac bc duality with linear feedback coding schemes"):
  with members:
    - "the awgn bc with mac feedback a reduction to noiseless feedback via interaction"
    - "on the noisy feedback capacity of gaussian broadcast channels"
    - "on the ozarow leung scheme for the gaussian broadcast channel with feedback"
    - "insufficiency of linear feedback schemes in gaussian broadcast channels with common message"
    - "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"

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)