human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "semantic security capacity for wiretap channels of type ii":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "distributed channel synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "gaussian approximation of quantization error for estimation from compressed data")
  Member "achievability proof via output statistics of random binning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication")
  Member "the gaussian many to one interference channel with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy")
  Member "capacity region of gaussian mimo broadcast channels with common and confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "the role of feedback in two way secure communications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning an adversary s actions for secret communication")
  Member "secure nested codes for type ii wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy")
  Member "the gaussian multiple access wire tap channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "an achievable region for the multiple access wiretap channels with confidential and open messages")

Question: Please tell me which class the source paper 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)