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 "scheduling policies for federated learning in wireless networks"):
  Abstract: Motivated by the increasing computational capacity of wireless user equipments (UEs), e.g., smart phones, tablets, or vehicles, as well as the increasing concerns about sharing private data, a new machine learning model has emerged, namely federated learning (FL), that allows a decoupling of data acquisition and computation at the central unit. Unlike centralized learning taking place in a data center, FL usually operates in a wireless edge network where the communication medium is resource-constrained and unreliable. Due to limited bandwidth, only a portion of UEs can be scheduled for updates at each iteration. Due to the shared nature of the wireless medium, transmissions are subjected to interference and are not guaranteed. The performance of FL system in such a setting is not well understood. In this paper, an analytical model is developed to characterize the performance of FL in wireless networks. Particularly, tractable expressions are derived for the convergence rate of FL in a wireless setting, accounting for effects from both scheduling schemes and inter-cell interference. Using the developed analysis, the effectiveness of three different scheduling policies, i.e., random scheduling (RS), round robin (RR), and proportional fair (PF), are compared in terms of FL convergence rate. It is shown that running FL with PF outperforms RS and RR if the network is operating under a high signal-to-interference-plus-noise ratio (SINR) threshold, while RR is more preferable when the SINR threshold is low. Moreover, the FL convergence rate decreases rapidly as the SINR threshold increases, thus confirming the importance of compression and quantization of the update parameters. The analysis also reveals a trade-off between the number of scheduled UEs and subchannel bandwidth under a fixed amount of available spectrum.

Includes members:
  Member "in edge ai intelligentizing mobile edge computing caching and communication by federated learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy efficient federated edge learning with joint communication and computation design")
  Member "client selection for federated learning with heterogeneous resources in mobile edge":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tifl a tier based federated learning system")
  Member "coded federated computing in wireless networks with straggling devices and imperfect csi":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wireless edge computing with latency and reliability guarantees")
  Member "wireless network intelligence at the edge":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "adaptive gradient sparsification for efficient federated learning an online learning approach")
  Member "federated learning strategies for improving communication efficiency":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "trends and advancements in deep neural network communication")
  Member "broadband analog aggregation for low latency federated edge learning extended version":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "wireless federated learning with local differential privacy")
  Member "federated learning via over the air computation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "wireless federated learning with local differential privacy")
  Member "adaptive federated learning in resource constrained edge computing systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "scaffold stochastic controlled averaging for federated learning")

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)