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: "universal bounds on the scaling behavior of polar codes"
  Abstract: We consider the problem of determining the trade-off between the rate and the block-length of polar codes for a given block error probability when we use the successive cancellation decoder. We take the sum of the Bhattacharyya parameters as a proxy for the block error probability, and show that there exists a universal parameter $\mu$ such that for any binary memoryless symmetric channel $W$ with capacity $I(W)$, reliable communication requires rates that satisfy $R< I(W)-\alpha N^{-\frac{1}{\mu}}$, where $\alpha$ is a positive constant and $N$ is the block-length. We provide lower bounds on $\mu$, namely $\mu \geq 3.553$, and we conjecture that indeed $\mu=3.627$, the parameter for the binary erasure channel.

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 "pkc pc a variant of the mceliece public key cryptosystem based on polar codes"):
  with members:
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "security and complexity of the mceliece cryptosystem based on quasi cyclic low density parity check codes"
    - "a cca2 secure variant of the mceliece cryptosystem"
    - "achieving the secrecy capacity of wiretap channels using polar codes"

Connected through hyperedge HE-3 (induced by source paper "finite length scaling for polar codes"):
  with members:
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "from polar to reed muller codes a technique to improve the finite length performance"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "improved successive cancellation decoding of polar codes"
    - "improved bounds on the finite length scaling of polar codes"
    - "polar codes with dynamic frozen symbols and their decoding by directed search"
    - "on the correlation between polarized becs"
    - "scaling exponent of list decoders with applications to polar codes"

Connected through hyperedge HE-4 (induced by source paper "from polar to reed muller codes a technique to improve the finite length performance"):
  with members:
    - "soft decision decoding of reed muller codes recursive lists"
    - "recursive decoding and its performance for low rate reed muller codes"
    - "finite length scaling for polar codes"
    - "a rm polar codes"
    - "improved bounds on the finite length scaling of polar codes"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "improved bounds on the finite length scaling of polar codes"):
  with members:
    - "polar codes for broadcast channels"
    - "finite length scaling for polar codes"
    - "achieving marton s region for broadcast channels using polar codes"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"
    - "list decoding of polar codes"
    - "strong coordination with polar codes"
    - "polar write once memory codes"

Connected through hyperedge HE-6 (induced by source paper "polar codes speed of polarization and polynomial gap to capacity"):
  with members:
    - "finite length scaling for polar codes"
    - "improved bounds on the finite length scaling of polar codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "on the construction of polar codes"
    - "source and channel polarization over finite fields and reed solomon matrices"
    - "polar codes robustness of the successive cancellation decoder with respect to quantization"
    - "capacity achieving multiwrite wom codes"
    - "how to construct polar codes"

Connected through hyperedge HE-7 (induced by source paper "scaling exponent of list decoders with applications to polar codes"):
  with members:
    - "finite length scaling for polar codes"
    - "improved bounds on the finite length scaling of polar codes"
    - "on the correlation between polarized becs"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"
    - "list decoding of polar codes"
    - "information spectrum approach to second order coding rate in channel coding"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "performance of polar codes for channel and source coding"

Connected through hyperedge HE-8 (induced by source paper "spatially coupled ensembles universally achieve capacity under belief propagation"):
  with members:
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "chains of mean field models"
    - "a phenomenological study on threshold improvement via spatial coupling"
    - "wave like solutions of general one dimensional spatially coupled systems"
    - "extended extremes of information combining"
    - "threshold saturation on channels with memory via spatial coupling"
    - "information theoretically optimal compressed sensing via spatial coupling and approximate message passing"

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)