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: "secret key generation over noisy channels with common randomness"
  Abstract: This paper investigates the problem of secret key generation over a wiretap channel when the terminals observe correlated sources. These sources may or may not be independent of the main channel and the users overhear them before the transmission takes place. A novel achievable scheme for the case of independent sources is proposed, and it is shown to be optimal under certain less noisy conditions. This result improves upon the existing literature where the more stringent condition of degradedness was needed. For the situation where the sources are correlated with the main channel, a second achievable scheme based on joint source-channel coding is introduced, for which special cases of binary and Gaussian channels are studied. Some optimality results are derived, however, these are much less general than for the first setup.

Connected through hyperedge HE-1 (induced by source paper "key and message semantic security over state dependent channels"):
  with members:
    - "exact soft covering exponent"
    - "wiretap channels with causal state information strong secrecy"
    - "semantically secured message key trade off over wiretap channels with random parameters"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "the likelihood encoder for lossy compression"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "semantic security capacity for wiretap channels of type ii"
    - "informational divergence approximations to product distributions"

Connected through hyperedge HE-2 (induced by source paper "secret key generation from correlated sources and secure link"):
  with members:
    - "secrecy via sources and channels"
    - "secret key agreement with channel state information at the transmitter"
    - "random linear network coding a free cipher"

Connected through hyperedge HE-3 (induced by source paper "secret key generation over noisy channels with correlated sources"):
  with members:
    - "secret key generation from correlated sources and secure link"
    - "wiretap channels with random states non causally available at the encoder"
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "semantic security capacity for wiretap channels of type ii"
    - "the wiretap channel with generalized feedback secure communication and key generation"
    - "secret key agreement general capacity and second order asymptotics"
    - "secure transmission of sources over noisy channels with side information at the receivers"
    - "coded cooperative data exchange for a secret key"

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)