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 "security guaranteed wireless communication over common noise attack under spatial assumption"):
  Abstract: We assume that Eve and Bob are connected to Alice with additive white Gaussian noise channel, and their noises are correlated. We allow Eve to optimize the correlation between her noise generated outside her detector, which is called the common noise attack. We give a necessarily and sufficient condition to generate the agreed secure key between Alice and Bob over the common noise attack under a spatial condition for Eve. Further, we give a concrete protocol with the reverse reconciliation to generate secure final keys whose leaked information is rigorously and quantitatively guaranteed even with finite block-length code. Based on the method of post selection, we discuss the security when Eve inserts artificial noise. We also consider how Bob can improve their key generation rate by inserting artificial noise to Eve's observation.

Includes members:
  Member "key capacity for product sources with application to stationary gaussian processes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (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-3 (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-4 (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-5 (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)