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 "distributed interference cancellation in multiple access channel with transmitter cooperation"):
  Abstract: We consider a two-user Gaussian multiple access channel with two independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. Transmitters are allowed to cooperate through finite-capacity links. The capacity region is characterized to within 3 and 1.5 bits for the stronger user and the weaker user respectively, regardless of channel parameters. As a by-product, we characterize the capacity region of the case without cooperation to within 1 and 0.5 bits for the stronger user and the weaker user respectively. These results are based on a layered modulo-lattice transmission architecture which realizes distributed interference cancellation.

Includes members:
  Member "lattice strategies for the dirty multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "multiaccess channels with state known to one encoder another case of degraded message sets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "state dependent gaussian multiple access channels new outer bounds and capacity results")
  Member "the gaussian mac with conferencing encoders":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation")
  Member "multiaccess channels with state known to some encoders and independent messages":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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)