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 "explicit codes for the wiretap channel a unified design framework"):
  Abstract: A construction of explicit codes for the wiretap channel is proposed. Appropriate choices of the construction parameters yield, within a unified design framework, the achievability of the secrecy capacity of (i) Wyner's wiretap channel, (ii) the wiretap channel of type II, (iii) the wiretap channel of type II with noisy main channel, (iv) the hybrid Wyner's/type II wiretap channel, and the best known single-letter achievable secrecy rates for (v) the wiretap channel when uncertainties hold on the eavesdropper's channel statistics (compound model), (vi) the wiretap channel when the eavesdropper's channel statistics are arbitrarily varying. Results are obtained for strong secrecy, do not require any symmetry or degradation assumptions on the channel, and do not require a pre-shared secret between the legitimate users. The underlying construction idea is an efficient emulation of random binning via polar codes to obtain reliability, coupled with universal hashing implemented via invertible extractors to ensure strong secrecy.

Includes members:
  Member "a new wiretap channel model and its strong secrecy capacity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of biometric identification systems with strong secrecy")
  Member "empirical and strong coordination via soft covering with polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "physical layer security for rf satellite channels in the finite length regime")
  Member "coding schemes for achieving strong secrecy at negligible cost":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "universal covertness for discrete memoryless sources")
  Member "semantic security capacity for wiretap channels of type ii":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "key and message semantic security over state dependent channels")
  Member "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure polar coding with delayed wiretapping information")
  Member "polar coding for the broadcast channel with confidential messages a random binning analogy":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure polar coding with delayed wiretapping information")
  Member "how to achieve the capacity of asymmetric channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "rate constrained shaping codes for structured sources")
  Member "an information theoretic approach to secret sharing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "capacity bounds on the downlink of symmetric multi relay single receiver c ran networks")

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)