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: "polar coding for secure transmission in miso fading wiretap channels"
  Abstract: In this paper, we propose a polar coding scheme for secure communication over the multiple-input, single-output, single-antenna eavesdropper (MISOSE) fading channel. We consider the case of block fading channels with known eavesdropper channel state information (CSI) and the case of fading channels with known eavesdropper channel distribution information (CDI). We use the artificial noise assisted secure precoding method to maximize the secrecy capacity in the first case, and to overcome the unawareness of the eavesdropper CSI in the second case. We show that our proposed scheme can provide both reliable and secure communication over the MISOSE channel with low encoding and decoding complexity.

Connected through hyperedge HE-1 (induced by source paper "an overview of physical layer security with finite alphabet signaling"):
  with members:
    - "a survey of physical layer security techniques for 5g wireless networks and challenges ahead"
    - "physical layer cryptography through massive mimo"
    - "linear precoding of data and artificial noise in secure massive mimo systems"
    - "sum secrecy rate maximization for full duplex two way relay networks using alamouti based rank two beamforming"
    - "performance of lattice coset codes on universal software radio peripherals"
    - "secure m psk communication via directional modulation"
    - "finite blocklength bounds for wiretap channels"
    - "physical layer security in millimeter wave cellular networks"

Connected through hyperedge HE-2 (induced by source paper "secure polar coding for the two way wiretap channel"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "polar codes for broadcast channels"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "channel upgradation for non binary input alphabets and macs"
    - "polar coding for secret key generation"
    - "polar codes for arbitrary dmcs and arbitrary macs"
    - "universal polar codes"

Connected through hyperedge HE-3 (induced by source paper "hierarchical polar coding for achieving secrecy over fading wiretap channels without any instantaneous csi"):
  with members:
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the general wiretap channel"
    - "polar coding for the broadcast channel with confidential messages and constrained randomization"
    - "polar coding for secret key generation"
    - "polar coding for fading channels binary and exponential channel cases"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "nested polar codes for wiretap and relay channels"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-4 (induced by source paper "securing the mimo wiretap channel with polar codes and encryption"):
  with members:
    - "large scale mimo relaying techniques for physical layer security af or df"
    - "physical layer security for massive mimo an overview on passive eavesdropping and active attacks"
    - "polar coding for the general wiretap channel"
    - "space time polar coded modulation"
    - "polar coding for secret key generation"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "nested polar codes for wiretap and relay channels"
    - "on the rate of channel polarization"

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)