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: "a compressed sensing wire tap channel"
  Abstract: A multiplicative Gaussian wire-tap channel inspired by compressed sensing is studied. Lower and upper bounds on the secrecy capacity are derived, and shown to be relatively tight in the large system limit for a large class of compressed sensing matrices. Surprisingly, it is shown that the secrecy capacity of this channel is nearly equal to the capacity without any secrecy constraint provided that the channel of the eavesdropper is strictly worse than the channel of the intended receiver. In other words, the eavesdropper can see almost everything and yet learn almost nothing. This behavior, which contrasts sharply with that of many commonly studied wiretap channels, is made possible by the fact that a small number of linear projections can make a crucial difference in the ability to estimate sparse vectors.

Connected through hyperedge HE-1 (induced by source paper "secure and efficient compressed sensing based encryption with sparse matrices"):
  with members:
    - "indistinguishability and energy sensitivity of asymptotically gaussian compressed encryption"
    - "a survey on wireless security technical challenges recent advances and future trends"
    - "bi level protected compressive sampling"
    - "on known plaintext attacks to a compressed sensing based encryption a quantitative analysis"
    - "low complexity multiclass encryption by compressed sensing"
    - "mergeshuffle a very fast parallel random permutation algorithm"
    - "permutation meets parallel compressed sensing how to relax restricted isometry property for 2d sparse signals"
    - "compressive mechanism utilizing sparse representation in differential privacy"

Connected through hyperedge HE-2 (induced by source paper "achievable secrecy rates over mimome gaussian channels with gmm signals in low noise regime"):
  with members:
    - "secret message transmission by harq with multiple encoding"
    - "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"
    - "rethinking the secrecy outage formulation a secure transmission design perspective"
    - "mimo wiretap channels with arbitrarily varying eavesdropper channel states"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "on convergence properties of shannon entropy"

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)