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: "lattice code design for the rayleigh fading wiretap channel"
  Abstract: It has been shown recently that coding for the Gaussian Wiretap Channel can be done with nested lattices. A fine lattice intended to the legitimate user must be designed as a usual lattice code for the Gaussian Channel, while a coarse lattice is added to introduce confusion at the eavesdropper, whose theta series must be minimized. We present a design criterion for both the fine and coarse lattice to obtain wiretap lattice codes for the Rayleigh fading Wiretap Channel.

Connected through hyperedge HE-1 (induced by source paper "well rounded lattices towards optimal coset codes for gaussian and fading wiretap channels"):
  with members:
    - "performance of lattice coset codes on a usrp testbed"
    - "on analytical and geometric lattice design criteria for wiretap coset codes"
    - "well rounded lattices for coset coding in mimo wiretap channels"
    - "information bounds and flatness factor approximation for fading wiretap mimo channels"
    - "theta series approximation with applications to compute and forward relaying"
    - "well rounded lattices for reliability and security in rayleigh fading siso channels"
    - "decoding in compute and forward relaying real lattices and the flatness of lattice sums"
    - "almost universal codes for fading wiretap channels"

Connected through hyperedge HE-2 (induced by source paper "a survey of physical layer security techniques for 5g wireless networks and challenges ahead"):
  with members:
    - "secure massive mimo systems with limited rf chains"
    - "secure transmission with large numbers of antennas and finite alphabet inputs"
    - "probabilistically robust swipt for secrecy misome systems"
    - "exploiting full duplex receivers for achieving secret communications in multiuser miso networks"
    - "full duplex bidirectional secure communications under perfect and distributionally ambiguous eavesdropper s csi"
    - "safeguarding decentralized wireless networks using full duplex jamming receivers"
    - "physical layer security aware routing and performance tradeoffs in ad hoc networks"
    - "hybrid procoder and combiner design for secure transmission in mmwave mimo systems"

Connected through hyperedge HE-3 (induced by source paper "physical layer security for rf satellite channels in the finite length regime"):
  with members:
    - "two way physical layer security protocol for gaussian channels"
    - "free space optical channel estimation for physical layer security"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "information theoretic physical layer security for satellite channels"
    - "empirical and strong coordination via soft covering with polar codes"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "secure wireless communication under spatial and local gaussian noise assumptions"
    - "joint power control in wiretap interference channels"

Connected through hyperedge HE-4 (induced by source paper "lattice codes for physical layer communications"):
  with members:
    - "well rounded lattices for reliability and security in rayleigh fading siso channels"
    - "bounds on fast decodability of space time block codes skew hermitian matrices and azumaya algebras"
    - "the compute and forward protocol implementation and practical aspects"
    - "compute and forward harnessing interference through structured codes"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-5 (induced by source paper "well rounded lattices for coset coding in mimo wiretap channels"):
  with members:
    - "on analytical and geometric lattice design criteria for wiretap coset codes"
    - "information bounds and flatness factor approximation for fading wiretap mimo channels"
    - "well rounded lattices for reliability and security in rayleigh fading siso channels"
    - "decoding in compute and forward relaying real lattices and the flatness of lattice sums"
    - "almost universal codes for fading wiretap channels"
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"
    - "a comparison of skewed and orthogonal lattices in gaussian wiretap channels"
    - "semantically secure lattice codes for the gaussian wiretap channel"

Connected through hyperedge HE-6 (induced by source paper "on analytical and geometric lattice design criteria for wiretap coset codes"):
  with members:
    - "performance of lattice coset codes on a usrp testbed"
    - "well rounded lattices for reliability and security in rayleigh fading siso channels"
    - "decoding in compute and forward relaying real lattices and the flatness of lattice sums"
    - "almost universal codes for fading wiretap channels"
    - "locally diverse constellations from the special orthogonal group"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"
    - "semantically secure lattice codes for the gaussian wiretap channel"

Connected through hyperedge HE-7 (induced by source paper "almost universal codes for fading wiretap channels"):
  with members:
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"
    - "number field lattices achieve gaussian and rayleigh channel capacity within a constant gap"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "on secrecy capacity of fast fading mimome wiretap channels with statistical csit"
    - "on secrecy capacity of fast fading multiple input wiretap channels with statistical csit"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
    - "an error probability approach to mimo wiretap channels"

Connected through hyperedge HE-8 (induced by source paper "well rounded lattices for reliability and security in rayleigh fading siso channels"):
  with members:
    - "information bounds and flatness factor approximation for fading wiretap mimo channels"
    - "almost universal codes for fading wiretap channels"
    - "locally diverse constellations from the special orthogonal group"
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"
    - "a comparison of skewed and orthogonal lattices in gaussian wiretap channels"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "integer space time block codes for practical mimo systems"
    - "inverse determinant sums and connections between fading channel information theory and algebra"

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)