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: "reliability and secrecy functions of the wiretap channel under cost constraint"
  Abstract: The wiretap channel has been devised and studied first by Wyner, and subsequently extended to the case with non-degraded general wiretap channels by Csiszar and Korner. Focusing mainly on the Poisson wiretap channel with cost constraint, we newly introduce the notion of reliability and security functions as a fundamental tool to analyze and/or design the performance of an efficient wiretap channel system. Compact formulae for those functions are explicitly given for stationary memoryless wiretap channels. It is also demonstrated that, based on such a pair of reliability and security functions, we can control the tradeoff between reliability and security (usually conflicting), both with exponentially decreasing rates as block length n becomes large. Two ways to do so are given on the basis of concatenation and rate exchange. In this framework, the notion of the {\delta} secrecy capacity is defined and shown to attain the strongest security standard among others. The maximized vs. averaged security measures is also discussed.

Connected through hyperedge HE-1 (induced by source paper "covert communication over a k user multiple access channel"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "embedding covert information in broadcast communications"
    - "cooperative resolvability and secrecy in the cribbing multiple access channel"
    - "multilevel coded pulse position modulation for covert communications over binary input discrete memoryless channels"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "time division transmission is optimal for covert communication over broadcast channels"
    - "covert wireless communication with artificial noise generation"
    - "mac resolvability first and second order results"

Connected through hyperedge HE-2 (induced by source paper "physical layer security for rf satellite channels in the finite length regime"):
  with members:
    - "two way physical layer security protocol for gaussian channels"
    - "free space optical channel estimation for physical layer security"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "information theoretic physical layer security for satellite channels"
    - "empirical and strong coordination via soft covering with polar codes"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "secure wireless communication under spatial and local gaussian noise assumptions"
    - "joint power control in wiretap interference channels"

Connected through hyperedge HE-3 (induced by source paper "operational interpretation of renyi information measures via composite hypothesis testing against product and markov distributions"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "two measures of dependence"
    - "uniform random number generation from markov chains non asymptotic and asymptotic analyses"
    - "equivocations exponents and second order coding rates under various r enyi information measures"
    - "universal channel coding for exponential family of channels"
    - "universal channel coding for general output alphabet"
    - "converses for secret key agreement and secure computing"
    - "encoding tasks and renyi entropy"

Connected through hyperedge HE-4 (induced by source paper "a correlation measure based on vector valued l_p norms"):
  with members:
    - "exact exponent for soft covering"
    - "exact soft covering exponent"
    - "generalizing bottleneck problems"
    - "measuring secrecy by the probability of a successful guess"
    - "r enyi resolvability and its applications to the wiretap channel"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "a large deviations approach to secure lossy compression"
    - "f divergence inequalities"

Connected through hyperedge HE-5 (induced by source paper "simulation of random variables under r enyi divergence measures of all orders"):
  with members:
    - "on exact and infty r enyi common informations"
    - "asymptotic coupling and its applications in information theory"
    - "renyi differential privacy"
    - "differential privacy as a mutual information constraint"
    - "renyi divergence and kullback leibler divergence"
    - "privacy against statistical inference"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "general classes of lower bounds on the probability of error in multiple hypothesis testing"

Connected through hyperedge HE-6 (induced by source paper "wiretap and gelfand pinsker channels analogy and its applications"):
  with members:
    - "the likelihood encoder for lossy compression"
    - "wiretap channels with random states non causally available at the encoder"
    - "capacity of the state dependent wiretap channel secure writing on dirty paper"
    - "analogy between gambling and measurement based work extraction"
    - "duality of a source coding problem and the semi deterministic broadcast channel with rate limited cooperation"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "on state dependent broadcast channels with cooperation"

Connected through hyperedge HE-7 (induced by source paper "r enyi resolvability and its applications to the wiretap channel"):
  with members:
    - "corrections to wyner s common information under r enyi divergence measures"
    - "exact channel synthesis"
    - "asymptotic coupling and its applications in information theory"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "analysis of remaining uncertainties and exponents under various conditional r e nyi entropies"
    - "strong converse theorems for classes of multimessage multicast networks a renyi divergence approach"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "distributed simulation of continuous random variables"

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

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)