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 "on the scaling exponent of polar codes with product kernels"):
  Abstract: Polar codes, introduced by Arikan, achieve the capacity of arbitrary binary-input discrete memoryless channel $W$ under successive cancellation decoding. Any such channel having capacity $I(W)$ and for any coding scheme allowing transmission at rate $R$, scaling exponent is a parameter which characterizes how fast gap to capacity decreases as a function of code length $N$ for a fixed probability of error. The relation between them is given by $N\geqslant \frac{\alpha}{(I(W)-R)^\mu}$. Scaling exponent for kernels of small size up to $L=8$ has been exhaustively found. In this paper, we consider product kernels $T_{L}$ obtained by taking Kronecker product of component kernels. We use polarization behavior of component kernel $T_{l}$ to calculate scaling exponent of $T_{L}=T_{2}\otimes T_{l}$. Using this method, we show that $\mu(T_{2}\otimes T_{5})=3.942.$ Further, we employ a heuristic approach to construct good kernels of size $2(2^{p}-1)$ from kernels of size $2^p$ having best $\mu$ and find $\mu(T_{2}\otimes T_{7})=3.485.$

Includes members:
  Member "explicit polar codes with small scaling exponent":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the polarizing behavior and scaling exponent of polar codes with product kernels")
  Member "minimum distance based construction of multi kernel polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multi kernel polar codes concept and design principles")
  Member "binary linear codes with optimal scaling and quasi linear complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the polarizing behavior and scaling exponent of polar codes with product kernels")
  Member "multi kernel polar codes proof of polarization and error exponents":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "finite length scaling for polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reed muller codes theory and algorithms")
  Member "list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "polar codes characterization of exponent bounds and constructions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)