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 "on the multiple access channel with asymmetric noisy state information at the encoders"):
  Abstract: We consider the problem of reliable communication over multiple-access channels (MAC) where the channel is driven by an independent and identically distributed state process and the encoders and the decoder are provided with various degrees of asymmetric noisy channel state information (CSI). For the case where the encoders observe causal, asymmetric noisy CSI and the decoder observes complete CSI, we provide inner and outer bounds to the capacity region, which are tight for the sum-rate capacity. We then observe that, under a Markov assumption, similar capacity results also hold in the case where the receiver observes noisy CSI. Furthermore, we provide a single letter characterization for the capacity region when the CSI at the encoders are asymmetric deterministic functions of the CSI at the decoder and the encoders have non-causal noisy CSI (its causal version is recently solved in \cite{como-yuksel}). When the encoders observe asymmetric noisy CSI with asymmetric delays and the decoder observes complete CSI, we provide a single letter characterization for the capacity region. Finally, we consider a cooperative scenario with common and private messages, with asymmetric noisy CSI at the encoders and complete CSI at the decoder. We provide a single letter expression for the capacity region for such channels. For the cooperative scenario, we also note that as soon as the common message encoder does not have access to CSI, then in any noisy setup, covering the cases where no CSI or noisy CSI at the decoder, it is possible to obtain a single letter characterization for the capacity region. The main component in these results is a generalization of a converse coding approach, recently introduced in [1] for the MAC with asymmetric quantized CSI at the encoders and herein considerably extended and adapted for the noisy CSI setup.

Includes members:
  Member "a note on multiple access channels with strictly causal state information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multiple access channels with states causally known at transmitters")
  Member "capacity region of finite state multiple access channel with delayed state information at the transmitters":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the capacity of memoryless finite state multiple access channels with asymmetric state information at the encoders")
  Member "multiple access channel with states known noncausally at one encoder and only strictly causally at the other encoder":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on cooperative multiple access channels with delayed csi at transmitters")
  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 "on optimal causal coding of partially observed markov sources in single and multi terminal settings":
    also connected through other hyperedges:
      (none)
  Member "on the structure of real time encoders and decoders in a multi terminal communication system":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "decentralized stochastic control with partial history sharing a common information approach")
  Member "multiaccess channels with state known to one encoder another case of degraded message sets":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "state dependent gaussian multiple access channels new outer bounds and capacity results")
  Member "finite state channels with time invariant deterministic feedback":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "computing the feedback capacity of finite state channels using reinforcement learning")

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)