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 "on constant gaps for the two way gaussian interference channel"):
  Abstract: We introduce the two-way Gaussian interference channel in which there are four nodes with four independent messages: two-messages to be transmitted over a Gaussian interference channel in the $\rightarrow$ direction, simultaneously with two-messages to be transmitted over an interference channel (in-band, full-duplex) in the $\leftarrow$ direction. In such a two-way network, all nodes are transmitters and receivers of messages, allowing them to adapt current channel inputs to previously received channel outputs. We propose two new outer bounds on the symmetric sum-rate for the two-way Gaussian interference channel with complex channel gains: one under full adaptation (all 4 nodes are permitted to adapt inputs to previous outputs), and one under partial adaptation (only 2 nodes are permitted to adapt, the other 2 are restricted). We show that simple non-adaptive schemes such as the Han and Kobayashi scheme, where inputs are functions of messages only and not past outputs, utilized in each direction are sufficient to achieve within a constant gap of these fully or partially adaptive outer bounds for all channel regimes.

Includes members:
  Member "two way interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "two way function computation")
  Member "two way networks when adaptation is useless":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "classes of full duplex channels with capacity achieved without adaptation")
  Member "interference channels with rate limited feedback":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity results for intermittent x channels with delayed channel state feedback")
  Member "feedback capacity of the gaussian interference channel to within 2 bits":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "capacity limits of full duplex cellular network")
  Member "on channel output feedback in deterministic interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "two way interference channel capacity how to have the cake and eat it too")
  Member "the two user gaussian interference channel a deterministic view":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "dof region of the decentralized mimo broadcast channel unicode x2014 how many informed antennas do we need")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)