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 finite state mac with cooperative encoders and delayed csi"):
  Abstract: In this paper, we consider the finite-state multiple access channel (MAC) with partially cooperative encoders and delayed channel state information (CSI). Here partial cooperation refers to the communication between the encoders via finite-capacity links. The channel states are assumed to be governed by a Markov process. Full CSI is assumed at the receiver, while at the transmitters, only delayed CSI is available. The capacity region of this channel model is derived by first solving the case of the finite-state MAC with a common message. Achievability for the latter case is established using the notion of strategies, however, we show that optimal codes can be constructed directly over the input alphabet. This results in a single codebook construction that is then leveraged to apply simultaneous joint decoding. Simultaneous decoding is crucial here because it circumvents the need to rely on the capacity region's corner points, a task that becomes increasingly cumbersome with the growth in the number of messages to be sent. The common message result is then used to derive the capacity region for the case with partially cooperating encoders. Next, we apply this general result to the special case of the Gaussian vector MAC with diagonal channel transfer matrices, which is suitable for modeling, e.g., orthogonal frequency division multiplexing (OFDM)-based communication systems. The capacity region of the Gaussian channel is presented in terms of a convex optimization problem that can be solved efficiently using numerical tools. The region is derived by first presenting an outer bound on the general capacity region and then suggesting a specific input distribution that achieves this bound. Finally, numerical results are provided that give valuable insight into the practical implications of optimally using conferencing to maximize the transmission rates.

Includes members:
  Member "dedicated relay vs user cooperation in time duplexed multiaccess networks":
    also connected through other hyperedges:
      (none)
  Member "interference channels with source cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gdof of interference channel with limited cooperation under finite precision csit")
  Member "source coding when the side information may be delayed":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "second order coding rates for conditional rate distortion")
  Member "interference channels with destination cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "gdof of interference channel with limited cooperation under finite precision csit")
  Member "on the capacity of memoryless finite state multiple access channels with asymmetric state information at the encoders":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cooperative multiple access channels with distributed state information")
  Member "compound multiple access channels with partial cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation")
  Member "interference mitigation through limited receiver cooperation symmetric case":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "uplink comp under a constrained backhaul and imperfect channel knowledge")
  Member "on the symmetric gaussian interference channel with partial unidirectional cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "novel outer bounds and capacity results for the interference channel with conferencing receivers")

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)