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: "secret key generation from gaussian sources using lattice hashing"
  Abstract: We propose a simple yet complete lattice-based scheme for secret key generation from Gaussian sources in the presence of an eavesdropper, and show that it achieves strong secret key rates up to 1/2 nat from the optimal in the case of "degraded" source models. The novel ingredient of our scheme is a lattice-hashing technique, based on the notions of flatness factor and channel intrinsic randomness. The proposed scheme does not require dithering.

Connected through hyperedge HE-1 (induced by source paper "group secret key generation using algebraic rings in wireless networks"):
  with members:
    - "insider attacks on physical layer group secret key generation in wireless networks"
    - "exploiting channel diversity in secret key generation from multipath fading randomness"
    - "information theoretically secret key generation for fading wireless channels"
    - "group secret key generation algorithms"

Connected through hyperedge HE-2 (induced by source paper "group secret key generation using algebraic rings in three user wireless networks"):
  with members:
    - "insider attacks on physical layer group secret key generation in wireless networks"
    - "the effect of eavesdropper s statistics in experimental wireless secret key generation"
    - "exploiting channel diversity in secret key generation from multipath fading randomness"
    - "information theoretically secret key generation for fading wireless channels"
    - "two hop secure communication using an untrusted relay"
    - "group secret key generation algorithms"

Connected through hyperedge HE-3 (induced by source paper "security analysis of varepsilon almost dual universal 2 hash functions smoothing of min entropy versus smoothing of renyi entropy of order 2"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "uniform random number generation from markov chains non asymptotic and asymptotic analyses"
    - "equivocations exponents and second order coding rates under various r enyi information measures"
    - "non asymptotic and asymptotic analyses of information processing on markov chains"
    - "tight exponential analysis of universally composable privacy amplification and its applications"
    - "non asymptotic analysis of privacy amplification via renyi entropy and inf spectral entropy"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "strongly secure communications over the two way wiretap channel"

Connected through hyperedge HE-4 (induced by source paper "a lattice coding scheme for secret key generation from gaussian markov tree sources"):
  with members:
    - "a capacity achieving coding scheme for the awgn channel with polynomial encoding and decoding complexity"
    - "a simple proof for the existence of good pairs of nested lattices"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-5 (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-6 (induced by source paper "semantically secure lattice codes for the gaussian wiretap channel"):
  with members:
    - "on the eavesdropper s correct decision in gaussian and fading wiretap channels using lattice codes"
    - "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"

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)