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: "integer forcing mimo linear receivers based on lattice reduction"
  Abstract: A new architecture called integer-forcing (IF) linear receiver has been recently proposed for multiple-input multiple-output (MIMO) fading channels, wherein an appropriate integer linear combination of the received symbols has to be computed as a part of the decoding process. In this paper, we propose a method based on Hermite-Korkine-Zolotareff (HKZ) and Minkowski lattice basis reduction algorithms to obtain the integer coefficients for the IF receiver. We show that the proposed method provides a lower bound on the ergodic rate, and achieves the full receive diversity. Suitability of complex Lenstra-Lenstra-Lovasz (LLL) lattice reduction algorithm (CLLL) to solve the problem is also investigated. Furthermore, we establish the connection between the proposed IF linear receivers and lattice reduction-aided MIMO detectors (with equivalent complexity), and point out the advantages of the former class of receivers over the latter. For the $2 \times 2$ and $4\times 4$ MIMO channels, we compare the coded-block error rate and bit error rate of the proposed approach with that of other linear receivers. Simulation results show that the proposed approach outperforms the zero-forcing (ZF) receiver, minimum mean square error (MMSE) receiver, and the lattice reduction-aided MIMO detectors.

Connected through hyperedge HE-1 (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"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "integer forcing linear receivers"
    - "mimo precoding with x and y codes"

Connected through hyperedge HE-2 (induced by source paper "improved upper bounds on the hermite and kz constants"):
  with members:
    - "on the kz reduction"
    - "boosted kz and lll algorithms"
    - "successive integer forcing and its sum rate optimality"
    - "decoding by embedding correct decoding radius and dmt optimality"
    - "on the proximity factors of lattice reduction aided decoding"

Connected through hyperedge HE-3 (induced by source paper "reduced dimension design of mimo over the air computing for data aggregation in clustered iot networks"):
  with members:
    - "broadband analog aggregation for low latency federated edge learning extended version"
    - "wirelessly powered data aggregation for iot via over the air functional computation beamforming and power control"
    - "blind over the air computation and data fusion via provable wirtinger flow"
    - "hybrid beamforming via the kronecker decomposition for the millimeter wave massive mimo systems"
    - "inference from randomized transmissions by many backscatter sensors"
    - "alternating minimization algorithms for hybrid precoding in millimeter wave mimo systems"
    - "communication efficient learning of deep networks from decentralized data"
    - "over the air function computation in sensor networks"

Connected through hyperedge HE-4 (induced by source paper "broadband analog aggregation for low latency federated edge learning extended version"):
  with members:
    - "machine learning at the wireless edge distributed stochastic gradient descent over the air"
    - "efficient decentralized deep learning by dynamic model averaging"
    - "federated learning via over the air computation"
    - "reduced dimension design of mimo over the air computing for data aggregation in clustered iot networks"
    - "wirelessly powered data aggregation for iot via over the air functional computation beamforming and power control"
    - "towards an intelligent edge wireless communication meets machine learning"
    - "a survey on mobile edge computing the communication perspective"
    - "sparse communication for distributed gradient descent"

Connected through hyperedge HE-5 (induced by source paper "generalized compute compress and forward"):
  with members:
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "compute compress and forward exploiting asymmetry of wireless relay networks"
    - "lattice codes for many to one interference channels with and without cognitive messages"
    - "asymmetric compute and forward with csit"
    - "optimized backhaul compression for uplink cloud radio access network"
    - "successive integer forcing and its sum rate optimality"
    - "an algebraic approach to physical layer network coding"
    - "a simple proof for the existence of good pairs of nested lattices"

Connected through hyperedge HE-6 (induced by source paper "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward"):
  with members:
    - "low complexity coefficient selection algorithms for compute and forward"
    - "efficient integer coefficient search for compute and forward"
    - "a linearithmic time algorithm for a shortest vector problem in compute and forward design"
    - "a low complexity message recovery method for compute and forward relaying"
    - "asymmetric compute and forward with csit"
    - "an efficient algorithm for optimally solving a shortest vector problem in compute and forward protocol design"
    - "compute and forward protocol design based on improved sphere decoding"
    - "simplified compute and forward and its performance analysis"

Connected through hyperedge HE-7 (induced by source paper "on the kz reduction"):
  with members:
    - "effects of some lattice reductions on the success probability of the zero forcing decoder"
    - "boosted kz and lll algorithms"
    - "a modified kz reduction algorithm"
    - "success probability of the babai estimators for box constrained integer linear models"
    - "successive integer forcing and its sum rate optimality"
    - "decoding by embedding correct decoding radius and dmt optimality"
    - "effects of the lll reduction on the success probability of the babai point and on the complexity of sphere decoding"
    - "on the proximity factors of lattice reduction aided decoding"

Connected through hyperedge HE-8 (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"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "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 linear receivers"
    - "compute and forward harnessing interference through structured codes"

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)