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 like codes and asymptotic tradeoff among block length code rate and error probability"):
  Abstract: A general framework is proposed that includes polar codes over arbitrary channels with arbitrary kernels. The asymptotic tradeoff among block length $N$, code rate $R$, and error probability $P$ is analyzed. #R##N#Given a tradeoff between $N,P$ and a tradeoff between $N,R$, we return an interpolating tradeoff among $N,R,P$ (Theorem 5). $\def\Capacity{\text{Capacity}}$Quantitatively, if $P=\exp(-N^{\beta^*})$ is possible for some $\beta^*$ and if $R=\Capacity-N^{1/\mu^*}$ is possible for some $1/\mu^*$, then $(P,R)=(\exp(-N^{\beta'}),\Capacity-N^{-1/\mu'})$ is possible for some pair $(\beta',1/\mu')$ determined by $\beta^*$, $1/\mu^*$, and auxiliary information. In fancy words, an error exponent regime tradeoff plus a scaling exponent regime tradeoff implies a moderate deviations regime tradeoff. #R##N#The current world records are: [arXiv:1304.4321][arXiv:1501.02444][arXiv:1806.02405] analyzing Ar{\i}kan's codes over BEC; [arXiv:1706.02458] analyzing Ar{\i}kan's codes over AWGN; and [arXiv:1802.02718][arXiv:1810.04298] analyzing general codes over general channels. An attempt is made to generalize all at once (Section IX). #R##N#As a corollary, a grafted variant of polar coding almost catches up the code rate and error probability of random codes with complexity slightly larger than $N\log N$ over BEC. In particular, $(P,R)=(\exp(-N^{.33}),\Capacity-N^{-.33})$ is possible (Corollary 10). In fact, all points in this triangle are possible $(\beta',1/\mu')$-pairs. $$ #R##N#\require{enclose} #R##N#\def\r{\phantom{\Rule{4em}{1em}{1em}}} #R##N#\enclose{}\r^\llap{(0,1/2)}_\llap{(0,0)} #R##N#\enclose{left,bottom,downdiagonalstrike}\r_\rlap{(1,0)} #R##N#\enclose{}\r $$

Includes members:
  Member "performance bounds of concatenated polar coding schemes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "list decoding of universal polar codes")
  Member "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polar codes simplicity random codes durability")
  Member "relaxed polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polar codes simplicity random codes durability")
  Member "minimum distance based construction of multi kernel polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi kernel polar codes concept and design principles")
  Member "multi kernel polar codes proof of polarization and error exponents":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "a note on some inequalities used in channel polarization and polar coding":
    also connected through other hyperedges:
      (none)
  Member "near optimal finite length scaling for polar codes over large alphabets":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes simplicity random codes durability")
  Member "multi kernel construction of polar codes":
    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)