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 "universal polarization for processes with memory"):
  Abstract: A transform that is universally polarizing over a set of channels with memory is presented. Memory may be present in both the input to the channel and the channel itself. Both the encoder and the decoder are aware of the input distribution, which is fixed. However, only the decoder is aware of the actual channel being used. The transform can be used to design a universal code for this scenario. The code is to have vanishing error probability when used over any channel in the set, and achieve the infimal information rate over the set. The setting considered is, in fact, more general: we consider a set of processes with memory. Universal polarization is established for the case where each process in the set: (a) has memory in the form of an underlying hidden Markov state sequence that is aperiodic and irreducible, and (b) satisfies a `forgetfulness' property. Forgetfulness, which we believe to be of independent interest, occurs when two hidden Markov states become approximately independent of each other given a sufficiently long sequence of observations between them. We show that aperiodicity and irreducibility of the underlying Markov chain is not sufficient for forgetfulness, and develop a sufficient condition for a hidden Markov process to be forgetful.

Includes members:
  Member "a simple proof of fast polarization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polar codes for the deletion channel weak and strong polarization")
  Member "fast polarization for processes with memory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "list decoding of universal polar codes")
  Member "polar coding for processes with memory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "list decoding of universal polar codes")
  Member "construction of polar codes for arbitrary discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "on the construction of polar codes for channels with moderate input alphabet sizes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "information distilling quantizers")
  Member "universal polar codes for more capable and less noisy channels and sources":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "comparison of channels criteria for domination by a symmetric channel")
  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 "universal source polarization and an application to a multi user problem":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "polar coding for secret key generation")

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)