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 "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"):
  Abstract: Inspired from quantum key distribution, we consider wireless communication between Alice and Bob when the intermediate space between Alice and Bob is controlled by Eve. That is, our model divides the channel noise into two parts, the noise generated during the transmission and the noise generated in the detector. Eve is allowed to control the former, but is not allowed to do the latter. While the latter is assumed to be a Gaussian random variable, the former is not assumed to be a Gaussian random variable. In this situation, using backward reconciliation and the random sampling, we propose a protocol to generate secure keys between Alice and Bob under the assumption that Eve's detector has a Gaussian noise and Eve is out of Alice's neighborhood. In our protocol, the security criteria are quantitatively guaranteed even with finite block-length code based on the evaluation of error of the estimation of channel.

Includes members:
  Member "secrecy and robustness for active attack in secure network coding and its application to network quantum key distribution":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secure network code for adaptive and active attacks with no randomness in intermediate nodes")
  Member "secure multiplex coding with dependent and non uniform multiple messages":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "exact exponent for soft covering")
  Member "key capacity for product sources with application to stationary gaussian processes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "communication for generating correlation a unifying survey")
  Member "tight exponential analysis of universally composable privacy amplification and its applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "communication for generating correlation a unifying survey")
  Member "separation of reliability and secrecy in rate limited 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 "exponential decreasing rate of leaked information in universal random privacy amplification":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "communication for generating correlation a unifying survey")
  Member "secure transmission with artificial noise over fading channels achievable rate and optimal power allocation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure massive mimo communication with low resolution dacs")
  Member "information theoretically secret key generation for fading wireless channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "covert secret key generation with an active warden")

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)