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 "privacy secrecy and storage with multiple noisy measurements of identifiers"):
  Abstract: The key-leakage-storage region is derived for a generalization of a classic two-terminal key agreement model. The additions to the model are that the encoder observes a hidden, or noisy, version of the identifier, and that the encoder and decoder can perform multiple measurements. To illustrate the behavior of the region, the theory is applied to binary identifiers and noise modeled via binary symmetric channels. In particular, the key-leakage-storage region is simplified by applying Mrs. Gerber's lemma twice in different directions to a Markov chain. The growth in the region as the number of measurements increases is quantified. The amount by which the privacy-leakage rate reduces for a hidden identifier as compared to a noise-free (visible) identifier at the encoder is also given. If the encoder incorrectly models the source as visible, it is shown that substantial secrecy leakage may occur and the reliability of the reconstructed key might decrease.

Includes members:
  Member "secret key based identification and authentication with a privacy constraint":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of biometric identification systems with strong secrecy")
  Member "secret key generation using correlated sources and channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "secrecy via sources and channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication")
  Member "a theoretical analysis of authentication privacy and reusability across secure biometric systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "code constructions for physical unclonable functions and biometric secrecy systems")
  Member "fuzzy extractors how to generate strong keys from biometrics and other noisy data":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a capacity achieving one message key agreement with finite blocklength analysis")

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)