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 "polar coding for the broadcast channel with confidential messages and constrained randomization"):
  Abstract: We develop a low-complexity polar coding scheme for the discrete memoryless broadcast channel with confidential messages under strong secrecy and randomness constraints. Our scheme extends previous work by using an optimal rate of uniform randomness in the stochastic encoder, and avoiding assumptions regarding the symmetry or degraded nature of the channels. The price paid for these extensions is that the encoder and decoders are required to share a secret seed of negligible size and to increase the block length through chaining. We also highlight a close conceptual connection between the proposed polar coding scheme and a random binning proof of the secrecy capacity region.

Includes members:
  Member "polar codes for broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polar codes simplicity random codes durability")
  Member "coding schemes for achieving strong secrecy at negligible cost":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "achieving marton s region for broadcast channels using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "achieving the uniform rate region of general multiple access channels by polar coding")
  Member "polar coding for the general wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "polar coding for secret key generation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "on secure communication with constrained randomization":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "publicness privacy and confidentiality in the single serving quantum broadcast channel")

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)