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 "multiple access channels with states causally known at transmitters"):
  Abstract: It has been recently shown by Lapidoth and Steinberg that strictly causal state information can be beneficial in multiple access channels (MACs). Specifically, it was proved that the capacity region of a two-user MAC with independent states, each known strictly causally to one encoder, can be enlarged by letting the encoders send compressed past state information to the decoder. In this study, a generalization of the said strategy is proposed whereby the encoders compress also the past transmitted codewords along with the past state sequences. The proposed scheme uses a combination of long-message encoding, compression of the past state sequences and codewords without binning, and joint decoding over all transmission blocks. The proposed strategy has been recently shown by Lapidoth and Steinberg to strictly improve upon the original one. Capacity results are then derived for a class of channels that include two-user modulo-additive state-dependent MACs. Moreover, the proposed scheme is extended to state-dependent MACs with an arbitrary number of users. Finally, output feedback is introduced and an example is provided to illustrate the interplay between feedback and availability of strictly causal state information in enlarging the capacity region.

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 "capacity region of multiple access channel with states known noncausally at one encoder and only strictly causally at the other encoder")
  Member "short message quantize forward network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity approximations for gaussian relay networks")
  Member "message and state cooperation in multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "message and state cooperation in a relay channel when only the relay knows the state")
  Member "noisy network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an information theoretic analysis of the gaussian multicast channel with interactive user cooperation")
  Member "lecture notes on network information theory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the required number of antennas in a point to point large but finite mimo system outage limited scenario")
  Member "lattice strategies for the dirty multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "multiaccess channels with state known to some encoders and independent messages":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "gaussian multiple access via compute and forward")

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)