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: "construction a of lattices over number fields and block fading wiretap coding"
  Abstract: We propose a lattice construction from totally real and complex multiplication fields, which naturally generalizes Construction A of lattices from    $p$   -ary codes obtained from the cyclotomic field    $ \mathbb {Q}(\zeta _{p})$   ,    $p$    a prime, which in turn contains the so-called Construction A of lattices from binary codes as a particular case. We focus on the maximal totally real subfield    $ \mathbb {Q}(\zeta _{p^{r}}\,+\,\zeta _{p}^{-r})$    of the cyclotomic field    $ \mathbb {Q}(\zeta _{p^{r}})$   ,    $r\geq 1$   . Our construction has applications to coset encoding of algebraic lattice codes for block fading channels, and in particular for block fading wiretap channels.

Connected through hyperedge HE-1 (induced by source paper "lattice coding for downlink multiuser transmission"):
  with members:
    - "downlink non orthogonal multiple access without sic for block fading channels an algebraic rotation approach"
    - "joint pilot and payload power control for uplink mimo noma with mrc sic receivers"
    - "short packet downlink transmission with non orthogonal multiple access"
    - "a multi beam noma framework for hybrid mmwave systems"
    - "optimal resource allocation for power efficient mc noma with imperfect channel state information"
    - "improved decoding and error floor analysis of staircase codes"
    - "performance analysis of a hybrid downlink uplink cooperative noma scheme"
    - "on non orthogonal multiple access with finite alphabet inputs in z channels"

Connected through hyperedge HE-2 (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"
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"

Connected through hyperedge HE-3 (induced by source paper "ring compute and forward over block fading channels"):
  with members:
    - "boosted kz and lll algorithms"
    - "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward"
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "universal lattice codes for mimo channels"
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "lattices over eisenstein integers for compute and forward"
    - "an algebraic approach to physical layer network coding"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"

Connected through hyperedge HE-4 (induced by source paper "on the design of multi dimensional irregular repeat accumulate lattice codes"):
  with members:
    - "leech constellations of construction a lattices"
    - "lattice partition multiple access a new method of downlink non orthogonal multiuser transmissions"
    - "construction of full diversity ldpc lattices for block fading channels"
    - "lattice index coding"
    - "lattice index codes from algebraic number fields"
    - "lattices over eisenstein integers for compute and forward"
    - "low density lattice codes"
    - "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"

Connected through hyperedge HE-5 (induced by source paper "random ensembles of lattices from generalized reductions"):
  with members:
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "lattice index codes from algebraic number fields"
    - "semantically secure lattice codes for the gaussian wiretap channel"

Connected through hyperedge HE-6 (induced by source paper "universal lattice codes for mimo channels"):
  with members:
    - "random ensembles of lattices from generalized reductions"
    - "awgn goodness is enough capacity achieving lattice codes based on dithered probabilistic shaping"
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "almost universal codes for fading wiretap channels"
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "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"

Connected through hyperedge HE-7 (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"
    - "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-8 (induced by source paper "algebraic lattice codes achieve the capacity of the compound block fading channel"):
  with members:
    - "adaptive compute and forward with lattice codes over algebraic integers"
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "achieving awgn channel capacity with lattice gaussian coding"
    - "dispersion analysis of infinite constellations in ergodic fading channels"
    - "fundamental limits of infinite constellations in mimo fading 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)