human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "polar codes over fading channels with power and delay constraints"):
  Abstract: The inherent nature of polar codes being channel specific makes it difficult to use them in a setting where the communication channel changes with time. In particular, to be able to use polar codes in a wireless scenario, varying attenuation due to fading needs to be mitigated. To the best of our knowledge, there has been no comprehensive work in this direction thus far. In this work, a practical scheme involving channel inversion with the knowledge of the channel state at the transmitter, is proposed. An additional practical constraint on the permissible average and peak power is imposed, which in turn makes the channel equivalent to an additive white Gaussian noise (AWGN) channel cascaded with an erasure channel. It is shown that the constructed polar code could be made to achieve the symmetric capacity of this channel. Further, a means to compute the optimal design rate of the polar code for a given power constraint is also discussed.

Includes members:
  Member "polar coding for block fading channels":
    also connected through other hyperedges:
      (none)
  Member "an interleaver design for polar codes over slow fading channels":
    also connected through other hyperedges:
      (none)
  Member "polar codes and polar lattices for independent fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "markov chain monte carlo methods for lattice gaussian sampling convergence analysis and enhancement")
  Member "ber performance of polar coded ofdm in multipath fading":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an interleaver design for polar codes over slow fading channels")
  Member "a comparative study of polar code constructions for the awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "optimum power control at finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "polar coding for fading channels binary and exponential channel cases":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multilevel code construction for compound fading channels")
  Member "list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes and their quantum domain counterparts")

Question: Please tell me which class the source paper 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)