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: "polar coding for fading channels binary and exponential channel cases"
  Abstract: This work presents a polar coding scheme for fading channels, focusing primarily on fading binary symmetric and additive exponential noise channels. For fading binary symmetric channels, a hierarchical coding scheme is presented, utilizing polar coding both over channel uses and over fading blocks. The receiver uses its channel state information (CSI) to distinguish states, thus constructing an overlay erasure channel over the underlying fading channels. By using this scheme, the capacity of a fading binary symmetric channel is achieved without CSI at the transmitter. Noting that a fading AWGN channel with BPSK modulation and demodulation corresponds to a fading binary symmetric channel, this result covers a fairly large set of practically relevant channel settings. #R##N#For fading additive exponential noise channels, expansion coding is used in conjunction to polar codes. Expansion coding transforms the continuous-valued channel to multiple (independent) discrete-valued ones. For each level after expansion, the approach described previously for fading binary symmetric channels is used. Both theoretical analysis and numerical results are presented, showing that the proposed coding scheme approaches the capacity in the high SNR regime. Overall, utilizing polar codes in this (hierarchical) fashion enables coding without CSI at the transmitter, while approaching the capacity with low complexity.

Connected through hyperedge HE-1 (induced by source paper "polar codes over fading channels with power and delay constraints"):
  with members:
    - "polar coding for block fading channels"
    - "an interleaver design for polar codes over slow fading channels"
    - "polar codes and polar lattices for independent fading channels"
    - "ber performance of polar coded ofdm in multipath fading"
    - "a comparative study of polar code constructions for the awgn channel"
    - "optimum power control at finite blocklength"
    - "list decoding of polar codes"
    - "how to construct polar codes"

Connected through hyperedge HE-2 (induced by source paper "multilevel code construction for compound fading channels"):
  with members:
    - "polar codes and polar lattices for independent fading channels"
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "universal polar codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"

Connected through hyperedge HE-3 (induced by source paper "polar coding for block fading channels"):
  with members:
    - "polar codes and polar lattices for independent fading channels"

Connected through hyperedge HE-4 (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-5 (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-6 (induced by source paper "an interleaver design for polar codes over slow fading channels"):
  with members:
    - "ber performance of polar coded ofdm in multipath fading"
    - "a h arq scheme for polar codes"

Connected through hyperedge HE-7 (induced by source paper "hierarchical polar coding for achieving secrecy over fading wiretap channels without any instantaneous csi"):
  with members:
    - "polar coding for secure transmission in miso fading wiretap channels"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the general wiretap channel"
    - "polar coding for the broadcast channel with confidential messages and constrained randomization"
    - "polar coding for secret key generation"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "nested polar codes for wiretap and relay channels"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-8 (induced by source paper "polar coding for secure transmission in miso fading wiretap channels"):
  with members:
    - "nested polar codes for wiretap and relay channels"
    - "strong secrecy for erasure wiretap 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)