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 "generalized degrees of freedom of the 2 user case miso broadcast channel with distributed csit"):
  Abstract: This work analyses the Generalized Degrees-of-Freedom (GDoF) of the 2-User Multiple-Input Single-Output (MISO) Broadcast Channel (BC) in the so-called Distributed CSIT regime, with application to decentralized wireless networks. This regime differs from the classical limited CSIT one in that the CSIT is not just noisy but also imperfectly shared across the transmitters (TXs). Hence, each TX precodes data on the basis of local CSIT and statistical quality information at other TXs. We derive the GDoF result and obtain the surprising outcome that by specific accounting of the pathloss information, it becomes possible for the decentralized precoded network to reach the same performance as a genie-aided centralized network where the central node has obtained the estimates of both TXs. The key ingredient in the scheme is the so-called Active-Passive Zero-Forcing (AP-ZF) precoding, which lets the precoder design adapt optimally with respect to different local CSIT qualities available at different TXs.

Includes members:
  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-1 (induced by source paper "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit")
  Member "rate analysis of two receiver miso broadcast channel with finite rate feedback a rate splitting approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rate splitting multiple access for multi antenna downlink communication systems spectral and energy efficiency tradeoff")
  Member "spatial csit allocation policies for network mimo channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the total energy efficiency of cell free massive mimo")
  Member "fundamental limits of caching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "interference alignment with incomplete csit sharing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "network mimo transmitters with no csi can still be very useful")
  Member "the multiplexing gain of a two cell mimo channel with unequal csi":
    also connected through other hyperedges:
      (none)
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "mimo broadcast channels with finite rate feedback":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "dl based csi feedback and cooperative recovery in massive mimo")

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)