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: "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
  Abstract: An open-loop single-user multiple-input multiple-output communication scheme is considered where a transmitter, equipped with multiple antennas, encodes the data into independent streams all taken from the same linear code. The coded streams are then linearly precoded using the encoding matrix of a perfect linear dispersion space-time code. At the receiver side, integer-forcing equalization is applied, followed by standard single-stream decoding. It is shown that this communication architecture achieves the capacity of any Gaussian multiple-input multiple-output channel up to a gap that depends only on the number of transmit antennas.

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"
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"

Connected through hyperedge HE-2 (induced by source paper "steepest gradient based orthogonal precoder for integer forcing mimo"):
  with members:
    - "boosted kz and lll algorithms"
    - "efficient integer coefficient search for compute and forward"
    - "encoding and indexing of lattice codes"
    - "an efficient optimal algorithm for the successive minima problem"
    - "full diversity unitary precoded integer forcing"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "integer forcing linear receivers"
    - "mimo precoding with x and y codes"

Connected through hyperedge HE-3 (induced by source paper "a modulo based architecture for analog to digital conversion"):
  with members:
    - "on unlimited sampling"
    - "performance analysis and optimal filter design for sigma delta modulation via duality with dpcm"
    - "massive mimo for next generation wireless systems"
    - "integer forcing source coding"
    - "an algebraic approach to physical layer network coding"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "universal rate efficient scalar quantization"
    - "from theory to practice sub nyquist sampling of sparse wideband analog signals"

Connected through hyperedge HE-4 (induced by source paper "on the separability of ergodic fading mimo channels a lattice coding approach"):
  with members:
    - "lattice coding and decoding for multiple antenna ergodic fading channels"
    - "polar codes and polar lattices for independent fading channels"
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "dispersion analysis of infinite constellations in ergodic fading channels"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-5 (induced by source paper "gaussian multiple access via compute and forward"):
  with members:
    - "a joint typicality approach to algebraic network information theory"
    - "asymmetric compute and forward with csit"
    - "successive integer forcing and its sum rate optimality"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "nested lattice codes for gaussian relay networks with interference"
    - "integer forcing linear receivers"
    - "lattice strategies for the dirty multiple access channel"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-6 (induced by source paper "integer forcing message recovering in interference channels"):
  with members:
    - "integer forcing and forward transceiver design for mimo multipair two way relaying"
    - "successive integer forcing and its sum rate optimality"
    - "simplified compute and forward and its performance analysis"
    - "on complex lll algorithm for integer forcing linear receivers"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-7 (induced by source paper "lattice coding and decoding for multiple antenna ergodic fading channels"):
  with members:
    - "polar codes and polar lattices for independent fading channels"
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "dispersion analysis of infinite constellations in ergodic fading channels"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "lattice codes for the gaussian relay channel decode and forward and compress and forward"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-8 (induced by source paper "multilevel code construction for compound fading channels"):
  with members:
    - "polar codes and polar lattices for independent fading channels"
    - "algebraic lattice codes achieve the capacity of the compound block fading channel"
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "polar coding for fading channels binary and exponential channel cases"
    - "universal polar codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"

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)