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: "wiretap channels nonasymptotic fundamental limits"
  Abstract: This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than existing bounds, and lead to the tightest bounds on the second-order coding rate for discrete memoryless and Gaussian wiretap channels. The exact second-order coding rate is established for semi-deterministic wiretap channels, which characterizes the optimal tradeoff between reliability and secrecy in the finite-blocklength regime. Underlying our achievability bounds are two new privacy amplification results, which not only refine the existing results, but also achieve stronger notions of secrecy.

Connected through hyperedge HE-1 (induced by source paper "resource allocation for secure multi user downlink miso urllc systems"):
  with members:
    - "secure short packet communications for mission critical iot applications"
    - "resource allocation for multi user downlink miso ofdma urllc systems"
    - "resource allocation for multi user downlink urllc ofdma systems"
    - "ultra reliable and low latency wireless communication tail risk and scale"
    - "robust and secure resource allocation for full duplex miso multicarrier noma systems"
    - "coding in the finite blocklength regime bounds based on laplace integrals and their asymptotic approximations"
    - "optimal joint power and subcarrier allocation for full duplex multicarrier non orthogonal multiple access systems"
    - "energy efficient packet scheduling with finite blocklength codes convexity analysis and efficient algorithms"

Connected through hyperedge HE-2 (induced by source paper "communication for generating correlation a unifying survey"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "exact exponent for soft covering"
    - "exact channel synthesis"
    - "strong converse using change of measure arguments"
    - "coding for positive rate in the source model key agreement problem"
    - "channel resolvability theorems for general sources and channels"
    - "strong functional representation lemma and applications to coding theorems"
    - "resource efficient common randomness and secret key schemes"

Connected through hyperedge HE-3 (induced by source paper "communication for generating correlation a survey"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "exact soft covering exponent"
    - "on exact and infty r enyi common informations"
    - "exact channel synthesis"
    - "strong converse using change of measure arguments"
    - "coding for positive rate in the source model key agreement problem"
    - "channel resolvability theorems for general sources and channels"
    - "exact random coding secrecy exponents for the wiretap channel"

Connected through hyperedge HE-4 (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"
    - "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"
    - "secret key agreement general capacity and second order asymptotics"

Connected through hyperedge HE-5 (induced by source paper "secure short packet communications for mission critical iot applications"):
  with members:
    - "short packet downlink transmission with non orthogonal multiple access"
    - "joint sum rate and error probability optimization finite blocklength analysis"
    - "finite blocklength bounds for wiretap channels"
    - "massive machine type communications in 5g physical and mac layer solutions"
    - "finite block length analysis of the incremental redundancy harq"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "ultra reliable communication in 5g wireless systems"
    - "non asymptotic output statistics of random binning and its applications"

Connected through hyperedge HE-6 (induced by source paper "on privacy amplification lossy compression and their duality to channel coding"):
  with members:
    - "uniform random number generation from markov chains non asymptotic and asymptotic analyses"
    - "alignment of polarized sets"
    - "e_ gamma resolvability"
    - "approaching the rate distortion limit with spatial coupling belief propagation and decimation"
    - "non asymptotic output statistics of random binning and its applications"
    - "tight exponential analysis of universally composable privacy amplification and its applications"
    - "non asymptotic analysis of privacy amplification via renyi entropy and inf spectral entropy"
    - "fixed length lossy compression in the finite blocklength regime"

Connected through hyperedge HE-7 (induced by source paper "secure communications for the two user broadcast channel with random traffic"):
  with members:
    - "exploiting full duplex receivers for achieving secret communications in multiuser miso networks"
    - "on secrecy metrics for physical layer security over quasi static fading channels"
    - "probabilistic cooperation of a full duplex relay in random access networks"
    - "finite blocklength bounds for wiretap channels"
    - "stable throughput region of the two user broadcast channel"
    - "the stability region of the two user broadcast channel"
    - "throughput analysis for full duplex wireless networks with imperfect self interference cancellation"
    - "fundamental limits of caching with secure delivery"

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)