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 secret key generation"):
  Abstract: Practical implementations of secret-key generation are often based on sequential strategies, which handle reliability and secrecy in two successive steps, called reconciliation and privacy amplification. In this paper, we propose an alternative approach based on polar codes that jointly deals with reliability and secrecy. Specifically, we propose secret-key capacity-achieving polar coding schemes for the following models: (i) the degraded binary memoryless source (DBMS) model with rate-unlimited public communication, (ii) the DBMS model with one-way rate-limited public communication, (iii) the 1-to-m broadcast model and (iv) the Markov tree model with uniform marginals. For models (i) and (ii) our coding schemes remain valid for non-degraded sources, although they may not achieve the secret-key capacity. For models (i), (ii) and (iii), our schemes rely on pre-shared secret seed of negligible rate; however, we provide special cases of these models for which no seed is required. Finally, we show an application of our results to secrecy and privacy for biometric systems. We thus provide the first examples of low-complexity secret-key capacity-achieving schemes that are able to handle vector quantization for model (ii), or multiterminal communication for models (iii) and (iv).

Includes members:
  Member "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "polar coding for the broadcast channel with confidential messages and constrained randomization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coding schemes for achieving strong secrecy at negligible cost")
  Member "universal source polarization and an application to a multi user problem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "universal polarization for processes with memory")
  Member "efficient one way secret key agreement and private channel coding via polarization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "secure biometrics concepts authentication architectures and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "controllable identifier measurements for private authentication with secret keys")
  Member "separation of reliability and secrecy in rate limited secret key generation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "strong coordination with polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "strong coordination of signals and actions over noisy channels with two sided state information")
  Member "randomness and dependencies extraction via polarization with applications to slepian wolf coding and secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "polar codes simplicity random codes durability")

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)