{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BTFQRG4Q7VXQB7YXK6XDC7TRVU","short_pith_number":"pith:BTFQRG4Q","schema_version":"1.0","canonical_sha256":"0ccb089b90fd6f00ff1757ae317e71ad3bbfffe5b1d134d7cfd282f068131ff7","source":{"kind":"arxiv","id":"2208.09432","version":1},"attestation_state":"computed","paper":{"title":"Federated Select: A Primitive for Communication- and Memory-Efficient Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Blaise Ag\\\"uera y Arcas, Brendan McMahan, Kallista Bonawitz, Stanislav Chiknavaryan, Zachary Charles","submitted_at":"2022-08-19T16:26:03Z","abstract_excerpt":"Federated learning (FL) is a framework for machine learning across heterogeneous client devices in a privacy-preserving fashion. To date, most FL algorithms learn a \"global\" server model across multiple rounds. At each round, the same server model is broadcast to all participating clients, updated locally, and then aggregated across clients. In this work, we propose a more general procedure in which clients \"select\" what values are sent to them. Notably, this allows clients to operate on smaller, data-dependent slices. In order to make this practical, we outline a primitive, federated select, "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2208.09432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-08-19T16:26:03Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"d84d4bbc60d42002747e5a29c9a6a647afbaa2e2095308763fe526e181070dde","abstract_canon_sha256":"2bc62e53248e468b925e3ecba9642695f4417a92eb10ab0b7f57549b513fd32c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:49:59.873995Z","signature_b64":"LvdZlVqARi2QeSNlDvkjrzVfjR8Dv7SkX2LvHgX0lft15eghxopWz48IOWlRWigZ9cQsICqUnfQmW91w/ZbZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ccb089b90fd6f00ff1757ae317e71ad3bbfffe5b1d134d7cfd282f068131ff7","last_reissued_at":"2026-07-05T04:49:59.873566Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:49:59.873566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Federated Select: A Primitive for Communication- and Memory-Efficient Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Blaise Ag\\\"uera y Arcas, Brendan McMahan, Kallista Bonawitz, Stanislav Chiknavaryan, Zachary Charles","submitted_at":"2022-08-19T16:26:03Z","abstract_excerpt":"Federated learning (FL) is a framework for machine learning across heterogeneous client devices in a privacy-preserving fashion. To date, most FL algorithms learn a \"global\" server model across multiple rounds. At each round, the same server model is broadcast to all participating clients, updated locally, and then aggregated across clients. In this work, we propose a more general procedure in which clients \"select\" what values are sent to them. Notably, this allows clients to operate on smaller, data-dependent slices. In order to make this practical, we outline a primitive, federated select, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.09432","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.09432/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2208.09432","created_at":"2026-07-05T04:49:59.873622+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.09432v1","created_at":"2026-07-05T04:49:59.873622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.09432","created_at":"2026-07-05T04:49:59.873622+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTFQRG4Q7VXQ","created_at":"2026-07-05T04:49:59.873622+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTFQRG4Q7VXQB7YX","created_at":"2026-07-05T04:49:59.873622+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTFQRG4Q","created_at":"2026-07-05T04:49:59.873622+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.24012","citing_title":"FedSLoP: Memory-Efficient Federated Learning with Low-Rank Gradient Projection","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24012","citing_title":"FedSLoP: Memory-Efficient Federated Learning with Low-Rank Gradient Projection","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BTFQRG4Q7VXQB7YXK6XDC7TRVU","json":"https://pith.science/pith/BTFQRG4Q7VXQB7YXK6XDC7TRVU.json","graph_json":"https://pith.science/api/pith-number/BTFQRG4Q7VXQB7YXK6XDC7TRVU/graph.json","events_json":"https://pith.science/api/pith-number/BTFQRG4Q7VXQB7YXK6XDC7TRVU/events.json","paper":"https://pith.science/paper/BTFQRG4Q"},"agent_actions":{"view_html":"https://pith.science/pith/BTFQRG4Q7VXQB7YXK6XDC7TRVU","download_json":"https://pith.science/pith/BTFQRG4Q7VXQB7YXK6XDC7TRVU.json","view_paper":"https://pith.science/paper/BTFQRG4Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.09432&json=true","fetch_graph":"https://pith.science/api/pith-number/BTFQRG4Q7VXQB7YXK6XDC7TRVU/graph.json","fetch_events":"https://pith.science/api/pith-number/BTFQRG4Q7VXQB7YXK6XDC7TRVU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTFQRG4Q7VXQB7YXK6XDC7TRVU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTFQRG4Q7VXQB7YXK6XDC7TRVU/action/storage_attestation","attest_author":"https://pith.science/pith/BTFQRG4Q7VXQB7YXK6XDC7TRVU/action/author_attestation","sign_citation":"https://pith.science/pith/BTFQRG4Q7VXQB7YXK6XDC7TRVU/action/citation_signature","submit_replication":"https://pith.science/pith/BTFQRG4Q7VXQB7YXK6XDC7TRVU/action/replication_record"}},"created_at":"2026-07-05T04:49:59.873622+00:00","updated_at":"2026-07-05T04:49:59.873622+00:00"}