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 analytical and geometric lattice design criteria for wiretap coset codes"
  Abstract: This paper considers physical layer security and the design of secure coset codes for wiretap channels, where information is not to be leaked to an eavesdropper having a degraded channel. The eavesdropper's bounds for correct decoding probability and information are first revisited, and a new variant of the information bound is derived. The new bound is valid for a general channel with any fading and Gaussian noise. From these bounds, it is explicit that both the information and probability are upper bounded by the average flatness factor, i.e., the expected theta function of the faded lattice related to the eavesdropper. Taking the minimization of the average flatness factor as a design criterion, simple geometric heuristics to minimize it in the low signal-to-noise ratio (SNR) regime in Gaussian and Rayleigh fast fading channels are motivated. It is concluded that in the Gaussian channel, the security boils down to the sphere packing density of the eavesdropper's lattice, whereas in the Rayleigh fading channel a full-diversity well-rounded lattice with a dense sphere packing will provide the best secrecy. The proposed criteria are backed up by extensive numerical experiments.

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"
    - "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"
    - "achieving secrecy capacity of the gaussian wiretap channel with polar lattices"

Connected through hyperedge HE-2 (induced by source paper "well rounded lattices for coset coding in mimo wiretap channels"):
  with members:
    - "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"
    - "inverse determinant sums and connections between fading channel information theory and algebra"

Connected through hyperedge HE-3 (induced by source paper "information bounds and flatness factor approximation for fading wiretap mimo channels"):
  with members:
    - "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"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "an error probability approach to mimo wiretap channels"
    - "lattice code design for the rayleigh fading 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)