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: "achieving the capacity of any dmc using only polar codes"
  Abstract: We construct a channel coding scheme to achieve the capacity of any discrete memoryless channel based solely on the techniques of polar coding. In particular, we show how source polarization and randomness extraction via polarization can be employed to “shape” uniformly-distributed i.i.d. random variables into approximate i.i.d. random variables distributed according to the capacity-achieving distribution. We then combine this shaper with a variant of polar channel coding, constructed by the duality with source coding, to achieve the channel capacity. Our scheme inherits the low complexity encoder and decoder of polar coding. It differs conceptually from Gallager's method for achieving capacity, and we discuss the advantages and disadvantages of the two schemes. An application to the AWGN channel is discussed.

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 "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"
    - "improved bounds on the finite length scaling of polar codes"
    - "polar codes for the two user multiple access channel"
    - "moderate deviations in channel coding"

Connected through hyperedge HE-3 (induced by source paper "channel capacity of polar coding with a given polar mismatched successive cancellation decoder"):
  with members:
    - "a simple proof of fast polarization"
    - "on the scaling exponent of polar codes for binary input energy harvesting channels"
    - "a split reduced successive cancellation list decoder for polar codes"
    - "a low latency list successive cancellation decoding implementation for polar codes"
    - "a high throughput list decoder architecture for polar codes"
    - "fast list decoders for polar codes"
    - "symbol decision successive cancellation list decoder for polar codes"
    - "polar coding for processes with memory"

Connected through hyperedge HE-4 (induced by source paper "polar codes and polar lattices for independent fading channels"):
  with members:
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "polar codes for broadcast channels"
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "construction of capacity achieving lattice codes polar lattices"
    - "number field lattices achieve gaussian and rayleigh channel capacity within a constant gap"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "how to achieve the capacity of asymmetric channels"
    - "achieving awgn channel capacity with lattice gaussian coding"

Connected through hyperedge HE-5 (induced by source paper "polar codes for broadcast channels with receiver message side information and noncausal state available at the encoder"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "polar codes for broadcast channels"
    - "asymmetric error correction and flash memory rewriting using polar codes"
    - "polar coding for interference networks"
    - "achieving the uniform rate region of multiple access channels using polar codes"
    - "polar codes for the two user multiple access channel"
    - "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-6 (induced by source paper "on the scaling exponent of polar codes for binary input energy harvesting channels"):
  with members:
    - "non asymptotic achievable rates for energy harvesting channels using save and transmit"
    - "energy harvesting wireless communications a review of recent advances"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "finite length scaling for polar codes"
    - "near optimal energy control and approximate capacity of energy harvesting communication"
    - "how to achieve the capacity of asymmetric channels"
    - "improved bounds on the finite length scaling of polar codes"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"

Connected through hyperedge HE-7 (induced by source paper "extracting wyner s common information using polar codes and polar lattices"):
  with members:
    - "distributed simulation of continuous random variables"
    - "gaussian secure source coding and wyner s common information"
    - "polar lattices for lossy compression"
    - "construction of capacity achieving lattice codes polar lattices"
    - "the lossy common information of correlated sources"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "achieving awgn channel capacity with lattice gaussian coding"
    - "how to construct polar codes"

Connected through hyperedge HE-8 (induced by source paper "on the capacity of the beta binomial channel model for multi level cell flash memories"):
  with members:
    - "on the capacity of multilevel nand flash memory channels"
    - "channel models for multi level cell flash memories based on empirical error analysis"
    - "how to achieve the capacity of asymmetric channels"
    - "list decoding of polar codes"
    - "how to construct polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input 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)