human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "coding for positive rate in the source model key agreement problem"
  Abstract: The two-party key agreement problem with public discussion, known as the source model problem, is considered. By relating the key agreement problem to hypothesis testing, a new coding scheme is developed that yields a sufficient condition to achieve a positive secret-key (SK) rate in terms of Chernoff information. The merits of this coding scheme are illustrated by applying it to an erasure model for Eve's side information, for which the Chernoff information gives an upper bound on the maximum erasure probability for which the SK capacity is zero. This bound is shown to strictly improve over the one given by the best known single-letter lower bound on the SK capacity. Moreover, the bound is shown to be tight when Alice's or Bob's source is binary, which extends a previous result for a doubly symmetric binary source. The results motivate a new measure for the correlation between two random variables, which is of independent interest.

Connected through hyperedge HE-1 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication"):
  with members:
    - "private authentication with physical identifiers through broadcast channel measurements"
    - "controllable identifier measurements for private authentication with secret keys"
    - "secure and reliable key agreement with physical unclonable functions"
    - "code constructions for physical unclonable functions and biometric secrecy systems"
    - "privacy secrecy and storage with multiple noisy measurements of identifiers"
    - "converses for secret key agreement and secure computing"
    - "polar coding for secret key generation"
    - "secret key generation using correlated sources and channels"

Connected through hyperedge HE-2 (induced by source paper "communication for generating correlation a unifying survey"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "exact exponent for soft covering"
    - "exact channel synthesis"
    - "strong converse using change of measure arguments"
    - "wiretap channels nonasymptotic fundamental limits"
    - "channel resolvability theorems for general sources and channels"
    - "strong functional representation lemma and applications to coding theorems"
    - "resource efficient common randomness and secret key schemes"

Connected through hyperedge HE-3 (induced by source paper "communication for generating correlation a survey"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "exact soft covering exponent"
    - "on exact and infty r enyi common informations"
    - "exact channel synthesis"
    - "strong converse using change of measure arguments"
    - "wiretap channels nonasymptotic fundamental limits"
    - "channel resolvability theorems for general sources and channels"
    - "exact random coding secrecy exponents for the wiretap channel"

Connected through hyperedge HE-4 (induced by source paper "unique information and secret key decompositions"):
  with members:
    - "unique informations and deficiencies"
    - "computing the unique information"
    - "the blackwell relation defines no lattice"
    - "reconsidering unique information towards a multivariate information decomposition"
    - "quantifying unique information"
    - "nonnegative decomposition of multivariate information"

Question: Please tell me which class the center node 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)