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 capacity of multiple access z interference channels"):
  Abstract: The capacity of a network in which a multiple access channel (MAC) generates interference to a single-user channel is studied. An achievable rate region based on superposition coding and joint decoding is established for the discrete case. If the interference is very strong, the capacity region is obtained for both the discrete memoryless channel and the Gaussian channel. For the strong interference case, the capacity region is established for the discrete memoryless channel; for the Gaussian case, we attain a line segment on the boundary of the capacity region. Moreover, the capacity region for the Gaussian channel is identified for the case when one interference link being strong, and the other being very strong. For a subclass of Gaussian channels with mixed interference, a boundary point of the capacity region is determined. Finally, for the Gaussian channel with weak interference, sum capacities are obtained under various channel coefficient and power constraint conditions.

Includes members:
  Member "real interference alignment exploiting the potential of single antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi antenna coded content delivery with caching a low complexity solution")
  Member "on a class of discrete memoryless broadcast interference channels":
    also connected through other hyperedges:
      (none)
  Member "on interference alignment and the deterministic capacity for cellular channels with weak symmetric cross links":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "enabling the multi user generalized degrees of freedom in the gaussian cellular channel")
  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 "capacity regions and sum rate capacities of vector gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "signal processing and optimal resource allocation for the interference channel")
  Member "on the capacity of the 2 user gaussian mac interfering with a p2p link":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximate capacity region of the mac ic mac")
  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 "a layered lattice coding scheme for a class of three user gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "structured mappings and conferencing common information for multiple access channels")

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)