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: "on the eavesdropper s correct decision in gaussian and fading wiretap channels using lattice codes"
  Abstract: In this paper, the probability of Eve the Eavesdropper's correct decision is considered both in the Gaussian and Rayleigh fading wiretap channels when using lattice codes for the transmission. #R##N#First, it is proved that the secrecy function determining Eve's performance attains its maximum at y=1 on all known extremal even unimodular lattices. This is a special case of a conjecture by Belfiore and Sol\'e. Further, a very simple method to verify or disprove the conjecture on any given unimodular lattice is given. #R##N#Second, preliminary analysis on the behavior of Eve's probability of correct decision in the fast fading wiretap channel is provided. More specifically, we compute the truncated inverse norm power sum factors in Eve's probability expression. The analysis reveals a performance-secrecy-complexity tradeoff: relaxing on the legitimate user's performance can significantly increase the security of transmission. The confusion experienced by the eavesdropper may be further increased by using skewed lattices, but at the cost of increased complexity.

Connected through hyperedge HE-1 (induced by source paper "on the secrecy gain of ell modular lattices"):
  with members:
    - "unimodular lattices for the gaussian wiretap channel"
    - "secrecy gain a wiretap lattice code design"

Connected through hyperedge HE-2 (induced by source paper "achieving secrecy capacity of the gaussian wiretap channel with polar lattices"):
  with members:
    - "covert communication over noisy channels a resolvability perspective"
    - "polar lattices for lossy compression"
    - "construction of capacity achieving lattice codes polar lattices"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the general wiretap channel"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "how to achieve the capacity of asymmetric channels"
    - "achieving awgn channel capacity with lattice gaussian coding"

Connected through hyperedge HE-3 (induced by source paper "semantically secure lattice codes for the gaussian wiretap channel"):
  with members:
    - "secret key generation from gaussian sources using lattice hashing"
    - "decoding by sampling a randomized lattice algorithm for bounded distance decoding"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
    - "strong secrecy from channel resolvability"
    - "the gaussian many to one interference channel with confidential messages"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"
    - "strong secrecy for erasure wiretap channels"

Connected through hyperedge HE-4 (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"
    - "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"
    - "secrecy gain a wiretap lattice code design"

Connected through hyperedge HE-5 (induced by source paper "nonasymptotic probability bounds for fading channels exploiting dedekind zeta functions"):
  with members:
    - "inverse determinant sums and connections between fading channel information theory and algebra"
    - "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"
    - "secrecy gain a wiretap lattice code design"

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.CR(Cryptography and Security)