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 "achieving the uniform rate region of general multiple access channels by polar coding"):
  Abstract: We consider the problem of polar coding for transmission over   $m$  -user multiple access channels. In the proposed scheme, all users encode their messages using a polar encoder, while a multiuser successive cancellation decoder is deployed at the receiver. The encoding is done separately across the users and is independent of the target achievable rate. For the code construction, the positions of information bits and frozen bits for each of the users are decided jointly. This is done by treating the polar transformations across all the   $m$   users as a single polar transformation with a certain  polarization base . We characterize the resolution of achievable rates on the dominant face of the uniform rate region in terms of the number of users   $m$   and the length of the polarization base   $L$  . In particular, we prove that for any target rate on the dominant face, there exists an achievable rate, also on the dominant face, within the distance at most   $\frac{(m-1)\sqrt{m}}{L}$   from the target rate. We then prove that the proposed MAC polar coding scheme achieves the whole uniform rate region with fine enough resolution by changing the decoding order in the multiuser successive cancellation decoder, as   $L$   and the code block length   $N$   grow large. The encoding and decoding complexities are   $O(N \log N)$   and the asymptotic block error probability of   $O(2^{-N^{0.5 - \epsilon}})$   is guaranteed. Examples of achievable rates for the 3-user multiple access channel are provided.

Includes members:
  Member "achieving marton s region for broadcast channels using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polar coding for non stationary channels")
  Member "performance limits and practical decoding of interleaved reed solomon polar concatenated codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "threshold secure coding with shared key")
  Member "polar coding for interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "general strong polarization")
  Member "compound polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "design of polar codes for parallel channels with an average power constraint")
  Member "achieving the uniform rate region of multiple access channels using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar codes for broadcast channels with receiver message side information and noncausal state available at the encoder")
  Member "list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "polar codes for the two user multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polar codes simplicity random codes durability")
  Member "randomness and dependencies extraction via polarization with applications to slepian wolf coding and secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "polar codes simplicity random codes durability")

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)