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: "a simplified coding scheme for the broadcast channel with complementary receiver side information under individual secrecy constraints"
  Abstract: This paper simplifies an existing coding scheme for the two-receiver discrete memoryless broadcast channel with complementary receiver side information where there is a passive eavesdropper and individual secrecy is required. The existing coding scheme is simplified in two steps by replacing Wyner's secrecy coding with Carleial-Hellman's secrecy coding as well as removing additional randomness in the common satellite codeword. This simplified scheme retains the existing achievable individual secrecy rate region. Not least, the simplified scheme requires fewer message splits and fewer random components.

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

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

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)