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 degraded poisson wiretap channel"
  Abstract: Providing security guarantees for wireless communication is critically important for today's applications. While previous work in this area has concentrated on radio frequency (RF) channels, providing security guarantees for RF channels is inherently difficult because they are prone to rapid variations due small scale fading. Wireless optical communication, on the other hand, is inherently more secure than RF communication due to the intrinsic aspects of the signal propagation in the optical and near-optical frequency range. In this paper, secure communication over wireless optical links is examined by studying the secrecy capacity of a direct detection system. For the degraded Poisson wiretap channel, a closed-form expression of the secrecy capacity is given. A complete characterization of the general rate-equivocation region is also presented. For achievability, an optimal code is explicitly constructed by using the structured code designed by Wyner for the Poisson channel. The converse is proved in two different ways: the first method relies only on simple properties of the conditional expectation and basic information theoretical inequalities, whereas the second method hinges on the recent link established between minimum mean square estimation and mutual information in Poisson channels.

Connected through hyperedge HE-1 (induced by source paper "physical layer security protocol for poisson channels for passive man in the middle attack"):
  with members:
    - "two way physical layer security protocol for gaussian channels"
    - "physical layer security for rf satellite channels in the finite length regime"
    - "signal detection under short interval sampling of continuous waveforms for optical wireless scattering communication"
    - "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"
    - "5g wireless backhaul networks challenges and research advances"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"

Connected through hyperedge HE-2 (induced by source paper "statistical non linear model achievable rates and signal detection for photon level photomultiplier receiver"):
  with members:
    - "characterization on practical photon counting receiver in optical scattering communication"

Connected through hyperedge HE-3 (induced by source paper "the stochastic calculus approach to multi receiver poisson channels"):
  with members:
    - "superposition coding is almost always optimal for the poisson broadcast channel"

Connected through hyperedge HE-4 (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"
    - "key generation using external source excitation capacity reliability and secrecy exponent"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"

Connected through hyperedge HE-5 (induced by source paper "information spectrum approach to strong converse theorems for degraded wiretap channels"):
  with members:
    - "converses for secret key agreement and secure computing"
    - "strong converse and second order asymptotics of channel resolvability"
    - "secret key agreement general capacity and second order asymptotics"
    - "second order coding rates for channels with state"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"
    - "fixed error asymptotics for erasure and list decoding"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "how many queries will resolve common randomness"

Connected through hyperedge HE-6 (induced by source paper "reliability and secrecy functions of the wiretap channel under cost constraint"):
  with members:
    - "effective secrecy reliability confusion and stealth"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "strong secrecy from channel resolvability"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

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)