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: "tandem coding and cryptography on wiretap channels exit chart analysis"
  Abstract: Traditional cryptography assumes an eavesdropper receives an error-free copy of the transmitted ciphertext. Wyner's wiretap channel model recognizes that at the physical layer both the intended receiver and the passive eavesdropper inevitably receive an error-prone version of the transmitted message which must be corrected prior to decryption. This paper considers the implications of using both channel and cryptographic codes under the wiretap channel model in a way that enhances the information-theoretic security for the friendly parties by keeping the information transfer to the eavesdropper small. We consider a secret-key cryptographic system with a linear feedback shift register (LFSR)-based keystream generator and observe the mutual information between an LFSR-generated sequence and the received noise-corrupted ciphertext sequence under a known-plaintext scenario. The effectiveness of a noniterative fast correlation attack, which reduces the search time in a brute-force attack, is shown to be correlated with this mutual information. For an iterative fast correlation attack on this cryptographic system, it is shown that an EXIT chart and mutual information are very good predictors of decoding success and failure by a passive eavesdropper.

Connected through hyperedge HE-1 (induced by source paper "artificial noise aided secrecy information and power transfer in ofdma systems"):
  with members:
    - "secrecy wireless information and power transfer in fading wiretap channel"
    - "energy harvesting for physical layer security in ofdma networks"
    - "secrecy wireless information and power transfer with miso beamforming"
    - "multiuser miso beamforming for simultaneous wireless information and power transfer"
    - "energy efficient resource allocation in multiuser ofdm systems with wireless information and power transfer"
    - "resource allocation for secure communication in systems with wireless information and power transfer"
    - "power allocation and time domain artificial noise design for wiretap ofdm with discrete inputs"
    - "spectral efficient optimization in ofdm systems with wireless information and power transfer"

Connected through hyperedge HE-2 (induced by source paper "analysis of short blocklength codes for secrecy"):
  with members:
    - "quantifying equivocation for finite blocklength wiretap codes"
    - "performance assessment and design of finite length ldpc codes for the gaussian wiretap channel"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "deterministic constructions for large girth protograph ldpc codes"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "ldpc code design for the bpsk constrained gaussian wiretap channel"
    - "achieving the secrecy capacity of wiretap channels using polar codes"

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)