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 capacity region of the mimo interference channel and its reciprocity to within a constant gap"
  Abstract: The capacity region of the 2-user multi-input multi-output (MIMO) Gaussian interference channel (IC) is characterized to within a constant gap that is independent of the channel matrices for the general case of the MIMO IC with an arbitrary number of antennas at each node. An achievable rate region and an outer bound to the capacity region of a class of interference channels were obtained in previous work by Telatar and Tse as unions over all possible input distributions. In contrast to that previous work on the MIMO IC, a simple and an explicit achievable coding scheme are obtained here and shown to have the constant-gap-to-capacity property and in which the sub-rates of the common and private messages of each user are explicitly specified for each achievable rate pair. The constant-gap-to-capacity results are thus proved in this work by first establishing explicit upper and lower bounds to the capacity region. A reciprocity result is also proved which is that the capacity of the reciprocal MIMO IC is within a constant gap of the capacity region of the forward MIMO IC.

Connected through hyperedge HE-1 (induced by source paper "towards an extremal network theory robust gdof gain of transmitter cooperation over tin"):
  with members:
    - "on multi cell uplink downlink duality with treating inter cell interference as noise"
    - "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit"
    - "on the optimality of treating inter cell interference as noise in uplink cellular networks"
    - "opportunistic treating interference as noise"
    - "k user symmetric m times n mimo interference channel under finite precision csit a gdof perspective"
    - "aligned image sets and the generalized degrees of freedom of symmetric mimo interference channel with partial csit"
    - "network coherence time matters aligned image sets and the degrees of freedom of interference networks with finite precision csit and perfect csir"
    - "elevated multiplexing and signal space partitioning in the 2 user mimo ic with partial csit"

Connected through hyperedge HE-2 (induced by source paper "approximate capacity region of the mac ic mac"):
  with members:
    - "enabling the multi user generalized degrees of freedom in the gaussian cellular channel"
    - "upper bounds and duality relations of the linear deterministic sum capacity for cellular systems"
    - "wireless network information flow a deterministic approach"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "on the capacity of the 2 user gaussian mac interfering with a p2p link"
    - "on the capacity of multiple access z interference channels"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (induced by source paper "a unified theory of multiple access and interference channels via approximate capacity regions for the mac ic mac"):
  with members:
    - "enabling the multi user generalized degrees of freedom in the gaussian cellular channel"
    - "upper bounds and duality relations of the linear deterministic sum capacity for cellular systems"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "on the capacity of the 2 user gaussian mac interfering with a p2p link"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-4 (induced by source paper "degrees of freedom of the mimo 2x2 interference network with general message sets"):
  with members:
    - "degrees of freedom region of the mimo x channel with an arbitrary number of antennas"
    - "degrees of freedom of the mimo interference channel with cooperation and cognition"
    - "interference channels with common information"

Connected through hyperedge HE-5 (induced by source paper "on the capacity and degrees of freedom regions of two user mimo interference channels with limited receiver cooperation"):
  with members:
    - "leveraging physical layer capabilites distributed scheduling in interference networks with local views"
    - "a survey on device to device communication in cellular networks"
    - "on the capacity region and the generalized degrees of freedom region for the mimo interference channel with feedback"
    - "fundamental limits of cooperation"
    - "on achieving local view capacity via maximal independent graph scheduling"
    - "multi user mimo with outdated csi training feedback and scheduling"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"

Connected through hyperedge HE-6 (induced by source paper "on the optimality of treating interference as noise general message sets"):
  with members:
    - "on the optimality of treating interference as noise"
    - "wireless network information flow a deterministic approach"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "a digital interface for gaussian relay and interference networks lifting codes from the discrete superposition model"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "the two user gaussian interference channel a deterministic view"

Connected through hyperedge HE-7 (induced by source paper "on the capacity region and the generalized degrees of freedom region for the mimo interference channel with feedback"):
  with members:
    - "capacity of all nine models of channel output feedback for the two user interference channel"
    - "sum capacity of interference channels with a local view impact of distributed decisions"
    - "fundamental limits of cooperation"
    - "on achieving local view capacity via maximal independent graph scheduling"
    - "multi user mimo with outdated csi training feedback and scheduling"
    - "interference channels with rate limited feedback"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"

Connected through hyperedge HE-8 (induced by source paper "the gdof of 3 user mimo gaussian interference channel"):
  with members:
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "the generalized degrees of freedom region of the mimo interference channel"
    - "on the generalized degrees of freedom of the k user symmetric mimo gaussian interference channel"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "the two user gaussian interference channel a deterministic view"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "gaussian interference channel capacity to within one bit"

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)