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 "wireless information theoretic security part i theoretical aspects"):
  Abstract: In this two-part paper, we consider the transmission of confi dential data over wireless wiretap channels. The first part presents an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through another independent quasi-static fading channel. We define the secrecy capacity in terms of outage probability and provide a complete characterization of the maximum transmission rate at which the eavesdropper is unable to decode any information. In sharp contrast with known results for Gaussian wiretap channels (without feedback), our contribution shows that in the presence of fading informationtheoretic security is achievable even when the eavesdropper has a better average signal-to-noise ratio (SNR) than the legitimate receiver — fading thus turns out to be a friend and not a foe. The issue of imperfect channel state information is also addressed. Practical schemes for wireless information-theoretic security are presented in Part II, which in some cases comes close to the secrecy capacity limits given in this paper.

Includes members:
  Member "secret key and private key constructions for simple multiterminal source models":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secret key generation in many to one networks an integrated game theoretic and information theoretic approach")
  Member "secure communication over fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "parallel bcc with one common and two confidential messages and imperfect csit")
  Member "the gaussian multiple access wire tap channel with collective secrecy constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the secrecy capacity of the broadcast wiretap channel with limited csi feedback")
  Member "the discrete memoryless multiple access channel with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multiple access channel with common message and secrecy constraint")
  Member "on the secrecy capacity of fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "parallel bcc with one common and two confidential messages and imperfect csit")
  Member "efficient reconciliation of correlated continuous random variables using ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "toward efficient quantum key distribution reconciliation")

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)