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: "interference channels with rate limited feedback"
  Abstract: We consider the two-user interference channel with rate-limited feedback. Related prior works focus on the case where feedback links have infinite capacity, while no research has been done for the rate-limited feedback problem. Several new challenges arise due to the capacity limitations of the feedback links, both in deriving inner-bounds and outer-bounds. We study this problem under three different interference models: the El Gamal-Costa deterministic model, the linear deterministic model, and the Gaussian model. For the first two models, we develop an achievable scheme that employs three techniques: Han-Kobayashi message splitting, quantize-and-binning, and decode-and-forward. We also derive new outer-bounds for all three models and we show the optimality of our scheme under the linear deterministic model. In the Gaussian case, we propose a transmission strategy that incorporates lattice codes, inspired by the ideas developed in the first two models. For symmetric channel gains, we prove that the gap between the achievable sum-rate of the proposed scheme and our new outer-bounds is bounded by a constant number of bits, independent of the channel gains.

Connected through hyperedge HE-1 (induced by source paper "capacity results for intermittent x channels with delayed channel state feedback"):
  with members:
    - "capacity region of erasure broadcast channels with common message and feedback"
    - "throughput region of spatially correlated interference packet networks"
    - "two user erasure interference channels with local delayed csit"
    - "capacity results for binary fading interference channels with delayed csit"
    - "communication through collisions opportunistic utilization of past receptions"
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "topological interference management with alternating connectivity"
    - "wireless network information flow a deterministic approach"

Connected through hyperedge HE-2 (induced by source paper "capacity results for finite field x channels with delayed csit"):
  with members:
    - "throughput region of spatially correlated interference packet networks"
    - "two user erasure interference channels with local delayed csit"
    - "capacity results for binary fading interference channels with delayed csit"
    - "communication through collisions opportunistic utilization of past receptions"
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "topological interference management with alternating connectivity"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (induced by source paper "on the generalized degrees of freedom of noncoherent interference channel"):
  with members:
    - "approximate capacity of fast fading interference channels with no instantaneous csit"
    - "on noncoherent fading relay channels at high signal to noise ratio"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "approximately achieving gaussian relay network capacity with lattice codes"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-4 (induced by source paper "approximate capacity of fast fading interference channels with no instantaneous csit"):
  with members:
    - "cooperation for interference management a gdof perspective"
    - "capacity bounds for a class of interference relay channels"
    - "capacity results for binary fading interference channels with delayed csit"
    - "ergodic interference alignment with delayed feedback"
    - "degrees of freedom region of the mimo interference channel with output feedback and delayed csit"
    - "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit"
    - "wireless network information flow a deterministic approach"
    - "ergodic fading interference channels sum capacity and separability"

Connected through hyperedge HE-5 (induced by source paper "two way interference channel capacity how to have the cake and eat it too"):
  with members:
    - "two way function computation"
    - "fundamental limits of caching"
    - "computation in multicast networks function alignment and converse theorems"
    - "two way interference channels"
    - "approximate feedback capacity of the gaussian multicast channel"
    - "two way networks when adaptation is useless"
    - "wireless network information flow a deterministic approach"
    - "interference channels with source cooperation"

Connected through hyperedge HE-6 (induced by source paper "three way channels with multiple unicast sessions capacity approximation via network transformation"):
  with members:
    - "device relaying in cellular d2d networks a fairness perspective"
    - "a survey on device to device communication in cellular networks"
    - "mimo multiway relaying with pairwise data exchange a degrees of freedom perspective"
    - "the degrees of freedom of multi way device to device communications is limited by 2"
    - "approximate sum capacity of the y channel"
    - "degrees of freedom for the mimo multi way relay channel"
    - "the deterministic multicast capacity of 4 node relay networks"
    - "in band full duplex wireless challenges and opportunities"

Connected through hyperedge HE-7 (induced by source paper "on the symmetric k user interference channels with limited feedback"):
  with members:
    - "degrees of freedom of the rank deficient interference channel with feedback"
    - "asymmetric compute and forward with csit"
    - "capacity of all nine models of channel output feedback for the two user interference channel"
    - "on the capacity region and the generalized degrees of freedom region for the mimo interference channel with feedback"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "wireless network information flow a deterministic approach"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "on channel output feedback in deterministic interference channels"

Connected through hyperedge HE-8 (induced by source paper "on the capacity regions of two way diamond channels"):
  with members:
    - "on the symmetric k user interference channels with limited feedback"
    - "on the capacity and degrees of freedom regions of two user mimo interference channels with limited receiver cooperation"
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "nested lattice codes for gaussian two way relay channels"
    - "lattice coding for the two way two relay channel"
    - "the gaussian two way diamond channel"
    - "on the capacity region and the generalized degrees of freedom region for the mimo interference channel with feedback"
    - "divide and conquer approaching the capacity of the two pair bidirectional gaussian relay network"

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)