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 "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.

Includes members:
  Member "divide and conquer approaching the capacity of the two pair bidirectional gaussian relay network":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "degrees of freedom of the mimo three way channel with node intermittency")
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "dependence balance based outer bounds for gaussian networks with cooperation and feedback":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint state sensing and communication over memoryless multiple access channels")
  Member "interference channels with source cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "gdof of interference channel with limited cooperation under finite precision csit")
  Member "interference channels with destination cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "gdof of interference channel with limited cooperation under finite precision csit")
  Member "interference mitigation through limited transmitter cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "exploiting computation replication for mobile edge computing a fundamental computation communication tradeoff study")
  Member "the approximate capacity of the many to one and one to many gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "feedback capacity of the gaussian interference channel to within 2 bits":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "capacity limits of full duplex cellular network")

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)