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 "code constructions for physical unclonable functions and biometric secrecy systems"):
  Abstract: The two-terminal key agreement problem with biometric or physical identifiers is considered. Two linear code constructions based on Wyner-Ziv coding are developed. The first construction uses random linear codes and achieves all points of the key-leakage-storage regions of the generated-secret and chosen-secret models. The second construction uses nested polar codes for vector quantization during enrollment and for error correction during reconstruction. Simulations show that the nested polar codes achieve privacy-leakage and storage rates that improve on existing code designs. One proposed code achieves a rate tuple that cannot be achieved by existing methods.

Includes members:
  Member "controllable identifier measurements for private authentication with secret keys":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication")
  Member "secure and reliable key agreement with physical unclonable functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication")
  Member "privacy secrecy and storage with multiple noisy measurements of identifiers":
    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 likelihood encoder for lossy compression":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "keyless covert communication via channel state information")
  Member "polar coding for secret key generation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "informational divergence approximations to product distributions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "communication for generating correlation a unifying survey")
  Member "secret key generation using correlated sources and channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication")
  Member "separation of reliability and secrecy in rate limited secret key generation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "explicit codes for the wiretap channel a unified design framework")

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)