human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "improved bounds on the finite length scaling of polar codes"
  Abstract: Improved bounds on the blocklength required to communicate over binary-input channels using polar codes, below some given error probability, are derived. For that purpose, an improved bound on the number of non-polarizing channels is obtained. The main result is that the blocklength required to communicate reliably scales at most as $O((I(W)-R)^{-5.77})$ where $R$ is the code rate and $I(W)$ the symmetric capacity of the channel, $W$. The results are then extended to polar lossy source coding at rate $R$ of a source with symmetric distortion-rate function $D(\cdot)$. The blocklength required scales at most as $O((D_N-D(R))^{-5.77})$ where $D_N$ is the actual distortion.

Connected through hyperedge HE-1 (induced by source paper "polar codes simplicity random codes durability"):
  with members:
    - "reed muller codes polarize"
    - "ar i kan meets shannon polar codes with near optimal convergence to channel capacity"
    - "explicit polar codes with small scaling exponent"
    - "on the capacity of channels with deletions and states"
    - "polar codes for the deletion channel weak and strong polarization"
    - "polar like codes and asymptotic tradeoff among block length code rate and error probability"
    - "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel"
    - "relaxed polar codes"

Connected through hyperedge HE-2 (induced by source paper "sublinear latency for simplified successive cancellation decoding of polar codes"):
  with members:
    - "log logarithmic time pruned polar coding"
    - "polar codes with exponentially small error at finite block length"
    - "polar code moderate deviation recovering the scaling exponent"
    - "partitioned list decoding of polar codes analysis and improvement of finite length performance"
    - "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel"
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "binary linear codes with optimal scaling polar codes with large kernels"
    - "partitioned successive cancellation list decoding of polar codes"

Connected through hyperedge HE-3 (induced by source paper "ar i kan meets shannon polar codes with near optimal convergence to channel capacity"):
  with members:
    - "explicit polar codes with small scaling exponent"
    - "general strong polarization"
    - "binary linear codes with optimal scaling and quasi linear complexity"
    - "multi kernel polar codes proof of polarization and error exponents"
    - "near optimal finite length scaling for polar codes over large alphabets"
    - "multi kernel construction of polar codes"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "finite length scaling for polar codes"

Connected through hyperedge HE-4 (induced by source paper "on polar coding for binary dirty paper"):
  with members:
    - "finite length scaling for polar codes"
    - "universal polar codes"
    - "list decoding of polar codes"
    - "polar write once memory codes"
    - "fixed length lossy compression in the finite blocklength regime"
    - "polar codes are optimal for lossy source coding"

Connected through hyperedge HE-5 (induced by source paper "polar like codes and asymptotic tradeoff among block length code rate and error probability"):
  with members:
    - "performance bounds of concatenated polar coding schemes"
    - "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel"
    - "relaxed polar codes"
    - "minimum distance based construction of multi kernel polar codes"
    - "multi kernel polar codes proof of polarization and error exponents"
    - "a note on some inequalities used in channel polarization and polar coding"
    - "near optimal finite length scaling for polar codes over large alphabets"
    - "multi kernel construction of polar codes"

Connected through hyperedge HE-6 (induced by source paper "channel coding at low capacity"):
  with members:
    - "polar codes with a stepped boundary"
    - "recursive list decoding for reed muller codes"
    - "beta beta bounds finite blocklength analog of the golden formula"
    - "relaxed polar codes"
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "coding in the finite blocklength regime bounds based on laplace integrals and their asymptotic approximations"
    - "polar codes for broadcast channels"
    - "asymptotic estimates in information theory with non vanishing error probabilities"

Connected through hyperedge HE-7 (induced by source paper "polar code moderate deviation recovering the scaling exponent"):
  with members:
    - "general strong polarization"
    - "near optimal finite length scaling for polar codes over large alphabets"
    - "finite length scaling for polar codes"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "on the correlation between polarized becs"
    - "scaling exponent of list decoders with applications to polar codes"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"
    - "polar codes characterization of exponent bounds and constructions"

Connected through hyperedge HE-8 (induced by source paper "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel"):
  with members:
    - "on the scaling exponent of polar codes for binary input energy harvesting channels"
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "wasserstein continuity of entropy and outer bounds for interference channels"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "finite length scaling for polar codes"
    - "polar codes for the two user multiple access channel"
    - "moderate deviations in channel coding"
    - "achieving the capacity of any dmc using only polar codes"

Question: Please tell me which class the center node 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)