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 "turbo aggregate breaking the quadratic aggregation barrier in secure federated learning"):
  Abstract: Federated learning is gaining significant interests as it enables model training over a large volume of data that is distributedly stored over many users, while protecting the privacy of the individual users. However, a major bottleneck in scaling federated learning to a large number of users is the overhead of secure model aggregation across many users. In fact, the overhead of state-of-the-art protocols for secure model aggregation grows quadratically with the number of users. We propose a new scheme, named Turbo-Aggregate, that in a network with $N$ users achieves a secure aggregation overhead of $O(N\log{N})$, as opposed to $O(N^2)$, while tolerating up to a user dropout rate of $50\%$. Turbo-Aggregate employs a multi-group circular strategy for efficient model aggregation, and leverages additive secret sharing and novel coding techniques for injecting aggregation redundancy in order to handle user dropouts while guaranteeing user privacy. We experimentally demonstrate that Turbo-Aggregate achieves a total running time that grows almost linear in the number of users, and provides up to $14\times$ speedup over the state-of-the-art schemes with upto $N=200$ users. We also experimentally evaluate the impact of several key network parameters (e.g., user dropout rate, bandwidth, and model size) on the performance of Turbo-Aggregate.

Includes members:
  Member "advances and open problems in federated learning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "trends and advancements in deep neural network communication")
  Member "central server free federated learning over single sided trust social networks":
    also connected through other hyperedges:
      (none)
  Member "towards federated learning at scale system design":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "do we really need to access the source data source hypothesis transfer for unsupervised domain adaptation")
  Member "can you really backdoor federated learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning to detect malicious clients for robust federated learning")
  Member "semi cyclic stochastic gradient descent":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "practical and bilateral privacy preserving federated learning")
  Member "local model poisoning attacks to byzantine robust federated learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning to detect malicious clients for robust federated learning")
  Member "peer to peer federated learning on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "trends and advancements in deep neural network communication")
  Member "federated learning challenges methods and future directions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "trends and advancements in deep neural network communication")

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.LG(Machine Learning)