human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "compute and forward in cell free massive mimo great performance with low backhaul load"):
  Abstract: In this paper, we consider the uplink of cell-free massive MIMO systems, where a large number of distributed single antenna access points (APs) serve a much smaller number of users simultaneously via limited backhaul. For the first time, we investigate the performance of compute-and-forward (C&F) in such an ultra dense network with a realistic channel model (including fading, pathloss and shadowing). By utilising the characteristic of pathloss, a low complexity coefficient selection algorithm for C\&F is proposed. We also give a greedy AP selection method for message recovery. Additionally, we compare the performance of C&F to some other promising linear strategies for distributed massive MIMO, such as small cells (SC) and maximum ratio combining (MRC). Numerical results reveal that C&F not only reduces the backhaul load, but also significantly increases the system throughput for the symmetric scenario.

Includes members:
  Member "low complexity coefficient selection algorithms for compute and forward":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward")
  Member "cell free massive mimo versus small cells":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analysis of uav communications in cell free massive mimo systems")
  Member "a linearithmic time algorithm for a shortest vector problem in compute and forward design":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "low complexity coefficient selection algorithms for compute and forward")
  Member "cell free massive mimo uniformly great service for everyone":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "analysis of uav communications in cell free massive mimo systems")
  Member "compute and forward finding the best equation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "asymptotically optimal scheduling for compute and forward")
  Member "an algebraic approach to physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "scaling up mimo opportunities and challenges with very large arrays":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "compute and forward harnessing interference through structured codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "private information retrieval over gaussian mac")

Question: Please tell me which class the source paper 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)