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 "fundamental limits of dynamic interference management with flexible message assignments"):
  Abstract: The problem of interference management is considered in the context of a linear interference network that is subject to long term channel fluctuations due to shadow fading. The fading model used is one where each link in the network is subject independently to erasure with probability p. It is assumed that each receiver in the network is interested in one unique message, which is made available at M transmitters. Optimal schemes from a Degrees of Freedom (DoF) viewpoint are analyzed for the setting of no erasures, and new schemes are proposed with better average DoF performance at higher probabilities of erasure. Additionally, for M=1, the average per user DoF is characterized for every value of p, and optimal message assignments are identified. For M>1, it is first established that there is no strategy for assigning messages to transmitters in networks that is optimal for all values of p. The optimal cooperative zero-forcing scheme for M=2 is then identified, and shown to be information-theoretically optimal when the size of the largest subnetwork that contains no erased links is at most five.

Includes members:
  Member "the role of transmitter cooperation in linear interference networks with block erasures":
    also connected through other hyperedges:
      (none)
  Member "cognitive wyner networks with clustered decoding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "topological interference management with decoded message passing")
  Member "flexible backhaul design and degrees of freedom for linear interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "wyner s network on caches combining receiver caching with a flexible backhaul")
  Member "optimality of orthogonal access for one dimensional convex cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit")
  Member "dynamic interference management":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the role of transmitter cooperation in linear interference networks with block erasures")
  Member "degrees of freedom dof of locally connected interference channels with coordinated multi point comp transmission":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "wyner s network on caches combining receiver caching with a flexible backhaul")
  Member "approaching the capacity of wireless networks through distributed interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "interference alignment with power splitting relays in multi user multi relay networks")

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)