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 "joint uplink downlink cell associations for interference networks with local connectivity"):
  Abstract: We study information theoretic models of interference networks that consist of K Base Station (BS) - Mobile Terminal (MT) pairs. Each BS is connected to the MT carrying the same index as well as L following MTs, where the connectivity parameter L >= 1. We fix the value of L and study large networks as $K$ goes to infinity. We assume that each MT can be associated with N BSs, and these associations are determined by a cloud-based controller that has a global view of the network. An MT has to be associated with a BS, in order for the BS to transmit its message in the downlink, or decode its message in the uplink. In previous work, the cell associations that maximize the average uplink-downlink per user degrees of freedom (puDoF) were identified for the case when L=1. Further, when only the downlink is considered, the problem was settled for all values of L when we are restricted to use only zero-forcing interference cancellation schemes. In this work, we first propose puDoF inner bounds for arbitrary values of L when only the uplink is considered, and characterize the uplink puDoF value when only zero-forcing schemes are allowed and N >= L/2. We then introduce new achievable average uplink-downlink puDoF values, and conjecture that the new scheme is optimal for all values of L, when we restrict our attention to zero-forcing schemes.

Includes members:
  Member "conferencing in wyner s asymmetric interference network effect of number of rounds":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complete interference mitigation through receiver caching in wyner s networks")
  Member "joint optimization of cloud and edge processing for fog radio access networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "power efficient resource allocation in c rans with sinr constraints and deadlines")
  Member "degrees of freedom in wireless interference networks with cooperative transmission and backhaul load constraints":
    also connected through other hyperedges:
      (none)
  Member "cell associations that maximize the average uplink downlink degrees of freedom":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "degrees of freedom in wireless interference networks with cooperative transmission and backhaul load constraints")
  Member "cloud radio access network virtualizing wireless access for dense heterogeneous systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint 3d maneuver and power adaptation for secure uav communication with comp reception")
  Member "performance of cloud radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "degrees of freedom in wireless interference networks with cooperative transmission and backhaul load constraints")
  Member "degrees of freedom of interference channels with comp transmission and reception":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "degrees of freedom of cache aided wireless cellular networks")

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)