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: "secrecy gain a wiretap lattice code design"
  Abstract: We propose the notion of secrecy gain as a code design criterion for wiretap lattice codes to be used over an additive white Gaussian noise channel. Our analysis relies on the error probabilites of both the legitimate user and the eavesdropper. We focus on geometrical properties of lattices, described by their theta series, to characterize good wiretap codes.

Connected through hyperedge HE-1 (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-2 (induced by source paper "some goodness properties of lda lattices"):
  with members:
    - "lda lattices without dithering achieve capacity on the gaussian channel"
    - "secure compute and forward in a bidirectional relay"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "a simple proof for the existence of good pairs of nested lattices"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"
    - "compute and forward harnessing interference through structured codes"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-3 (induced by source paper "on the secrecy gain of ell modular lattices"):
  with members:
    - "on the eavesdropper s correct decision in gaussian and fading wiretap channels using lattice codes"
    - "unimodular lattices for the gaussian wiretap channel"

Connected through hyperedge HE-4 (induced by source paper "on secrecy metrics for physical layer security over quasi static fading channels"):
  with members:
    - "performance assessment and design of finite length ldpc codes for the gaussian wiretap channel"
    - "rethinking the intercept probability of random linear network coding"
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"
    - "secure on off transmission design with channel estimation errors"
    - "wireless physical layer security with imperfect channel state information a survey"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"
    - "ldpc code design for the bpsk constrained gaussian wiretap channel"

Connected through hyperedge HE-5 (induced by source paper "secure compute and forward in a bidirectional relay"):
  with members:
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "secure computation in a bidirectional relay"
    - "reliable physical layer network coding"
    - "lattice codes for the gaussian wiretap channel"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"
    - "channel coding and decoding in a relay system operated with physical layer network coding"
    - "providing secrecy with lattice codes"
    - "on the secrecy rate of interference networks using structured codes"

Connected through hyperedge HE-6 (induced by source paper "weak secrecy in the multi way untrusted relay channel with compute and forward"):
  with members:
    - "secure compute and forward in a bidirectional relay"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "secure communication via an untrusted non regenerative relay in fading channels"
    - "reliable physical layer network coding"
    - "optimal beamforming in interference networks with perfect local channel information"
    - "strongly secure communications over the two way wiretap channel"
    - "strong secrecy from channel resolvability"
    - "integer forcing linear receivers"

Connected through hyperedge HE-7 (induced by source paper "ber based physical layer security with finite codelength combining strong converse and error amplification"):
  with members:
    - "performance assessment and design of finite length ldpc codes for the gaussian wiretap channel"
    - "performance analysis and design of two edge type ldpc codes for the bec wiretap channel"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "on secrecy above secrecy capacity"
    - "ldpc code design for the bpsk constrained gaussian wiretap channel"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
    - "invertible extractors and wiretap protocols"

Connected through hyperedge HE-8 (induced by source paper "probability estimates for fading and wiretap channels from ideal class zeta functions"):
  with members:
    - "nonasymptotic probability bounds for fading channels exploiting dedekind zeta functions"
    - "inverse determinant sums and connections between fading channel information theory and algebra"
    - "diversity multiplexing gain tradeoff a tool in algebra"
    - "on the eavesdropper s correct decision in gaussian and fading wiretap channels using lattice codes"
    - "an algebraic look into mac dmt of lattice space time codes"
    - "an error probability approach to mimo wiretap channels"
    - "lattice code design for the rayleigh fading wiretap channel"
    - "unimodular lattices for the gaussian wiretap channel"

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)