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: "gdof of the k user symmetric miso bc bridging the gap between finite precision and perfect csit"
  Abstract: We characterize the sum GDoF of the $K $ user symmetric MISO BC where the direct channels have strengths $\sim SNR$, cross channels have strengths $\sim SNR^{\alpha}$, and the channel estimation error terms have strengths $\sim SNR^{-\beta}$. This is a step towards the ultimate goal of unifying recent advances which focus exclusively on either the diversity of channel strengths ($\alpha$) or the channel uncertainty ($\beta$) aspect, and bridging the gap between the divergent extremes studied thus far where 1) cross-channels are either assumed to be as strong as direct channels ($\alpha=1$, as in DoF studies) or so weak (small $\alpha$) that they can be optimally treated as noise (TIN); or 2) where channel knowledge is assumed to be either absent $(\beta=0)$ or essentially perfect (large $\beta$). Restricting $\alpha\in[0,1]$ and without loss of generality $\beta\in[0,\alpha]$, it is shown that the $K$ user symmetric MISO BC has $(\alpha-\beta)+K(1-(\alpha-\beta))$ GDoF. A useful interpretation is that the power levels effectively split into a fraction $(\alpha-\beta)$ where CSIT is essentially absent (GDoF $=1$ per power level dimension), and the remaining $1-(\alpha-\beta)$ fraction where CSIT is essentially perfect (GDoF $=K$ per power level dimension). For $K=2$ users with arbitrary $\beta_{kl}$ parameters, the GDoF are shown to be $2-\alpha+\min_{k,l} \beta_{kl}$. Remarkably, the roles of $\alpha$ and $\beta$ counter each other on equal terms so that only their difference matters.

Connected through hyperedge HE-1 (induced by source paper "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit"):
  with members:
    - "towards an extremal network theory robust gdof gain of transmitter cooperation over tin"
    - "k user symmetric m times n mimo interference channel under finite precision csit a gdof perspective"
    - "sum set inequalities from aligned image sets instruments for robust gdof bounds"
    - "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"
    - "achievable dof regions of mimo networks with imperfect csit"
    - "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit"
    - "tdma is optimal for all unicast dof region of tim if and only if topology is chordal bipartite"

Connected through hyperedge HE-2 (induced by source paper "generalized degrees of freedom of the symmetric cache aided miso broadcast channel with partial csit"):
  with members:
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "fundamental limits on delivery time in cloud and cache aided heterogeneous networks"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "on the dof of parallel miso bcs with partial csit total order and separability"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "scalable content delivery with coded caching in multi antenna fading channels"
    - "on coded caching in the overloaded miso broadcast channel"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"

Connected through hyperedge HE-3 (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"
    - "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"
    - "dof analysis of the mimo broadcast channel with alternating hybrid csit"

Connected through hyperedge HE-4 (induced by source paper "k user symmetric m times n mimo interference channel under finite precision csit a gdof perspective"):
  with members:
    - "sum set inequalities from aligned image sets instruments for robust gdof bounds"
    - "aligned image sets and the generalized degrees of freedom of symmetric mimo interference channel with partial csit"
    - "gdof of the miso bc bridging the gap between finite precision and perfect csit"
    - "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit"
    - "the degrees of freedom of mimo interference channels without state information at transmitters"
    - "the degrees of freedom regions of mimo broadcast interference and cognitive radio channels with no csit"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-5 (induced by source paper "aligned image sets and the generalized degrees of freedom of symmetric mimo interference channel with partial csit"):
  with members:
    - "sum set inequalities from aligned image sets instruments for robust gdof bounds"
    - "elevated multiplexing and signal space partitioning in the 2 user mimo ic with partial csit"
    - "gdof of the miso bc bridging the gap between finite precision and perfect csit"
    - "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit"
    - "multilevel topological interference management"
    - "optimal use of current and outdated channel state information degrees of freedom of the miso bc with mixed csit"
    - "the degrees of freedom regions of mimo broadcast interference and cognitive radio channels with no csit"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-6 (induced by source paper "sum set inequalities from aligned image sets instruments for robust gdof bounds"):
  with members:
    - "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"
    - "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit"
    - "sumset and inverse sumset inequalities for differential entropy and mutual information"
    - "optimal use of current and outdated channel state information degrees of freedom of the miso bc with mixed csit"
    - "wireless network information flow a deterministic approach"
    - "gaussian interference channel capacity to within one bit"
    - "on the capacity of fading mimo broadcast channels with imperfect transmitter side information"

Connected through hyperedge HE-7 (induced by source paper "generalized degrees of freedom of the 2 user case miso broadcast channel with distributed csit"):
  with members:
    - "rate analysis of two receiver miso broadcast channel with finite rate feedback a rate splitting approach"
    - "spatial csit allocation policies for network mimo channels"
    - "fundamental limits of caching"
    - "interference alignment with incomplete csit sharing"
    - "the multiplexing gain of a two cell mimo channel with unequal csi"
    - "gaussian interference channel capacity to within one bit"
    - "mimo broadcast channels with finite rate feedback"

Connected through hyperedge HE-8 (induced by source paper "elevated multiplexing and signal space partitioning in the 2 user mimo ic with partial csit"):
  with members:
    - "miso networks with imperfect csit a topological rate splitting approach"
    - "sum rate maximization for mu miso with partial csit using joint multicasting and broadcasting"
    - "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"
    - "multilevel topological interference management"
    - "degrees of freedom of time correlated miso broadcast channel with delayed csit"
    - "optimal use of current and outdated channel state information degrees of freedom of the miso bc with mixed csit"
    - "fundamental limits of cooperation"
    - "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)