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: "a new wiretap channel model and its strong secrecy capacity"
  Abstract: In this paper, a new wiretap channel model is proposed, where the legitimate transmitter and receiver communicate over a discrete memoryless channel. The wiretapper has perfect access to a fixed-length subset of the transmitted codeword symbols of her choosing. Additionally, she observes the remainder of the transmitted symbols through a discrete memoryless channel. This new model subsumes the classical wiretap channel and wiretap channel II with noisy main channel as its special cases. The strong secrecy capacity of the proposed channel model is identified. Achievability is established by solving a dual secret key agreement problem in the source model, and converting the solution to the original channel model using probability distribution approximation arguments. In the dual problem, a source encoder and decoder, who observe random sequences independent and identically distributed according to the input and output distributions of the legitimate channel in the original problem, communicate a confidential key over a public error-free channel using a single forward transmission, in the presence of a compound wiretapping source who has perfect access to the public discussion. The security of the key is guaranteed for the exponentially many possibilities of the subset chosen at wiretapper by deriving a lemma which provides a doubly-exponential convergence rate for the probability that, for a fixed choice of the subset, the key is uniform and independent from the public discussion and the wiretapping source's observation. The converse is derived by using Sanov's theorem to upper bound the secrecy capacity of the new wiretap channel model by the secrecy capacity when the tapped subset is randomly chosen by nature.

Connected through hyperedge HE-1 (induced by source paper "explicit codes for the wiretap channel a unified design framework"):
  with members:
    - "empirical and strong coordination via soft covering with polar codes"
    - "coding schemes for achieving strong secrecy at negligible cost"
    - "semantic security capacity for wiretap channels of type ii"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "how to achieve the capacity of asymmetric channels"
    - "an information theoretic approach to secret sharing"
    - "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"
    - "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"
    - "achievability proof via output statistics of random binning"

Connected through hyperedge HE-3 (induced by source paper "modular design to transform codes for the wiretap channel of type i into codes for the wiretap channel of type ii"):
  with members:
    - "semantic security and the second largest eigenvalue of biregular graphs"
    - "soft covering with high probability"
    - "semantic security capacity for wiretap channels of type ii"

Connected through hyperedge HE-4 (induced by source paper "the caching broadcast channel with a wire and cache tapping adversary of type ii"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching with heterogeneous cache sizes and link qualities the two user case"
    - "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy"
    - "secrecy capacity memory tradeoff of erasure broadcast channels"
    - "benefits of cache assignment on degraded broadcast channels"
    - "cache aided content delivery over erasure broadcast channels"
    - "combination networks with or without secrecy constraints the impact of caching relays"
    - "information theoretic caching the multi user case"

Connected through hyperedge HE-5 (induced by source paper "learning an adversary s actions for secret communication"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "semantic security capacity for wiretap channels of type ii"
    - "list decoding random coding exponents and expurgated exponents"
    - "capacity results for arbitrarily varying wiretap channels"
    - "regret analysis of stochastic and nonstochastic multi armed bandit problems"
    - "universal communication over arbitrarily varying channels"

Connected through hyperedge HE-6 (induced by source paper "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy"):
  with members:
    - "semantic security capacity for wiretap channels of type ii"
    - "causal erasure channels"
    - "achievability proof via output statistics of random binning"
    - "information theoretically secure regenerating codes for distributed storage"
    - "the gaussian many to one interference channel with confidential messages"
    - "the role of feedback in two way secure communications"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secure nested codes for type ii wiretap channels"

Connected through hyperedge HE-7 (induced by source paper "active secure coding based on eavesdropper behavior learning"):
  with members:
    - "arbitrarily varying wiretap channels with type constrained states"
    - "polar coding for the general wiretap channel"
    - "imperfect secrecy in wiretap channel ii"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-8 (induced by source paper "arbitrarily varying wiretap channels with type constrained states"):
  with members:
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "strong secrecy for cooperative broadcast channels"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"
    - "on the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels"
    - "semantic security capacity for wiretap channels of type ii"
    - "the arbitrarily varying wiretap channel deterministic and correlated random coding capacities under the strong secrecy criterion"
    - "secrecy results for compound wiretap channels"
    - "effective secrecy reliability confusion and stealth"

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)