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: "success exponent of wiretapper a tradeoff between secrecy and reliability"
  Abstract: Equivocation rate has been widely used as an information-theoretic measure of security after Shannon[10]. It simplifies problems by removing the effect of atypical behavior from the system. In [9], however, Merhav and Arikan considered the alternative of using guessing exponent to analyze the Shannon's cipher system. Because guessing exponent captures the atypical behavior, the strongest expressible notion of secrecy requires the more stringent condition that the size of the key, instead of its entropy rate, to be equal to the size of the message. The relationship between equivocation and guessing exponent are also investigated in [6][7] but it is unclear which is a better measure, and whether there is a unifying measure of security. #R##N#Instead of using equivocation rate or guessing exponent, we study the wiretap channel in [2] using the success exponent, defined as the exponent of a wiretapper successfully learn the secret after making an exponential number of guesses to a sequential verifier that gives yes/no answer to each guess. By extending the coding scheme in [2][5] and the converse proof in [4] with the new Overlap Lemma 5.2, we obtain a tradeoff between secrecy and reliability expressed in terms of lower bounds on the error and success exponents of authorized and respectively unauthorized decoding of the transmitted messages. #R##N#From this, we obtain an inner bound to the region of strongly achievable public, private and guessing rate triples for which the exponents are strictly positive. The closure of this region is equivalent to the closure of the region in Theorem 1 of [2] when we treat equivocation rate as the guessing rate. However, it is unclear if the inner bound is tight.

Connected through hyperedge HE-1 (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"
    - "the sender excited secret key agreement model capacity reliability and secrecy exponents"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "secrecy rate region of the broadcast channel with an eavesdropper"):
  with members:
    - "interference assisted secret communication"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "capacity bounds for broadcast channels with confidential messages"
    - "the wiretap channel with feedback encryption over the channel"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"
    - "on the secure degrees of freedom in the k user gaussian interference channel"
    - "an extremal inequality motivated by multiterminal information theoretic problems"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-3 (induced by source paper "the secrecy rate region of the broadcast channel"):
  with members:
    - "interference assisted secret communication"
    - "capacity bounds for broadcast channels with confidential messages"
    - "on the secure degrees of freedom in the k user gaussian interference channel"
    - "secure communication over fading channels"
    - "secrecy capacity of the wiretap channel with noisy feedback"
    - "an extremal inequality motivated by multiterminal information theoretic problems"
    - "on the secrecy capacity of fading channels"
    - "relay channels with confidential messages"

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)