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: "achievable secrecy sum rate in a fading mac wt with power control and without csi of eavesdropper"
  Abstract: We consider a two user fading Multiple Access Channel with a wire-tapper (MAC-WT) where the transmitter has the channel state information (CSI) to the intended receiver but not to the eavesdropper (eve). We provide an achievable secrecy sum-rate with optimal power control. We next provide a secrecy sum-rate with optimal power control and cooperative jamming (CJ). We then study an achievable secrecy sum rate by employing an ON/OFF power control scheme which is more easily computable. We also employ CJ over this power control scheme. Results show that CJ boosts the secrecy sum-rate significantly even if we do not know the CSI of the eve's channel. At high SNR, the secrecy sum-rate (with CJ) without CSI of the eve exceeds the secrecy sum-rate (without CJ) with full CSI of the eve.

Connected through hyperedge HE-1 (induced by source paper "resource allocation in a mac with and without security via game theoretic learning"):
  with members:
    - "learning equilibria of a stochastic game on gaussian interference channels with incomplete information"
    - "distributed learning policies for power allocation in multiple access channels"
    - "on the secure dof of the single antenna mac"

Connected through hyperedge HE-2 (induced by source paper "mitigating rate loss in fading multiple access wiretap channel to achieve shannon capacity region"):
  with members:
    - "achieving shannon capacity in a fading wiretap channel"
    - "achieving shannon capacity region as secrecy rate region in a multiple access wiretap channel"
    - "strong secrecy for multiple access channels"
    - "previous messages provide the key to achieve shannon capacity in a wiretap channel"
    - "strong secrecy from channel resolvability"
    - "the wiretap channel with feedback encryption over the channel"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-3 (induced by source paper "enhancing secrecy rate region for recent messages for a slotted multiple access wiretap channel to shannon capacity region"):
  with members:
    - "achieving shannon capacity region as secrecy rate region in a multiple access wiretap channel"
    - "achieving shannon capacity in a wiretap channel via previous messages"
    - "strong secrecy for multiple access channels"
    - "previous messages provide the key to achieve shannon capacity in a wiretap channel"

Connected through hyperedge HE-4 (induced by source paper "achieving shannon capacity region as secrecy rate region in a multiple access wiretap channel"):
  with members:
    - "achieving shannon capacity in a wiretap channel via previous messages"
    - "previous messages provide the key to achieve shannon capacity in a wiretap channel"
    - "the wiretap channel with feedback encryption over the channel"
    - "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)