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: "on complex lll algorithm for integer forcing linear receivers"
  Abstract: Integer-forcing (IF) linear receiver has been recently introduced for multiple-input multiple-output (MIMO) fading channels. The receiver has to compute an integer linear combination of the symbols as a part of the decoding process. In particular, the integer coefficients have to be chosen based on the channel realizations, and the choice of such coefficients is known to determine the receiver performance. The original known solution of finding these integers was based on exhaustive search. A practical algorithm based on HKZ and Minkowski lattice reduction algorithms was also proposed recently. In this paper, we propose a low-complexity method to obtain the integer coefficients for the IF receiver. For the 2 × 2 MIMO channel, we study the effectiveness of the proposed method in terms of the ergodic rate. We also compare the bit error rate (BER) of our approach with that of other linear receivers, and show that the suggested algorithm outperforms the minimum mean square estimator (MMSE) and zero-forcing (ZF) linear receivers, but trades-off error performance for complexity in comparison with the IF receiver based on exhaustive search or on HKZ and Minkowski lattice reduction algorithms.

Connected through hyperedge HE-1 (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"
    - "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-2 (induced by source paper "integer forcing linear receivers a design criterion for full diversity stbcs"):
  with members:
    - "full diversity unitary precoded integer forcing"
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "diversity of mmse mimo receivers"
    - "integer forcing linear receivers"

Connected through hyperedge HE-3 (induced by source paper "compute compress and forward exploiting asymmetry of wireless relay networks"):
  with members:
    - "asymmetric compute and forward with csit"
    - "mimo multiway relaying with clustered full data exchange signal space alignment and degrees of freedom"
    - "towards the asymptotic sum capacity of the mimo cellular two way relay channel"
    - "phase precoded compute and forward with partial feedback"
    - "phase precoding for the compute and forward protocol"
    - "mimo multiway relaying with pairwise data exchange a degrees of freedom perspective"
    - "multilevel coding schemes for compute and forward with flexible decoding"
    - "degrees of freedom for the mimo multi way relay channel"

Connected through hyperedge HE-4 (induced by source paper "outage behavior of integer forcing with random unitary pre processing"):
  with members:
    - "joint unitary triangularization for gaussian multi user mimo networks"
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-5 (induced by source paper "outage behavior of randomly precoded integer forcing over mimo channels"):
  with members:
    - "joint unitary triangularization for gaussian multi user mimo networks"
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "a simple proof for the existence of good pairs of nested lattices"
    - "integer forcing linear receivers"

Connected through hyperedge HE-6 (induced by source paper "full diversity unitary precoded integer forcing"):
  with members:
    - "phase precoded compute and forward with partial feedback"
    - "phase precoding for the compute and forward protocol"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "an algebraic approach to physical layer network coding"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "diversity of mimo linear precoding"
    - "integer forcing linear receivers"
    - "hessian and concavity of mutual information differential entropy and entropy power in linear vector gaussian channels"

Connected through hyperedge HE-7 (induced by source paper "phase precoding for the compute and forward protocol"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "phase precoded compute and forward with partial feedback"
    - "lattices over eisenstein integers for compute and forward"
    - "an algebraic approach to physical layer network coding"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "computation alignment capacity approximation without noise accumulation"
    - "physical layer network coding tutorial survey and beyond"
    - "integer forcing linear receivers"

Connected through hyperedge HE-8 (induced by source paper "full diversity space time block codes for integer forcing linear receivers"):
  with members:
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "diversity of mmse mimo receivers"
    - "integer forcing linear receivers"
    - "two designs of space time block codes achieving full diversity with partial interference cancellation group decoding"
    - "on full diversity space time block codes with partial interference cancellation group decoding"

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)