human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "key generation using external source excitation capacity reliability and secrecy exponent"
  Abstract: We study the fundamental limits to secret key generation from an excited distributed source (EDS). In an EDS, a pair of terminals observe dependent sources of randomness excited by a pre-arranged signal. We first determine the secret key capacity for such systems with one-way public messaging. We then characterize a tradeoff between the secret key rate and exponential bounds on the probability of key agreement failure and on the secrecy of the key generated. We find that there is a fundamental tradeoff between reliability and secrecy. We then explore this framework within the context of reciprocal wireless channels. In this setting, the users transmit pre-arranged excitation signals to each other. When the fading is Rayleigh, the observations of the users are jointly Gaussian sources. We show that an on-off excitation signal with an signal-to-noise ratio (SNR)-dependent duty cycle achieves the secret key capacity of this system. Furthermore, we characterize a fundamental metric - minimum energy per key bit for reliable key generation - and show that in contrast to conventional AWGN channels, there is a nonzero threshold SNR that achieves the minimum energy per key bit. The capacity achieving on-off excitation signal achieves the minimum energy per key bit at any SNR below the threshold. Finally, we build off our error exponent results to investigate the energy required to generate a key using a finite block length. Again we find that on-off excitation signals yield an improvement when compared to constant excitation signals. In addition to Rayleigh fading, we analyze the performance of a system based on binary channel phase quantization.

Connected through hyperedge HE-1 (induced by source paper "equivocations exponents and second order coding rates under various r enyi information measures"):
  with members:
    - "operational interpretation of renyi information measures via composite hypothesis testing against product and markov distributions"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "security analysis of varepsilon almost dual universal 2 hash functions smoothing of min entropy versus smoothing of renyi entropy of order 2"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "the sender excited secret key agreement model capacity reliability and secrecy exponents"
    - "on the secrecy exponent of the wire tap channel"
    - "asymmetric evaluations of erasure and undetected error probabilities"
    - "second order coding rates for channels with state"

Connected through hyperedge HE-2 (induced by source paper "the sender excited secret key agreement model capacity reliability and secrecy exponents"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "on the dispersions of three network information theory problems"
    - "secret key agreement with channel state information at the transmitter"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "strong secrecy from channel resolvability"
    - "wiretap channel with causal state information"
    - "lecture notes on network information theory"
    - "strongly secure privacy amplification cannot be obtained by encoder of slepian wolf code"

Connected through hyperedge HE-3 (induced by source paper "numerical study on secrecy capacity and code length dependence of the performances in optical wiretap channels"):
  with members:
    - "reliability and secrecy functions of the wiretap channel under cost constraint"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "the degraded poisson wiretap channel"

Connected through hyperedge HE-4 (induced by source paper "secret key generation from sparse wireless channels ergodic capacity and secrecy outage"):
  with members:
    - "secret key agreement with channel state information at the transmitter"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "secrecy outage capacity of fading channels"
    - "information theoretically secret key generation for fading wireless channels"
    - "on the throughput of secure hybrid arq protocols for gaussian block fading channels"
    - "necessary and sufficient conditions for sparsity pattern recovery"
    - "capacity of sparse multipath channels in the ultra wideband regime"

Connected through hyperedge HE-5 (induced by source paper "exploiting channel diversity in secret key generation from multipath fading randomness"):
  with members:
    - "the sender excited secret key agreement model capacity reliability and secrecy exponents"
    - "information theoretically secret key generation for fading wireless channels"
    - "fingerprints in the ether using the physical layer for wireless authentication"
    - "using the physical layer for wireless authentication in time variant channels"

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