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: "feedback capacity of the gaussian interference channel to within 2 bits"
  Abstract: We characterize the capacity region to within 2 bits/s/Hz and the symmetric capacity to within 1 bit/s/Hz for the two-user Gaussian interference channel (IC) with feedback. We develop achievable schemes and derive a new outer bound to arrive at this conclusion. One consequence of the result is that feedback provides multiplicative gain, i.e., the gain becomes arbitrarily large for certain channel parameters. It is a surprising result because feedback has been so far known to provide no gain in memoryless point-to-point channels and only bounded additive gain in multiple access channels. The gain comes from using feedback to maximize resource utilization, thereby enabling more efficient resource sharing between the interfering users. The result makes use of a deterministic model to provide insights into the Gaussian channel. This deterministic model is a special case of El Gamal-Costa deterministic model and as a side-generalization, we establish the exact feedback capacity region of this general class of deterministic ICs.

Connected through hyperedge HE-1 (induced by source paper "capacity limits of full duplex cellular network"):
  with members:
    - "resource allocation and rate gains in practical full duplex systems"
    - "fundamental limits of spectrum sharing full duplex multicell networks"
    - "opportunistic scheduling for full duplex uplink downlink networks"
    - "passive self interference suppression for full duplex infrastructure nodes"
    - "in band full duplex wireless challenges and opportunities"
    - "bilayer low density parity check codes for decode and forward in relay channels"
    - "gaussian interference channel capacity to within one bit"
    - "rate regions for relay broadcast channels"

Connected through hyperedge HE-2 (induced by source paper "two way function computation"):
  with members:
    - "two way interference channel capacity how to have the cake and eat it too"
    - "feedback through overhearing"
    - "capacity of a post channel with and without feedback"
    - "perfect output feedback in the two user decentralized interference channel"
    - "computation in multicast networks function alignment and converse theorems"
    - "two way interference channels"
    - "on network coding for sum networks"
    - "two way networks when adaptation is useless"

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"
    - "interference channels with rate limited feedback"
    - "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 nash region of the gaussian interference channel with noisy output feedback"):
  with members:
    - "nash region of the linear deterministic interference channel with noisy output feedback"
    - "perfect output feedback in the two user decentralized interference channel"
    - "shannon meets nash on the interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-5 (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-6 (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-7 (induced by source paper "on continuous time gaussian channels"):
  with members:
    - "upper and lower bounds on the capacity of amplitude constrained mimo channels"
    - "recent results in continuous time network information theory"
    - "wireless network information flow a deterministic approach"
    - "limit theorems in hidden markov models"
    - "directed information causal estimation and communication in continuous time"
    - "on the gaussian mac with imperfect feedback"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"

Connected through hyperedge HE-8 (induced by source paper "nash region of the linear deterministic interference channel with noisy output feedback"):
  with members:
    - "approximate capacity of the gaussian interference channel with noisy channel output feedback"
    - "perfect output feedback in the two user decentralized interference channel"
    - "shannon meets nash on the interference channel"
    - "the two user gaussian interference channel a deterministic view"

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)