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 "physical layer security for rf satellite channels in the finite length regime"):
  Abstract: Secure communications is becoming increasingly relevant in the development of space technology. Well established cryptographic technology is already in place and is expected to continue to be so. On the other hand, information theoretical security emerges as a post-quantum versatile candidate to complement overall security strength. In order to prove such potential, performance analysis methods are needed that consider realistic legitimate and eavesdropper system assumptions and non-asymptotic coding lengths. In this paper we propose the design of secure radio frequency (RF) satellite links with realistic system assumptions. Our contribution is three-fold. First, we propose a wiretap channel model for the finite-length regime. The model includes an stochastic wiretap encoding method using existing practical linear error correcting codes and hash codes. Secrecy is provided with privacy amplification, for which the finite-length secrecy metric is given that upper bounds semantic secrecy. Second, we derive a novel RF (broadcast) satellite wiretap channel model that parameterizes the stochastic degraded channel around the legitimate channel, a necessary condition to enable secure communication. Finally, we show the design of a secure satellite physical layer and finite-length performance evaluation. In doing so, we define as sacrifice rate the fixed fraction of the overall coding rate budget for reliability that needs to be allocated to secrecy. Our methodology does not make use of channel side information of the eavesdropper, only assumes worst case system assumptions. We illustrate our proposed design method with numerical results using practical error correcting codes in current standards of satellite communication.

Includes members:
  Member "two way physical layer security protocol for gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "physical layer security protocol for poisson channels for passive man in the middle attack")
  Member "free space optical channel estimation for physical layer security":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance analysis of fso communications under los blockage")
  Member "secure multiplex coding with dependent and non uniform multiple messages":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exact exponent for soft covering")
  Member "information theoretic physical layer security for satellite channels":
    also connected through other hyperedges:
      (none)
  Member "empirical and strong coordination via soft covering with polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "two way physical layer security protocol for gaussian channels")
  Member "secure wireless communication under spatial and local gaussian noise assumptions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "two way physical layer security protocol for gaussian channels")
  Member "joint power control in wiretap interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure transmission of delay sensitive data over wireless fading channels")

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)