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 "polar codes for broadcast channels"):
  Abstract: Polar codes are introduced for discrete memoryless broadcast channels. For    $m$   -user deterministic broadcast channels, polarization is applied to map uniformly random message bits from    $m$   -independent messages to one codeword while satisfying broadcast constraints. The polarization-based codes achieve rates on the boundary of the private-message capacity region. For two-user noisy broadcast channels, polar implementations are presented for two information-theoretic schemes: 1) Cover’s superposition codes and 2) Marton’s codes. Due to the structure of polarization, constraints on the auxiliary and channel-input distributions are identified to ensure proper alignment of polarization indices in the multiuser setting. The codes achieve rates on the capacity boundary of a few classes of broadcast channels (e.g., binary-input stochastically degraded). The complexity of encoding and decoding is    $ O(n \log n)$   , where    $n$    is the block length. In addition, polar code sequences obtain a stretched-exponential decay of    $ O(2^{-n^{\beta }})$    of the average block error probability where    $0   . Reproducible experiments for finite block lengths    $n = 512, 1024, 2048$    corroborate the theory.

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 "achieving the uniform rate region of general multiple access channels by polar coding")
  Member "a comparison of superposition coding schemes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sliding window superposition coding two user interference channels")
  Member "polar codes for the two user multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polar codes simplicity random codes durability")
  Member "evaluation of marton s inner bound for the general broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the direction of discrimination an information theoretic analysis of disparate impact in machine learning")
  Member "polar codes for q ary channels q 2 r":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar codes simplicity random codes durability")
  Member "how to construct polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "achieving the secrecy capacity of wiretap channels using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "multilevel polarization of polar codes over arbitrary discrete memoryless channels":
    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)