human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "can marton coding alone ensure individual secrecy"):
  with members:
    - "a simplified coding scheme for the broadcast channel with complementary receiver side information under individual secrecy constraints"
    - "the secure two receiver broadcast channel with one sided receiver side information"
    - "individual secrecy for broadcast channels with receiver side information"
    - "3 receiver broadcast channels with common and confidential messages"

Connected through hyperedge HE-2 (induced by source paper "a simplified coding scheme for the broadcast channel with complementary receiver side information under individual secrecy constraints"):
  with members:
    - "individual secrecy for broadcast channels with receiver side information"
    - "brute force searching the typical set and guesswork"
    - "secret key generation using correlated sources and channels"
    - "secrecy via sources and channels"
    - "the wiretap channel with feedback encryption over the channel"
    - "secret communication with feedback"

Connected through hyperedge HE-3 (induced by source paper "the secure two receiver broadcast channel with one sided receiver side information"):
  with members:
    - "a simplified coding scheme for the broadcast channel with complementary receiver side information under individual secrecy constraints"
    - "individual secrecy for broadcast channels with receiver side information"
    - "3 receiver broadcast channels with common and confidential messages"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"

Connected through hyperedge HE-4 (induced by source paper "exploiting full duplex receivers for achieving secret communications in multiuser miso networks"):
  with members:
    - "individual secrecy for broadcast channels with receiver side information"
    - "multi objective optimization for robust power efficient and secure full duplex wireless communication systems"
    - "joint design of optimal cooperative jamming and power allocation for linear precoding"
    - "on the degrees of freedom of the mimo wiretap and mimo broadcast channels with unknown eavesdroppers"
    - "improving physical layer secrecy using full duplex jamming receivers"
    - "experiment driven characterization of full duplex wireless systems"
    - "mimo gaussian broadcast channels with confidential and common messages"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"

Connected through hyperedge HE-5 (induced by source paper "individual secrecy for broadcast channels with receiver side information"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "strong secrecy for cooperative broadcast channels"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "capacity regions for broadcast channels with degraded message sets and message cognition under different secrecy constraints"
    - "on block security of regenerating codes at the mbr point for distributed storage systems"
    - "effective secrecy reliability confusion and stealth"
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "reliability and secrecy functions of the wiretap channel under cost constraint"

Question: Please tell me which class the center node 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)