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 two user deterministic interference channel with rate limited feedback"
  Abstract: In this paper we study the effect of rate-limited feedback on the sum-rate capacity of the deterministic interference channel. We characterize the sum-rate capacity of this channel in the symmetric case and show that having feedback links can increase the sum-rate capacity by at most the rate of the available feedback. Our proof includes a novel upper-bound on the sum-rate capacity and a set of new achievability strategies.

Connected through hyperedge HE-1 (induced by source paper "capacity results for binary fading interference channels with delayed csit"):
  with members:
    - "two hop interference channels impact of linear schemes"
    - "binary fading interference channel with no csit"
    - "communication through collisions opportunistic utilization of past receptions"
    - "approximate capacity region of the two user miso broadcast channels with delayed csit"
    - "two hop interference channels impact of linear time varying schemes"
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "degrees of freedom region of the mimo interference channel with output feedback and delayed csit"
    - "degrees of freedom of two hop wireless networks everyone gets the entire cake"

Connected through hyperedge HE-2 (induced by source paper "an outer bound for the memoryless two user interference channel with general cooperation"):
  with members:
    - "two way interference channels"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "on the symmetric feedback capacity of the k user cyclic interference channel"
    - "dependence balance based outer bounds for gaussian networks with cooperation and feedback"
    - "a new sum rate outer bound for interference channels with three source destination pairs"
    - "interference channels with source cooperation"
    - "interference channels with rate limited feedback"
    - "interference channels with destination cooperation"

Connected through hyperedge HE-3 (induced by source paper "interference channels with rate limited feedback"):
  with members:
    - "divide and conquer approaching the capacity of the two pair bidirectional gaussian relay network"
    - "wireless network information flow a deterministic approach"
    - "dependence balance based outer bounds for gaussian networks with cooperation and feedback"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"
    - "interference mitigation through limited transmitter cooperation"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "feedback capacity of the gaussian interference channel to within 2 bits"

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)