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 "on the degrees of freedom of the large scale interfering two way relay network"):
  Abstract: Achievable degrees of freedom (DoF) of the   large-scale   interfering two-way relay network is investigated. The network consists of    $K$   pairs of communication nodes (CNs) and    $N$   relay nodes (RNs). It is assumed that    $K\ll N$   and that each pair of CNs communicates with each other through one of the    $N$   RNs without a direct link between them. Interference among RNs is also considered. Assuming local channel state information (CSI) at each RN, a distributed and opportunistic RN selection technique is proposed for the following three promising relaying protocols: amplify-and-forward (AF), decode-and-forward (DF), and compute-and-forward (CF) relaying protocols. As a main result, the asymptotically achievable DoF is characterized as    $N$   increases for the three relaying protocols. In particular, a sufficient condition on    $N$   required to achieve the certain DoF of the network is analyzed. Through extensive simulations, it is shown that the proposed RN selection techniques outperform conventional schemes in terms of achievable rate, even in practical communication scenarios. Note that the proposed technique operates with a distributed manner and requires only local CSI, leading to easy implementation for practical wireless systems.

Includes members:
  Member "what will 5g be":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")
  Member "an algebraic approach to physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "degrees of freedom for mimo two way x relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal dof region for the asymmetric two pair mimo two way relay channel")
  Member "degrees of freedom of two hop wireless networks everyone gets the entire cake":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "opportunistic network decoupling with virtual full duplex operation in multi source interfering relay networks")
  Member "opportunistic interference mitigation achieves optimal degrees of freedom in wireless multi cell uplink networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "opportunistic downlink interference alignment for multi cell mimo networks")
  Member "reliable physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards massive connectivity support for scalable mmtc communications in 5g networks")
  Member "n k user interference channels degrees of freedom":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the scaling of interference alignment under delay and power constraints")
  Member "a simple cooperative diversity method based on network path selection":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "dynwalks global topology and recent changes awareness dynamic network embedding")

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)