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 "modular arithmetic erasure channels and their multilevel channel polarization"):
  Abstract: This study proposes a novel channel model called the modular arithmetic erasure channel, which is a general type of arbitrary input erasure-like channels containing the binary erasure channel (BEC) and some other previously-known erasure-like channels. For this channel model, we give recursive formulas of Ar{\i}kan-like polar transforms to simulate its channel polarization easily. In other words, similar to the polar transforms for BECs, we show that the synthetic channels of modular arithmetic erasure channels are again equivalent to the same channel models with certain transition probabilities, which can be easily calculated by explicit recursive formulas. We also show that Ar{\i}kan-like polar transforms for modular arithmetic erasure channels behave multilevel channel polarization, which is a phenomenon appeared in the study of non-binary polar codes, and thus, modular arithmetic erasure channels are informative toy problems of multilevel channel polarization. Furthermore, as a solution of an open problem in non-binary polar codes for special cases, we solve exactly and algorithmically the limiting proportions of partially noiseless synthetic channels, called the asymptotic distribution of multilevel channel polarization, for modular arithmetic erasure channels.

Includes members:
  Member "fourier analysis of mac polarization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "countably infinite multilevel source polarization for non stationary erasure distributions")
  Member "a generalized erasure channel in the sense of polarization for binary erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "countably infinite multilevel source polarization for non stationary erasure distributions")
  Member "construction of polar codes for arbitrary discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "entropies of weighted sums in cyclic groups and an application to polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "countably infinite multilevel source polarization for non stationary erasure distributions")
  Member "polar codes for the two user multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar codes simplicity random codes durability")
  Member "polar codes for q ary channels q 2 r":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes simplicity random codes durability")
  Member "how to construct polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "reed muller codes theory and algorithms")

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)