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: "well rounded lattices for reliability and security in rayleigh fading siso channels"
  Abstract: In the wiretap setting it is assumed that the same message is transmitted over two different channels, a channel to an intended/legitimate receiver Bob and a different channel to an eavesdropper Eve. Three contradicting objectives are simultaneously tried to be achieved: A high information rate between the sender and Bob, high reliability at the legitimate receiver, and minimal mutual information between the message and the output at the eavesdropper. For many channel models asymptotically optimal coding schemes are known, but less effort has been put into actual realizations of wiretap codes for practical parameters. Bounds on the mutual information and error probability when using coset coding on a Rayleigh fading channel were recently established by Oggier and Belfiore, and the results in this paper build on their work. However, instead of using their ultimate inverse norm sum approximation, a more precise expression for the eavesdropper’s probability of correct decision is used in order to determine a general class of good coset codes. The code constructions are based on well-rounded lattices arising from simple geometric criteria. In addition to new coset codes and simulation results, novel number-theoretic results on well-rounded ideal lattices are presented.

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"
    - "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 via polynomials"):
  with members:
    - "well rounded lattices for coset coding in mimo wiretap channels"
    - "on projections of arbitrary lattices"

Connected through hyperedge HE-3 (induced by source paper "lattice codes for physical layer communications"):
  with members:
    - "bounds on fast decodability of space time block codes skew hermitian matrices and azumaya algebras"
    - "the compute and forward protocol implementation and practical aspects"
    - "lattice code design for the rayleigh fading wiretap channel"
    - "compute and forward harnessing interference through structured codes"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-4 (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"
    - "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-5 (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"
    - "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"
    - "inverse determinant sums and connections between fading channel information theory and algebra"

Connected through hyperedge HE-6 (induced by source paper "information bounds and flatness factor approximation for fading wiretap mimo channels"):
  with members:
    - "on analytical and geometric lattice design criteria for wiretap coset codes"
    - "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)