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: "achievability proof via output statistics of random binning"
  Abstract: This paper introduces a new and ubiquitous framework for establishing achievability results in \emph{network information theory} (NIT) problems. The framework uses random binning arguments and is based on a duality between channel and source coding problems. {Further,} the framework uses pmf approximation arguments instead of counting and typicality. This allows for proving coordination and \emph{strong} secrecy problems where certain statistical conditions on the distribution of random variables need to be satisfied. These statistical conditions include independence between messages and eavesdropper's observations in secrecy problems and closeness to a certain distribution (usually, i.i.d. distribution) in coordination problems. One important feature of the framework is to enable one {to} add an eavesdropper and obtain a result on the secrecy rates "for free." #R##N#We make a case for generality of the framework by studying examples in the variety of settings containing channel coding, lossy source coding, joint source-channel coding, coordination, strong secrecy, feedback and relaying. In particular, by investigating the framework for the lossy source coding problem over broadcast channel, it is shown that the new framework provides a simple alternative scheme to \emph{hybrid} coding scheme. Also, new results on secrecy rate region (under strong secrecy criterion) of wiretap broadcast channel and wiretap relay channel are derived. In a set of accompanied papers, we have shown the usefulness of the framework to establish achievability results for coordination problems including interactive channel simulation, coordination via relay and channel simulation via another channel.

Connected through hyperedge HE-1 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication"):
  with members:
    - "private authentication with physical identifiers through broadcast channel measurements"
    - "controllable identifier measurements for private authentication with secret keys"
    - "secure and reliable key agreement with physical unclonable functions"
    - "coding for positive rate in the source model key agreement problem"
    - "code constructions for physical unclonable functions and biometric secrecy systems"
    - "privacy secrecy and storage with multiple noisy measurements of identifiers"
    - "converses for secret key agreement and secure computing"
    - "polar coding for secret key generation"

Connected through hyperedge HE-2 (induced by source paper "fundamental limits of biometric identification systems with strong secrecy"):
  with members:
    - "private authentication with physical identifiers through broadcast channel measurements"
    - "identification secrecy template and privacy leakage of biometric identification system under noisy enrollment"
    - "fundamental limits of identification system with secret binding under noisy enrollment"
    - "a new wiretap channel model and its strong secrecy capacity"
    - "code constructions for physical unclonable functions and biometric secrecy systems"
    - "privacy secrecy and storage with multiple noisy measurements of identifiers"
    - "secret key based identification and authentication with a privacy constraint"

Connected through hyperedge HE-3 (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"
    - "wiretap channels nonasymptotic fundamental limits"
    - "channel resolvability theorems for general sources and channels"
    - "strong functional representation lemma and applications to coding theorems"

Connected through hyperedge HE-4 (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"
    - "wiretap channels nonasymptotic fundamental limits"
    - "channel resolvability theorems for general sources and channels"

Connected through hyperedge HE-5 (induced by source paper "coordination through shared randomness"):
  with members:
    - "communication for generating correlation a survey"
    - "on the optimality of secret key agreement via omniscience"
    - "polar coding for empirical coordination of signals and actions over noisy channels"
    - "on the public communication needed to achieve sk capacity in the multiterminal source model"
    - "secure cascade channel synthesis"
    - "on non interactive simulation of joint distributions"
    - "empirical coordination with two sided state information and correlated source and state"
    - "empirical coordination with channel feedback and strictly causal or causal encoding"

Connected through hyperedge HE-6 (induced by source paper "secrecy rates for a channel with two senders and two receivers"):
  with members:
    - "energy efficient multicell multigroup multicasting with joint beamforming and antenna selection"
    - "secure multi source multicast"
    - "fourier motzkin elimination software for information theoretic inequalities"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "strong secrecy for multiple access channels"
    - "distributed channel synthesis"
    - "multi receiver wiretap channel with public and confidential messages"

Connected through hyperedge HE-7 (induced by source paper "steganography protocols for quantum channels"):
  with members:
    - "achieving covert wireless communications using a full duplex receiver"
    - "covert communication achieved by a greedy relay in wireless networks"
    - "covert wireless communication with artificial noise generation"
    - "covert communication in the presence of an uninformed jammer"
    - "limits of reliable communication with low probability of detection on awgn channels"
    - "effective secrecy reliability confusion and stealth"
    - "perfectly secure steganography capacity error exponents and code constructions"

Connected through hyperedge HE-8 (induced by source paper "playing games with bounded entropy convergence rate and approximate equilibria"):
  with members:
    - "a correlation measure based on vector valued l_p norms"
    - "playing games with bounded entropy"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "repeated matching pennies with limited randomness"

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)