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: "strong converse for a degraded wiretap channel via active hypothesis testing"
  Abstract: We establish an upper bound on the rate of codes for a wiretap channel with public feedback for a fixed probability of error and secrecy parameter. As a corollary, we obtain a strong converse for the capacity of a degraded wiretap channel with public feedback. Our converse proof is based on a reduction of active hypothesis testing for discriminating between two channels to coding for wiretap channel with feedback.

Connected through hyperedge HE-1 (induced by source paper "two way physical layer security protocol for gaussian channels"):
  with members:
    - "semi finite length analysis for information theoretic tasks"
    - "a survey of physical layer security techniques for 5g wireless networks and challenges ahead"
    - "physical layer security for rf satellite channels in the finite length regime"
    - "wiretap channels nonasymptotic fundamental limits"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "secure wireless communication under spatial and local gaussian noise assumptions"
    - "numerical study on secrecy capacity and code length dependence of the performances in optical wiretap channels"
    - "the wiretap channel with generalized feedback secure communication and key generation"

Connected through hyperedge HE-2 (induced by source paper "first and second order asymptotics in covert communication"):
  with members:
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "finite blocklength bounds for wiretap channels"
    - "optimal throughput for covert communication over a classical quantum channel"
    - "a stronger soft covering lemma and applications"
    - "information spectrum approach to strong converse theorems for degraded wiretap channels"
    - "reliable deniable communication hiding messages in noise"
    - "limits of reliable communication with low probability of detection on awgn channels"

Connected through hyperedge HE-3 (induced by source paper "strong converse using change of measure arguments"):
  with members:
    - "a new proof of nonsignalling multiprover parallel repetition theorem"
    - "communication for generating correlation a survey"
    - "communication for generating correlation a unifying survey"
    - "improved finite blocklength converses for slepian wolf coding via linear programming"
    - "second order region for gray wyner network"
    - "strong converses are just edge removal properties"
    - "discrete lossy gray wyner revisited second order asymptotics large and moderate deviations"
    - "wiretap channel capacity secrecy criteria strong converse and phase change"

Connected through hyperedge HE-4 (induced by source paper "semi finite length analysis for information theoretic tasks"):
  with members:
    - "physical layer security for rf satellite channels in the finite length regime"
    - "uniform random number generation from markov chains non asymptotic and asymptotic analyses"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "non asymptotic and asymptotic analyses of information processing on markov chains"
    - "the log volume of optimal codes for memoryless channels asymptotically within a few nats"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "information spectrum approach to second order coding rate in channel coding"
    - "second order asymptotics in fixed length source coding and intrinsic randomness"

Connected through hyperedge HE-5 (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-6 (induced by source paper "wiretap channels nonasymptotic fundamental limits"):
  with members:
    - "exact random coding secrecy exponents for the wiretap channel"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "soft covering with high probability"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "semantic security capacity for wiretap channels of type ii"
    - "a stronger soft covering lemma and applications"
    - "the third order term in the normal approximation for the awgn channel"
    - "converses for secret key agreement and secure computing"

Connected through hyperedge HE-7 (induced by source paper "wiretap channel capacity secrecy criteria strong converse and phase change"):
  with members:
    - "partial strong converse for the non degraded wiretap channel"
    - "information spectrum approach to strong converse theorems for degraded wiretap channels"
    - "strong secrecy from channel resolvability"

Connected through hyperedge HE-8 (induced by source paper "finite blocklength bounds for wiretap channels"):
  with members:
    - "security analysis of varepsilon almost dual universal 2 hash functions smoothing of min entropy versus smoothing of renyi entropy of order 2"
    - "e_ gamma resolvability"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "the third order term in the normal approximation for the awgn channel"
    - "on the secrecy exponent of the wire tap channel"
    - "converses for secret key agreement and secure computing"
    - "information spectrum approach to strong converse theorems for degraded wiretap channels"
    - "bayesian m ary hypothesis testing the meta converse and verd u han bounds are tight"

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)