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: "non asymptotic output statistics of random binning and its applications"
  Abstract: In this paper we develop a finite blocklength version of the Output Statistics of Random Binning (OSRB) framework. The framework is shown to be optimal in the point-to-point case. New second order regions for broadcast channel and wiretap channel with strong secrecy criterion are derived.

Connected through hyperedge HE-1 (induced by source paper "physical layer security in the finite blocklength regime over fading channels"):
  with members:
    - "secure and energy efficient transmissions in cache enabled heterogeneous cellular networks performance analysis and optimization"
    - "a survey of physical layer security techniques for 5g wireless networks and challenges ahead"
    - "safeguarding decentralized wireless networks using full duplex jamming receivers"
    - "artificial noise aided secure transmission in large scale spectrum sharing networks"
    - "on the spectral efficiency and security enhancements of noma assisted multicast unicast streaming"
    - "finite blocklength bounds for wiretap channels"
    - "a survey on wireless security technical challenges recent advances and future trends"
    - "enhancing the physical layer security of non orthogonal multiple access in large scale networks"

Connected through hyperedge HE-2 (induced by source paper "secure short packet communications for mission critical iot applications"):
  with members:
    - "short packet downlink transmission with non orthogonal multiple access"
    - "wiretap channels nonasymptotic fundamental limits"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "fixed length strong coordination"):
  with members:
    - "strong coordination of signals and actions over noisy channels with two sided state information"
    - "strong coordination of signals and actions over noisy channels"
    - "achievability proof via output statistics of random binning"
    - "fixed length lossy compression in the finite blocklength regime"

Connected through hyperedge HE-4 (induced by source paper "a unified framework for one shot achievability via the poisson matching lemma"):
  with members:
    - "minimax learning for remote prediction"
    - "strong functional representation lemma and applications to coding theorems"
    - "the likelihood encoder for lossy compression"
    - "one shot mutual covering lemma and marton s inner bound with a common message"
    - "a technique for deriving one shot achievability results in network information theory"
    - "on the dispersions of the gel fand pinsker channel and dirty paper coding"
    - "distributed channel synthesis"
    - "lossy joint source channel coding in the finite blocklength regime"

Connected through hyperedge HE-5 (induced by source paper "on privacy amplification lossy compression and their duality to channel coding"):
  with members:
    - "wiretap channels nonasymptotic fundamental limits"
    - "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"
    - "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-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 "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"
    - "strong converse for a degraded wiretap channel via active hypothesis testing"

Connected through hyperedge HE-8 (induced by source paper "the likelihood encoder for lossy compression"):
  with members:
    - "joint source channel secrecy using hybrid coding"
    - "a rate distortion based secrecy system with side information at the decoders"
    - "a generalized typicality for abstract alphabets"
    - "the likelihood encoder for lossy source compression"
    - "a technique for deriving one shot achievability results in network information theory"
    - "a connection between good rate distortion codes and backward dmcs"
    - "the likelihood encoder for source coding"
    - "distributed channel synthesis"

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)