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: "the sender excited secret key agreement model capacity reliability and secrecy exponents"
  Abstract: We consider the secret key generation problem when sources are randomly excited by the sender and there is a noiseless public discussion channel. Our setting is thus similar to recent works on channels with action-dependent states where the channel state may be influenced by some of the parties involved. We derive single-letter expressions for the secret key capacity through a type of source emulation analysis. We also derive lower bounds on the achievable reliability and secrecy exponents, i.e., the exponential rates of decay of the probability of decoding error and of the information leakage. These exponents allow us to determine a set of strongly-achievable secret key rates. For degraded eavesdroppers the maximum strongly-achievable rate equals the secret key capacity; our exponents can also be specialized to previously known results. #R##N#In deriving our strong achievability results we introduce a coding scheme that combines wiretap coding (to excite the channel) and key extraction (to distill keys from residual randomness). The secret key capacity is naturally seen to be a combination of both source- and channel-type randomness. Through examples we illustrate a fundamental interplay between the portion of the secret key rate due to each type of randomness. We also illustrate inherent tradeoffs between the achievable reliability and secrecy exponents. Our new scheme also naturally accommodates rate limits on the public discussion. We show that under rate constraints we are able to achieve larger rates than those that can be attained through a pure source emulation strategy.

Connected through hyperedge HE-1 (induced by source paper "exact random coding secrecy exponents for the wiretap channel"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "soft covering with high probability"
    - "on the secrecy exponent of the wire tap channel"
    - "exact random coding error exponents of optimal bin index decoding"
    - "informational divergence approximations to product distributions"
    - "effective secrecy reliability confusion and stealth"
    - "tight exponential analysis of universally composable privacy amplification and its applications"
    - "distributed channel synthesis"

Connected through hyperedge HE-2 (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"
    - "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"
    - "on the dispersions of three network information theory problems"

Connected through hyperedge HE-3 (induced by source paper "secret key agreement with large antenna arrays under the pilot contamination attack"):
  with members:
    - "secure transmission in multi cell massive mimo systems"
    - "secrecy sum rates for multi user mimo regularized channel inversion precoding"
    - "exploiting channel diversity in secret key generation from multipath fading randomness"
    - "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "channel estimation and linear precoding in multiuser multiple antenna tdd systems"
    - "polar coding for secure transmission and key agreement"
    - "nested polar codes for wiretap and relay channels"

Connected through hyperedge HE-4 (induced by source paper "full duplex vs half duplex secret key generation"):
  with members:
    - "key capacity with limited one way communication for product sources"
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "full duplex transceiver system calculations analysis of adc and linearity challenges"
    - "rate gain region and design tradeoffs for full duplex wireless communications"
    - "multiaccess channel with partially cooperating encoders and security constraints"
    - "separation of reliability and secrecy in rate limited secret key generation"
    - "exploiting channel diversity in secret key generation from multipath fading randomness"
    - "secret key agreement from correlated gaussian sources by rate limited public communication"

Connected through hyperedge HE-5 (induced by source paper "on the secrecy exponent of the wire tap channel"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "exact random coding error exponents of optimal bin index decoding"
    - "informational divergence approximations to product distributions"
    - "effective secrecy reliability confusion and stealth"
    - "reliability and secrecy functions of the wiretap channel under cost constraint"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "universally attainable error and information exponents and equivocation rate for the broadcast channels with confidential messages"
    - "strong secrecy from channel resolvability"

Connected through hyperedge HE-6 (induced by source paper "exact correct decoding exponent of the wiretap channel decoder"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "exact random coding error exponents of optimal bin index decoding"
    - "tight exponential analysis of universally composable privacy amplification and its applications"
    - "codeword or noise exact random coding exponents for slotted asynchronism"
    - "a cryptographic treatment of the wiretap channel"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "success exponent of wiretapper a tradeoff between secrecy and reliability"

Connected through hyperedge HE-7 (induced by source paper "exploiting channel diversity in secret key generation from multipath fading randomness"):
  with members:
    - "key generation using external source excitation capacity reliability and secrecy exponent"
    - "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)