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 two user gaussian interference channel a deterministic view"
  Abstract: This paper explores the two-user Gaussian interference channel through the lens of a natural deterministic channel model. The main result is that the deterministic channel uniformly approximates the Gaussian channel, the capacity regions differing by a universal constant. The problem of finding the capacity of the Gaussian channel to within a constant error is therefore reduced to that of finding the capacity of the far simpler deterministic channel. Thus, the paper provides an alternative derivation of the recent constant gap capacity characterization of Etkin, Tse, and Wang. Additionally, the deterministic model gives significant insight towards the Gaussian channel.

Connected through hyperedge HE-1 (induced by source paper "dof region of the decentralized mimo broadcast channel unicode x2014 how many informed antennas do we need"):
  with members:
    - "sum set inequalities from aligned image sets instruments for robust gdof bounds"
    - "achievable dof regions of mimo networks with imperfect csit"
    - "on the degrees of freedom of the k user distributed broadcast channel"
    - "degrees of freedom of the two user mimo broadcast channel with private and common messages under hybrid csit models"
    - "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit"
    - "sum capacity of interference channels with a local view impact of distributed decisions"
    - "completely stale transmitter channel state information is still very useful"

Connected through hyperedge HE-2 (induced by source paper "on the optimality of treating inter cell interference as noise downlink cellular networks and uplink downlink duality"):
  with members:
    - "towards an extremal network theory robust gdof gain of transmitter cooperation over tin"
    - "on the optimality of treating interference as noise for interfering multiple access channels"
    - "on the optimality of treating inter cell interference as noise in uplink cellular networks"
    - "opportunistic treating interference as noise"
    - "optimality of treating interference as noise a combinatorial perspective"
    - "on the optimality of treating interference as noise compound interference networks"
    - "on the optimality of treating interference as noise general message sets"
    - "on the optimality of treating interference as noise for k user parallel gaussian interference networks"

Connected through hyperedge HE-3 (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-4 (induced by source paper "on the gaussian multiple access wiretap channel and the gaussian wiretap channel with a helper achievable schemes and upper bounds"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "on the deterministic sum capacity of the multiple access wiretap channel"
    - "on multiuser gain and the constant gap sum capacity of the gaussian interfering multiple access channel"
    - "secure degrees of freedom of the multiple access wiretap channel with multiple antennas"
    - "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"
    - "secure degrees of freedom of the gaussian diamond wiretap channel"
    - "finite snr regime analysis of the gaussian wiretap multiple access channel"
    - "secure degrees of freedom of one hop wireless networks"

Connected through hyperedge HE-5 (induced by source paper "on the dof of parallel miso bcs with partial csit total order and separability"):
  with members:
    - "sum set inequalities from aligned image sets instruments for robust gdof bounds"
    - "optimal dof region of the k user miso bc with partial csit"
    - "elevated multiplexing and signal space partitioning in the 2 user mimo ic with partial csit"
    - "sum rate maximization for linearly precoded downlink multiuser miso systems with partial csit a rate splitting approach"
    - "gdof of the k user symmetric miso bc bridging the gap between finite precision and perfect csit"
    - "miso networks with imperfect csit a topological rate splitting approach"
    - "miso broadcast channel with hybrid csit beyond two users"
    - "gdof of the miso bc bridging the gap between finite precision and perfect csit"

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 "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"):
  with members:
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "mimo broadcast channel with an unknown eavesdropper secrecy degrees of freedom"
    - "aligned image sets under channel uncertainty settling a conjecture by lapidoth shamai and wigger on the collapse of degrees of freedom under finite precision csit"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "wireless network information flow a deterministic approach"
    - "interference alignment for secrecy"
    - "interference assisted secret communication"

Connected through hyperedge HE-8 (induced by source paper "on the deterministic sum capacity of the multiple access wiretap channel"):
  with members:
    - "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"
    - "secure degrees of freedom of one hop wireless networks"
    - "enabling the multi user generalized degrees of freedom in the gaussian cellular channel"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "a deterministic approach to wireless relay networks"

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)