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 channels"):
  Abstract: In this paper, we consider a Gaussian multiple access channel with multiple independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. The capacity region is characterized to within a constant gap regardless of channel parameters. These results are based on a layered modulo-lattice scheme which realizes distributed interference cancellation.

Includes members:
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "interference mitigation through limited transmitter cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "exploiting computation replication for mobile edge computing a fundamental computation communication tradeoff study")
  Member "the approximate capacity of the many to one and one to many gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "bounds on the capacity of the relay channel with noncausal state information at source":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on cooperative multiple access channels with delayed csi at transmitters")
  Member "distributed interference cancellation in multiple access channel with transmitter cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multiple access channels with cooperative encoders and channel state information")
  Member "interference mitigation through limited receiver cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "how much can d2d communication reduce content delivery latency in fog networks with edge caching")
  Member "lattice strategies for the dirty multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "state dependent gaussian multiple access channels new outer bounds and capacity results")

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)