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 "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit"):
  Abstract: We study the $K=3$ user multiple input single output (MISO) broadcast channel (BC) with $M=3$ antennas at the transmitter and $1$ antenna at each receiver, from the generalized degrees of freedom (GDoF) perspective, under the assumption that the channel state information at the transmitter (CSIT) is limited to finite precision. In particular, our goal is to identify a parameter regime where a simple layered superposition (SLS) coding scheme achieves the entire GDoF region. With $\alpha_{ij}$ representing the channel strength parameter for the link from the $j^{th}$ antenna of the transmitter to the $i^{th}$ receiver, we prove that SLS is GDoF optimal without the need for time-sharing if $\max(\alpha_{ki},\alpha_{im})\leq\alpha_{ii}$ and $\alpha_{ki}+\alpha_{im}\le\alpha_{ii}+\alpha_{km}$ for all $i,k\in[3],m\in[M]$. The GDoF region under this condition is a convex polyhedron. The result generalizes to arbitrary $M\geq 3$.

Includes members:
  Member "towards an extremal network theory robust gdof gain of transmitter cooperation over tin":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimality of treating inter cell interference as noise under finite precision csit")
  Member "k user symmetric m times n mimo interference channel under finite precision csit a gdof perspective":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards an extremal network theory robust gdof gain of transmitter cooperation over tin")
  Member "sum set inequalities from aligned image sets instruments for robust gdof bounds":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dof region of the decentralized mimo broadcast channel unicode x2014 how many informed antennas do we need")
  Member "aligned image sets and the generalized degrees of freedom of symmetric mimo interference channel with partial csit":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards an extremal network theory robust gdof gain of transmitter cooperation over tin")
  Member "network coherence time matters aligned image sets and the degrees of freedom of interference networks with finite precision csit and perfect csir":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards an extremal network theory robust gdof gain of transmitter cooperation over tin")
  Member "achievable dof regions of mimo networks with imperfect csit":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "study of linear precoding and stream combining for rate splitting in mu mimo systems")
  Member "gdof of the k user symmetric miso bc bridging the gap between finite precision and perfect csit":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generalized degrees of freedom of the symmetric cache aided miso broadcast channel with partial csit")
  Member "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimality of treating inter cell interference as noise under finite precision csit")

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)