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 simplicity random codes durability"):
  Abstract: Over any discrete memoryless channel, we build codes such that: for one, their block error probabilities and code rates scale like random codes'; and for two, their encoding and decoding complexities scale like polar codes'. Quantitatively, for any constants $\pi,\rho>0$ such that $\pi+2\rho 1$, no such codes exist for generic channels regardless of alphabet and complexity.

Includes members:
  Member "reed muller codes polarize":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reed muller codes theory and algorithms")
  Member "ar i kan meets shannon polar codes with near optimal convergence to channel capacity":
    also connected through other hyperedges:
      (none)
  Member "explicit polar codes with small scaling exponent":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the polarizing behavior and scaling exponent of polar codes with product kernels")
  Member "on the capacity of channels with deletions and states":
    also connected through other hyperedges:
      (none)
  Member "polar codes for the deletion channel weak and strong polarization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "list decoding of universal polar codes")
  Member "polar like codes and asymptotic tradeoff among block length code rate and error probability":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "log logarithmic time pruned polar coding")
  Member "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sublinear latency for simplified successive cancellation decoding of polar codes")
  Member "relaxed polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "log logarithmic time pruned polar coding")

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)