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 "countably infinite multilevel source polarization for non stationary erasure distributions"):
  Abstract: Polar transforms are central operations in the study of polar codes. This paper examines polar transforms for non-stationary memoryless sources on possibly infinite source alphabets. This is the first attempt of source polarization analysis over infinite alphabets. The source alphabet is defined to be a Polish group, and we handle the Ar{\i}kan-style two-by-two polar transform based on the group. Defining erasure distributions based on the normal subgroup structure, we give recursive formulas of the polar transform for our proposed erasure distributions. As a result, the recursive formulas lead to concrete examples of multilevel source polarization with countably infinite levels when the group is locally cyclic. We derive this result via elementary techniques in lattice theory.

Includes members:
  Member "asymptotic distribution of multilevel channel polarization for a certain class of erasure channels":
    also connected through other hyperedges:
      (none)
  Member "on the polarization levels of automorphic symmetric channels":
    also connected through other hyperedges:
      (none)
  Member "general strong polarization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reed muller codes theory and algorithms")
  Member "fano type inequalities based on general conditional information measures over countably infinite alphabets with list decoding":
    also connected through other hyperedges:
      (none)
  Member "modular arithmetic erasure channels and their multilevel channel polarization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "asymptotic distribution of multilevel channel polarization for a certain class of erasure channels")
  Member "fourier analysis of mac polarization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "modular arithmetic erasure channels and their multilevel channel polarization")
  Member "a generalized erasure channel in the sense of polarization for binary erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "modular arithmetic erasure channels and their multilevel channel polarization")
  Member "polar coding for non stationary channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure polar coding for adversarial wiretap channel")

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)