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 "secret key generation from sparse wireless channels ergodic capacity and secrecy outage"):
  Abstract: This paper investigates generation of a secret key from a reciprocal wireless channel. In particular we consider wireless channels that exhibit sparse structure in the wideband regime and the impact of the sparsity on the secret key capacity. We explore this problem in two steps. First, we study key generation from a state-dependent discrete memoryless multiple source. The state of source captures the effect of channel sparsity. Secondly, we consider a wireless channel model that captures channel sparsity and correlation between the legitimate users' channel and the eavesdropper's channel. Such dependency can significantly reduce the secret key capacity. #R##N#According to system delay requirements, two performance measures are considered: (i) ergodic secret key capacity and (ii) outage probability. We show that in the wideband regime when a white sounding sequence is adopted, a sparser channel can achieve a higher ergodic secret key rate than a richer channel can. For outage performance, we show that if the users generate secret keys at a fraction of the ergodic capacity, the outage probability will decay exponentially in signal bandwidth. Moreover, a larger exponent is achieved by a richer channel.

Includes members:
  Member "key generation using external source excitation capacity reliability and secrecy exponent":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "equivocations exponents and second order coding rates under various r enyi information measures")
  Member "secret key agreement with channel state information at the transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "key and message semantic security over state dependent channels")
  Member "exponential decreasing rate of leaked information in universal random privacy amplification":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "communication for generating correlation a unifying survey")
  Member "secrecy outage capacity of fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal power allocation in block fading gaussian channels with causal csi and secrecy constraints")
  Member "information theoretically secret key generation for fading wireless channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "covert secret key generation with an active warden")
  Member "on the throughput of secure hybrid arq protocols for gaussian block fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "tradeoff between delay and physical layer security in wireless networks")
  Member "necessary and sufficient conditions for sparsity pattern recovery":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "harmless interpolation of noisy data in regression")
  Member "capacity of sparse multipath channels in the ultra wideband regime":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "capacity scaling in a non coherent wideband massive simo block fading channel")

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.CR(Cryptography and Security)