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 "the role of transmitter cooperation in linear interference networks with block erasures"):
  Abstract: In this work, we explore the potential and optimal use of transmitter cooperation in wireless interference networks with deep fading conditions. We consider a linear interference network with K transmitter-receiver pairs, where each transmitter can be connected to two neighboring receivers. Long-term fluctuations (shadow fading) in the wireless channel can lead to any link being erased with probability p. Each receiver is interested in one unique message that can be available at two transmitters. The considered rate criterion is the average per user degrees of freedom (puDoF) as K goes to infinity. Prior to this work, the optimal assignment of messages to transmitters were identified in the two limits as p goes to 0 and as p goes to 1. We identify new schemes that achieve average puDoF values that are higher than the state of the art for a significant part of the range 0 < p < 1. The key idea to our results is to understand that the role of cooperation shifts from increasing the probability of delivering a message to its intended destination at high values of p, to interference cancellation at low values of p. Our schemes are based on an algorithm that achieves the optimal DoF value in any network realization, when restricted to a given message assignment as well as the use of zero-forcing schemes.

Includes members:
  Member "dynamic interference management":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of dynamic interference management with flexible message assignments")
  Member "degrees of freedom dof of locally connected interference channels with coordinated multi point comp transmission":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "wyner s network on caches combining receiver caching with a flexible backhaul")

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)