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 "an achievable rate region for the three user interference channel based on coset codes"):
  Abstract: We consider the problem of communication over a three-user discrete memoryless interference channel (3-IC). The current known coding techniques for communicating over an arbitrary 3-IC are based on message splitting, superposition coding, and binning using independent and identically distributed (i.i.d.) random codebooks. In this paper, we propose a new ensemble of codes—partitioned coset codes (PCCs)—that possess an appropriate mix of empirical and algebraic closure properties. We develop coding techniques that exploit the algebraic closure property of PCC to enable interference alignment over general 3-IC. We analyze the performance of the proposed coding technique to derive an achievable rate region for the general discrete 3-IC. Additive and non-additive examples are identified for which the derived achievable rate region is the capacity, moreover, strictly larger than the current known largest achievable rate regions based on the i.i.d. random codebooks.

Includes members:
  Member "on interference networks over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "structured mappings and conferencing common information for multiple access channels")
  Member "on the capacity of the finite field counterparts of wireless interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rank matching for multihop multiflow")
  Member "is non unique decoding necessary":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "harnessing correlations in distributed erasure coded key value stores")
  Member "abelian group codes for source coding and channel coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "achievable rate region based on coset codes for multiple access channel with states")
  Member "achievable rate region based on coset codes for multiple access channel with states":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "homologous codes for multiple access channels")
  Member "the approximate sum capacity of the symmetric gaussian k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "private information retrieval over gaussian mac")
  Member "interference alignment from degrees of freedom to constant gap capacity approximations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "interference decoding for deterministic channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "performance of multi cell massive mimo systems with interference decoding")

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)