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 the deletion channel weak and strong polarization"):
  Abstract: This paper presents the first proof of polarization for the deletion channel with a constant deletion rate and a regular hidden-Markov input distribution. A key part of this work involves representing the deletion channel using a trellis and describing the plus and minus polar-decoding operations on this trellis. In particular, the plus and minus operations can be seen as combining adjacent trellis stages to yield a new trellis with half as many stages. Using this viewpoint, we prove a weak polarization theorem for standard polar codes on the deletion channel. To achieve strong polarization, we modify this scheme by adding guard bands of repeated zeros between various parts of the codeword. Using this approach, we obtain a scheme whose rate approaches the mutual information and whose probability of error decays exponentially in the cube-root of the block length.

Includes members:
  Member "universal polarization for processes with memory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "list decoding of universal polar codes")
  Member "capacity upper bounds for deletion type channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an overview of capacity results for synchronization channels")
  Member "a simple proof of fast polarization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "universal polarization for processes with memory")
  Member "fast polarization for processes with memory":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "list decoding of universal polar codes")
  Member "polar coding for the binary erasure channel with deletions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "correcting bursty and localized deletions using guess check codes")
  Member "polar coding for processes with memory":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "list decoding of universal polar codes")
  Member "joint successive cancellation decoding of polar codes over intersymbol interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "list decoding of universal polar codes")
  Member "list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "polar codes and their quantum domain counterparts")

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)