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: "the gaussian multiple access wire tap channel with collective secrecy constraints"
  Abstract: We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the signal at the receiver. We define a suitable security measure for this multi-access environment. We derive an outer bound for the rate region such that secrecy to some pre-determined degree can be maintained. We also find, using Gaussian codebooks, an achievable such secrecy region. Gaussian codewords are shown to achieve the sum capacity outer bound, and the achievable region concides with the outer bound for Gaussian codewords, giving the capacity region when inputs are constrained to be Gaussian. We present numerical results showing the new rate region and compare it with that of the Gaussian Multiple-Access Channel (GMAC) with no secrecy constraints.

Connected through hyperedge HE-1 (induced by source paper "on the secrecy capacity of the broadcast wiretap channel with limited csi feedback"):
  with members:
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-2 (induced by source paper "on secrecy rate analysis of mimo wiretap channels driven by finite alphabet input"):
  with members:
    - "estimation in gaussian noise properties of the minimum mean square error"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "secure communication in the low snr regime a characterization of the energy secrecy tradeoff"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-3 (induced by source paper "information theoretic proofs of entropy power inequalities"):
  with members:
    - "hessian and concavity of mutual information differential entropy and entropy power in linear vector gaussian channels"
    - "concavity of entropy under thinning"
    - "a multivariate generalization of costa s entropy power inequality"
    - "on divergence power inequalities"
    - "mixing and non mixing local minima of the entropy contrast for blind source separation"
    - "generalized entropy power inequalities and monotonicity properties of information"
    - "an extremal inequality motivated by multiterminal information theoretic problems"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-4 (induced by source paper "achievable secrecy sum rate in a fading mac wt with power control and without csi of eavesdropper"):
  with members:
    - "the mimome channel"
    - "the secrecy capacity of the mimo wiretap channel"
    - "the general gaussian multiple access and two way wire tap channels achievable rates and cooperative jamming"
    - "on the secrecy capacity of fading channels"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-5 (induced by source paper "fading cognitive multiple access channels with confidential messages"):
  with members:
    - "cooperation with an untrusted relay a secrecy perspective"
    - "information theoretically secret key generation for fading wireless channels"
    - "on the throughput of secure hybrid arq protocols for gaussian block fading channels"
    - "two hop secure communication using an untrusted relay"
    - "secrecy in cooperative relay broadcast channels"
    - "secure communication over fading channels"
    - "the discrete memoryless multiple access channel with confidential messages"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

Connected through hyperedge HE-6 (induced by source paper "capacity bounds for broadcast channels with confidential messages"):
  with members:
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "an outer bound for 2 receiver discrete memoryless broadcast channels"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "rate regions for relay broadcast channels"
    - "on the secrecy capacity of fading channels"

Connected through hyperedge HE-7 (induced by source paper "on the throughput of secure hybrid arq protocols for gaussian block fading channels"):
  with members:
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secure nested codes for type ii wiretap channels"
    - "multiple access channels with generalized feedback and confidential messages"
    - "the discrete memoryless multiple access channel with confidential messages"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-8 (induced by source paper "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"):
  with members:
    - "secure communication over fading channels"
    - "secure nested codes for type ii wiretap channels"
    - "multiple antenna secure broadcast over wireless networks"
    - "cognitive interference channels with confidential messages"
    - "the discrete memoryless multiple access channel with confidential messages"
    - "achievable rates for the general gaussian multiple access wire tap channel with collective secrecy"
    - "on the secrecy capacity of fading channels"
    - "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)