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 "individual secrecy for the broadcast channel"):
  Abstract: This paper studies the problem of secure communication over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an eavesdropper, while keeping the eavesdropper ignorant of each message (i.e., the information leakage from each message to the eavesdropper is made vanishing). Building upon Carleial-Hellman's secrecy coding, Wyner's secrecy coding, the frameworks of superposition coding and Marton's coding together with techniques such as rate splitting and indirect decoding, achievable rate regions are developed. The proposed regions are compared with those satisfying joint secrecy and without secrecy constraints, and the individual secrecy capacity regions for special cases are characterized. In particular, capacity region for the deterministic case is established, and for the Gaussian model, a constant gap (i.e., 0.5 bits within the individual secrecy capacity region) result is obtained. Overall, when compared with the joint secrecy constraint, the results allow for trading-off secrecy level and throughput in the system.

Includes members:
  Member "broadcast channels with privacy leakage constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "strong secrecy for cooperative broadcast channels")
  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 "strong secrecy for cooperative broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "keyless covert communication via channel state information")
  Member "individual secrecy for broadcast channels with receiver side information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "vulnerabilities of massive mimo systems to pilot contamination attacks")
  Member "secrecy capacity region of some classes of wiretap broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secrecy rates for a channel with two senders and two receivers")
  Member "capacity regions for broadcast channels with degraded message sets and message cognition under different secrecy constraints":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secrecy capacity memory tradeoff of erasure broadcast channels")
  Member "effective secrecy reliability confusion and stealth":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "asymptotic regime analysis of noma uplink networks under qos delay constraints")
  Member "reliability and secrecy functions of the wiretap channel under cost constraint":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "covert communication over a k user multiple access channel")

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)