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: "probability estimates for fading and wiretap channels from ideal class zeta functions"
  Abstract: In this paper, new probability estimates are derived for ideal lattice codes from totally real number fields using ideal class Dedekind zeta functions. In contrast to previous work on the subject, it is not assumed that the ideal in question is principal. In particular, it is shown that the corresponding inverse norm sum depends not only on the regulator and discriminant of the number field, but also on the values of the ideal class Dedekind zeta functions. Along the way, we derive an estimate of the number of elements in a given ideal with a certain algebraic norm within a finite hypercube. We provide several examples which measure the accuracy and predictive ability of our theorems.

Connected through hyperedge HE-1 (induced by source paper "semantically secure lattice codes for compound mimo channels"):
  with members:
    - "random ensembles of lattices from generalized reductions"
    - "optimal signaling for secure communications over gaussian mimo wiretap channels"
    - "universal lattice codes for mimo channels"
    - "a general formula for compound channel capacity"
    - "the secrecy capacity of compound gaussian mimo wiretap channels"
    - "the mimo wiretap channel decomposed"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"

Connected through hyperedge HE-2 (induced by source paper "on secrecy metrics for physical layer security over quasi static fading channels"):
  with members:
    - "performance assessment and design of finite length ldpc codes for the gaussian wiretap channel"
    - "rethinking the intercept probability of random linear network coding"
    - "secure on off transmission design with channel estimation errors"
    - "wireless physical layer security with imperfect channel state information a survey"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"
    - "ldpc code design for the bpsk constrained gaussian wiretap channel"
    - "rethinking the secrecy outage formulation a secure transmission design perspective"

Connected through hyperedge HE-3 (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"
    - "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"
    - "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-4 (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"
    - "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"
    - "locally diverse constellations from the special orthogonal group"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "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 "almost universal codes for fading wiretap channels"):
  with members:
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "number field lattices achieve gaussian and rayleigh channel capacity within a constant gap"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "on secrecy capacity of fast fading mimome wiretap channels with statistical csit"
    - "on secrecy capacity of fast fading multiple input wiretap channels with statistical csit"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
    - "an error probability approach to mimo wiretap channels"
    - "strong secrecy from channel resolvability"

Connected through hyperedge HE-6 (induced by source paper "well rounded lattices for reliability and security in rayleigh fading siso channels"):
  with members:
    - "information bounds and flatness factor approximation for fading wiretap mimo channels"
    - "almost universal codes for fading wiretap channels"
    - "locally diverse constellations from the special orthogonal group"
    - "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)