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 "hierarchical polar coding for achieving secrecy over fading wiretap channels without any instantaneous csi"):
  Abstract: This paper presents a polar coding scheme to achieve secrecy in block fading binary symmetric wiretap channels without the knowledge of instantaneous channel state information (CSI) at the transmitter. For this model, a coding scheme that hierarchically utilizes polar codes is presented. In particular, on polarization of different binary symmetric channels over different fading blocks, each channel use is modeled as an appropriate binary erasure channel over fading blocks. Polar codes are constructed for both coding over channel uses for each fading block and coding over fading blocks for certain channel uses. In order to guarantee security, random bits are introduced at appropriate places to exhaust the observations of the eavesdropper. It is shown that this coding scheme, without instantaneous CSI at the transmitter, is secrecy capacity achieving for the simultaneous fading scenario. For the independent fading case, the capacity is achieved when the fading realizations for the eavesdropper channel is always degraded with respect to the receiver. For the remaining cases, the gap is analyzed by comparing lower and upper bounds. Remarkably, for the scenarios where the secrecy capacity is achieved, the results imply that instantaneous CSI does not increase the secrecy capacity.

Includes members:
  Member "polar coding for secure transmission in miso fading wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an overview of physical layer security with finite alphabet signaling")
  Member "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "polar coding for the general wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secure polar coding with delayed wiretapping information")
  Member "polar coding for the broadcast channel with confidential messages and constrained randomization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coding schemes for achieving strong secrecy at negligible cost")
  Member "polar coding for secret key generation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "polar coding for fading channels binary and exponential channel cases":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes over fading channels with power and delay constraints")
  Member "achieving the secrecy capacity of wiretap channels using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "nested polar codes for wiretap and relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "sign bit shaping using polar codes")

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)