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: "fading cognitive multiple access channels with confidential messages"
  Abstract: The fading cognitive multiple-access channel with confidential messages (CMAC-CM) is investigated, in which two users attempt to transmit common information to a destination and user 1 also has confidential information intended for the destination. User 1 views user 2 as an eavesdropper and wishes to keep its confidential information as secret as possible from user 2. The multiple-access channel (both the user-to-user channel and the user-to-destination channel) is corrupted by multiplicative fading gain coefficients in addition to additive white Gaussian noise. The channel state information (CSI) is assumed to be known at both the users and the destination. A parallel CMAC-CM with independent subchannels is first studied. The secrecy capacity region of the parallel CMAC-CM is established, which yields the secrecy capacity region of the parallel CMAC-CM with degraded subchannels. Next, the secrecy capacity region is established for the parallel Gaussian CMAC-CM, which is used to study the fading CMAC-CM. When both users know the CSI, they can dynamically change their transmission powers with the channel realization to achieve the optimal performance. The closed-form power allocation function that achieves every boundary point of the secrecy capacity region is derived.

Connected through hyperedge HE-1 (induced by source paper "capacity bounds for wireless ergodic fading broadcast channels with partial csit"):
  with members:
    - "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit"
    - "private broadcasting over independent parallel channels"
    - "the two user gaussian fading broadcast channel"
    - "interference networks with general message sets a random coding scheme"
    - "ergodic fading interference channels sum capacity and separability"
    - "a note on outer bounds for broadcast channel"
    - "capacity bounds for broadcast channels with confidential messages"
    - "fading broadcast channels with state information at the receivers"

Connected through hyperedge HE-2 (induced by source paper "strong secrecy for multiple access channels"):
  with members:
    - "secrecy results for compound wiretap channels"
    - "the arbitrarily varying multiple access channel with conferencing encoders"
    - "strongly secure communications over the two way wiretap channel"
    - "mimo wiretap channels with arbitrarily varying eavesdropper channel states"
    - "the compound multiple access channel with partially cooperating encoders"
    - "multiple access channels with generalized feedback and confidential messages"
    - "the discrete memoryless multiple access channel with confidential messages"
    - "the gaussian multiple access wire tap channel"

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)