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 "secret key generation over noisy channels with correlated sources"):
  Abstract: This paper investigates the problem of secret key generation over a wiretap channel when the terminals observe correlated sources. These sources are independent of the main channel and the users overhear them before the transmission takes place. A novel achievable scheme is proposed, and its optimality is shown under certain less-noisy conditions. This result improves upon the existing literature where the more stringent condition of degradedness is required. Furthermore, numerical evaluation of the proposed scheme and previously reported results for a binary model are presented; a comparison of the numerical bounds provides insights on the benefit of the novel scheme.

Includes members:
  Member "secret key generation from correlated sources and secure link":
    also connected through other hyperedges:
      (none)
  Member "wiretap channels with random states non causally available at the encoder":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "keyless covert communication via channel state information")
  Member "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "semantic security and the second largest eigenvalue of biregular graphs")
  Member "secret key generation over noisy channels with common randomness":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "key and message semantic security over state dependent channels")
  Member "semantic security capacity for wiretap channels of type ii":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "the wiretap channel with generalized feedback secure communication and key generation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "two way physical layer security protocol for gaussian channels")
  Member "secret key agreement general capacity and second order asymptotics":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a capacity achieving one message key agreement with finite blocklength analysis")
  Member "secure transmission of sources over noisy channels with side information at the receivers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "source channel secrecy for shannon cipher system")

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)