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: "information bounds and flatness factor approximation for fading wiretap mimo channels"
  Abstract: In this article, the design of secure lattice coset codes for general wireless channels with fading and Gaussian noise is studied. Recalling the eavesdropper's probability and information bounds, a variant of the latter is given from which it is explicitly seen that both quantities are upper bounded by (increasing functions of) the expected flatness factor of the faded lattice related to the eavesdropper. #R##N#By making use of a recently developed approximation of the theta series of a lattice, it is further shown how the average flatness factor can be approximated numerically. In particular, based on the numerical computations, the average flatness factor not only bounds but also orders correctly the performance of different lattices.

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"
    - "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:
    - "on analytical and geometric lattice design criteria for wiretap coset codes"
    - "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 "well rounded lattices for reliability and security in rayleigh fading siso channels"):
  with members:
    - "almost universal codes for fading wiretap channels"
    - "locally diverse constellations from the special orthogonal group"
    - "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"
    - "integer space time block codes for practical mimo systems"
    - "inverse determinant sums and connections between fading channel information theory and algebra"
    - "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)