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: "multilevel polarization of polar codes over arbitrary discrete memoryless channels"
  Abstract: It is shown that polar codes achieve the symmetric capacity of discrete memoryless channels with arbitrary input alphabet sizes. It is shown that in general, channel polarization happens in several, rather than only two levels so that the synthesized channels are either useless, perfect or "partially perfect". Any subset of the channel input alphabet which is closed under addition, induces a coset partition of the alphabet through its shifts. For any such partition of the input alphabet, there exists a corresponding partially perfect channel whose outputs uniquely determine the coset to which the channel input belongs. By a slight modification of the encoding and decoding rules, it is shown that perfect transmission of certain information symbols over partially perfect channels is possible. Our result is general regarding both the cardinality and the algebraic structure of the channel input alphabet; i.e we show that for any channel input alphabet size and any Abelian group structure on the alphabet, polar codes are optimal. It is also shown through an example that polar codes when considered as group/coset codes, do not achieve the capacity achievable using coset codes over arbitrary channels.

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 "fourier analysis of mac polarization"):
  with members:
    - "ergodic theory meets polarization ii a foundation of polarization theory"
    - "polar codes for arbitrary dmcs and arbitrary macs"
    - "polar codes for the two user multiple access channel"
    - "polar codes for q ary channels q 2 r"
    - "polar codes for the m user mac"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polarization for arbitrary discrete memoryless channels"
    - "on the rate of channel polarization"

Connected through hyperedge HE-3 (induced by source paper "a generalized erasure channel in the sense of polarization for binary erasure channels"):
  with members:
    - "ergodic theory meets polarization ii a foundation of polarization theory"
    - "polar codes for arbitrary dmcs and arbitrary macs"
    - "source and channel polarization over finite fields and reed solomon matrices"
    - "polar codes for q ary channels q 2 r"
    - "how to construct polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polarization for arbitrary discrete memoryless channels"

Connected through hyperedge HE-4 (induced by source paper "polar codes for broadcast channels"):
  with members:
    - "achieving marton s region for broadcast channels using polar codes"
    - "a comparison of superposition coding schemes"
    - "polar codes for the two user multiple access channel"
    - "evaluation of marton s inner bound for the general broadcast channel"
    - "polar codes for q ary channels q 2 r"
    - "how to construct polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"

Connected through hyperedge HE-5 (induced by source paper "challenges and some new directions in channel coding"):
  with members:
    - "soft decision decoding of reed muller codes recursive lists"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "non binary ldpc decoding using truncated messages in the walsh hadamard domain"
    - "expectation propagation for approximate bayesian inference"
    - "a proof of threshold saturation for spatially coupled ldpc codes on bms channels"
    - "universal polar codes"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"

Connected through hyperedge HE-6 (induced by source paper "on the error performance of systematic polar codes"):
  with members:
    - "improved successive cancellation decoding of polar codes"
    - "list decoding of polar codes"
    - "polar codes for the two user multiple access channel"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "a practical approach to polar codes"
    - "non binary polar codes using reed solomon codes and algebraic geometry codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"
    - "performance of polar codes for channel and source coding"

Connected through hyperedge HE-7 (induced by source paper "on the symmetry of polar codes for symmetric binary input discrete memoryless channels"):
  with members:
    - "non binary polar codes using reed solomon codes and algebraic geometry codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"
    - "polar codes characterization of exponent bounds and constructions"
    - "polarization for arbitrary discrete memoryless channels"

Connected through hyperedge HE-8 (induced by source paper "direct polarization for q ary source and channel coding"):
  with members:
    - "nested polar codes for wiretap and relay channels"
    - "polarization for arbitrary discrete memoryless channels"

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)