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 "secrecy transmission on block fading channels theoretical limits and performance of practical codes"):
  Abstract: We consider a system where an agent (Alice) aims at transmitting a message to a second agent (Bob), while keeping a third agent (Eve) in the dark, by using physical layer techniques. For a transmission over frequency non selective block fading channels, we assume that Alice perfectly knows the channel with respect to Bob, but she has only a statistical knowledge of the channel with respect to Eve. We derive bounds on the achievable outage secrecy rates, considering messages spanning either one or many fading blocks. Transmit power is adapted to fading conditions, with a constraint on the average power over the entire transmission. We also focus on the maximum cumulative outage secrecy rate that can be achieved. In order to assess the performance in a practical scenario, we consider transmissions encoded with practical error correcting codes. In particul ar, we extend the definitions of both security gap and equivocation rate ‐ previously applied to the additive white Gaussian noise channel ‐ to fading channels, taking into account the error rate targets. Bound s on these performance metrics are derived for a block Rayleigh fading channel. Numerical results are provided, confirming the feasibility of the considered physical layer security techniques.

Includes members:
  Member "on secrecy capacity of fast fading multiple input wiretap channels with statistical csit":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "almost universal codes for fading wiretap channels")
  Member "a physical layer secured key distribution technique for ieee 802 11g wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "practical ldpc coded modulation schemes for the fading broadcast channel with confidential messages")
  Member "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey of physical layer security techniques for 5g wireless networks and challenges ahead")
  Member "on secrecy rate of the generalized artificial noise assisted secure beamforming for wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "physical layer security in the finite blocklength regime over fading channels")
  Member "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ldpc codes over gaussian multiple access wiretap channel")
  Member "increasing physical layer security through scrambled codes and arq":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "practical ldpc coded modulation schemes for the fading broadcast channel with confidential messages")
  Member "rethinking the secrecy outage formulation a secure transmission design perspective":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secrecy transmission in large scale uav enabled wireless networks")
  Member "achieving the secrecy capacity of wiretap channels using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "explicit codes for the wiretap channel a unified design framework")

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)