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"
  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 suitable security measures for this multi-access environment. Using codebooks generated randomly according to a Gaussian distribution, achievable secrecy rate regions are identified using superposition coding and TDMA coding schemes. An upper bound for the secrecy sum-rate is derived, and our coding schemes are shown to achieve the sum capacity. Numerical results showing the new rate region are presented and compared with the capacity region of the Gaussian Multiple-Access Channel (GMAC) with no secrecy constraints, quantifying the price paid for secrecy.

Connected through hyperedge HE-1 (induced by source paper "an achievable region for the multiple access wiretap channels with confidential and open messages"):
  with members:
    - "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy"

Connected through hyperedge HE-2 (induced by source paper "adding common randomness can remove the secrecy constraints in communication networks"):
  with members:
    - "secure communication over interference channel to jam or not to jam"
    - "adding a helper can totally remove the secrecy constraints in interference channel"
    - "optimal secure gdof of symmetric gaussian wiretap channel with a helper"
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"
    - "finite snr regime analysis of the gaussian wiretap multiple access channel"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"

Connected through hyperedge HE-3 (induced by source paper "secrecy rates for a channel with two senders and two receivers"):
  with members:
    - "energy efficient multicell multigroup multicasting with joint beamforming and antenna selection"
    - "secure multi source multicast"
    - "fourier motzkin elimination software for information theoretic inequalities"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "strong secrecy for multiple access channels"
    - "distributed channel synthesis"
    - "achievability proof via output statistics of random binning"

Connected through hyperedge HE-4 (induced by source paper "multi antenna aided secrecy beamforming optimization for wirelessly powered hetnets"):
  with members:
    - "optimal beamforming and time allocation for partially wireless powered sensor networks with downlink swipt"
    - "energy efficient user association and power allocation in millimeter wave based ultra dense networks with energy harvesting base stations"
    - "wireless power transfer in massive mimo aided hetnets with user association"
    - "secrecy transmit beamforming for heterogeneous networks"
    - "evolution toward 5g multi tier cellular wireless networks an interference management perspective"
    - "five disruptive technology directions for 5g"
    - "outage constrained robust secure transmission for miso wiretap channels"
    - "heterogeneous cellular networks with flexible cell association a comprehensive downlink sinr analysis"

Connected through hyperedge HE-5 (induced by source paper "threshold secure coding with shared key"):
  with members:
    - "distributed multi user secret sharing"
    - "rate compatible polar codes for wireless channels"
    - "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
    - "on finite length performance of polar codes stopping sets error floor and concatenated design"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "the secrecy capacity of the mimo wiretap channel"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-6 (induced by source paper "optimal secure gdof of symmetric gaussian wiretap channel with a helper"):
  with members:
    - "secure communication over interference channel to jam or not to jam"
    - "adding a helper can totally remove the secrecy constraints in interference channel"
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "on the optimality of secure communication without using cooperative jamming"
    - "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"
    - "the wiretapped diamond relay channel"
    - "finite snr regime analysis of the gaussian wiretap multiple access channel"
    - "secure degrees of freedom of one hop wireless networks"

Connected through hyperedge HE-7 (induced by source paper "secure communication over interference channel to jam or not to jam"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "interference alignment for secrecy"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "capacity bounds for broadcast channels with confidential messages"

Connected through hyperedge HE-8 (induced by source paper "secure routing with power optimization for ad hoc networks"):
  with members:
    - "physical layer security jamming theoretical limits and practical designs in wireless networks"
    - "secure transmission in linear multihop relaying networks"
    - "a primer on cellular network analysis using stochastic geometry"
    - "physical layer security in heterogeneous cellular networks"
    - "secure routing in multihop wireless ad hoc networks with decode and forward relaying"
    - "optimizing df cognitive radio networks with full duplex enabled energy access points"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "achieving global optimality for weighted sum rate maximization in the k user gaussian interference channel with multiple antennas"

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)