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: "on the correlation between polarized becs"
  Abstract: We consider the 2n channels synthesized by the n-fold application of Arikan's polar transform to a binary erasure channel (BEC). The synthetic channels are BECs themselves, and we show that, asymptotically for almost all these channels, the pairwise correlations between their erasure events are extremely small: the correlation coefficients vanish faster than any exponential in n. Such a fast decay of correlations allows us to conclude that the union bound on the block error probability of polar codes is very tight.

Connected through hyperedge HE-1 (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"
    - "improved bounds on the finite length scaling of polar codes"
    - "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-2 (induced by source paper "faulty successive cancellation decoding of polar codes for the binary erasure channel"):
  with members:
    - "analysis and design of finite alphabet iterative decoders robust to faulty hardware"
    - "density evolution and functional threshold for the noisy min sum decoder"
    - "density evolution for min sum decoding of ldpc codes under unreliable message storage"
    - "polar codes robustness of the successive cancellation decoder with respect to quantization"
    - "hardware architectures for successive cancellation decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "performance of ldpc codes under faulty iterative decoding"

Connected through hyperedge HE-3 (induced by source paper "polar coding for the large hadron collider challenges in code concatenation"):
  with members:
    - "a correlation breaking interleaving of polar codes"
    - "a low complexity improved successive cancellation decoder for polar codes"
    - "list decoding of polar codes"
    - "on the construction of polar codes"
    - "how to construct polar codes"
    - "concatenated polar codes"

Connected through hyperedge HE-4 (induced by source paper "a lower bound on the probability of error of polar codes over bms channels"):
  with members:
    - "fast polarization for processes with memory"
    - "polar coding for processes with memory"
    - "list decoding of polar codes"
    - "how to construct polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-5 (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"
    - "scaling exponent of list decoders with applications to polar codes"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"

Connected through hyperedge HE-6 (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"
    - "scaling exponent of list decoders with applications to polar codes"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"
    - "universal bounds on the scaling behavior of polar codes"

Connected through hyperedge HE-7 (induced by source paper "enabling complexity performance trade offs for successive cancellation decoding of polar codes"):
  with members:
    - "density evolution for min sum decoding of ldpc codes under unreliable message storage"
    - "on the construction of polar codes"
    - "polar codes robustness of the successive cancellation decoder with respect to quantization"
    - "how to construct polar codes"
    - "the multiobjective multidimensional knapsack problem a survey and a new approach"
    - "hardware architectures for successive cancellation decoding of polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "performance of ldpc codes under faulty iterative decoding"

Connected through hyperedge HE-8 (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"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"
    - "universal bounds on the scaling behavior of polar codes"
    - "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"

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)