{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TA4GJ2Y2DAV4J4OOTZASHDGO7R","short_pith_number":"pith:TA4GJ2Y2","schema_version":"1.0","canonical_sha256":"983864eb1a182bc4f1ce9e41238ccefc71e0ef388451f6762f4ef3b3a33e4c1d","source":{"kind":"arxiv","id":"2112.02656","version":1},"attestation_state":"computed","paper":{"title":"Intrinisic Gradient Compression for Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Franklyn Wang, Luke Melas-Kyriazi","submitted_at":"2021-12-05T19:16:54Z","abstract_excerpt":"Federated learning is a rapidly-growing area of research which enables a large number of clients to jointly train a machine learning model on privately-held data. One of the largest barriers to wider adoption of federated learning is the communication cost of sending model updates from and to the clients, which is accentuated by the fact that many of these devices are bandwidth-constrained. In this paper, we aim to address this issue by optimizing networks within a subspace of their full parameter space, an idea known as intrinsic dimension in the machine learning theory community. We use a co"},"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":"2112.02656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-05T19:16:54Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7dcadb400a8216ca91203d8d9993825b0d9677b0d4b99a50d0f29c52fed0f251","abstract_canon_sha256":"99b9a0f8885902bd8a323d489094b99d581e7ba82955bdc04fd3892677391ea7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:37:55.736209Z","signature_b64":"GG0TbUJ5fKWWco6piOP7zoidx7P0599W4rTnjgmcTephR0JC52POf6kUNVLQdaLiYkUKujenEheq3uDMklV8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"983864eb1a182bc4f1ce9e41238ccefc71e0ef388451f6762f4ef3b3a33e4c1d","last_reissued_at":"2026-07-05T03:37:55.735790Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:37:55.735790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intrinisic Gradient Compression for Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Franklyn Wang, Luke Melas-Kyriazi","submitted_at":"2021-12-05T19:16:54Z","abstract_excerpt":"Federated learning is a rapidly-growing area of research which enables a large number of clients to jointly train a machine learning model on privately-held data. One of the largest barriers to wider adoption of federated learning is the communication cost of sending model updates from and to the clients, which is accentuated by the fact that many of these devices are bandwidth-constrained. In this paper, we aim to address this issue by optimizing networks within a subspace of their full parameter space, an idea known as intrinsic dimension in the machine learning theory community. We use a co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.02656","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/2112.02656/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":"2112.02656","created_at":"2026-07-05T03:37:55.735855+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.02656v1","created_at":"2026-07-05T03:37:55.735855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.02656","created_at":"2026-07-05T03:37:55.735855+00:00"},{"alias_kind":"pith_short_12","alias_value":"TA4GJ2Y2DAV4","created_at":"2026-07-05T03:37:55.735855+00:00"},{"alias_kind":"pith_short_16","alias_value":"TA4GJ2Y2DAV4J4OO","created_at":"2026-07-05T03:37:55.735855+00:00"},{"alias_kind":"pith_short_8","alias_value":"TA4GJ2Y2","created_at":"2026-07-05T03:37:55.735855+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.21735","citing_title":"Equitable Federated Learning with NCA","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TA4GJ2Y2DAV4J4OOTZASHDGO7R","json":"https://pith.science/pith/TA4GJ2Y2DAV4J4OOTZASHDGO7R.json","graph_json":"https://pith.science/api/pith-number/TA4GJ2Y2DAV4J4OOTZASHDGO7R/graph.json","events_json":"https://pith.science/api/pith-number/TA4GJ2Y2DAV4J4OOTZASHDGO7R/events.json","paper":"https://pith.science/paper/TA4GJ2Y2"},"agent_actions":{"view_html":"https://pith.science/pith/TA4GJ2Y2DAV4J4OOTZASHDGO7R","download_json":"https://pith.science/pith/TA4GJ2Y2DAV4J4OOTZASHDGO7R.json","view_paper":"https://pith.science/paper/TA4GJ2Y2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.02656&json=true","fetch_graph":"https://pith.science/api/pith-number/TA4GJ2Y2DAV4J4OOTZASHDGO7R/graph.json","fetch_events":"https://pith.science/api/pith-number/TA4GJ2Y2DAV4J4OOTZASHDGO7R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TA4GJ2Y2DAV4J4OOTZASHDGO7R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TA4GJ2Y2DAV4J4OOTZASHDGO7R/action/storage_attestation","attest_author":"https://pith.science/pith/TA4GJ2Y2DAV4J4OOTZASHDGO7R/action/author_attestation","sign_citation":"https://pith.science/pith/TA4GJ2Y2DAV4J4OOTZASHDGO7R/action/citation_signature","submit_replication":"https://pith.science/pith/TA4GJ2Y2DAV4J4OOTZASHDGO7R/action/replication_record"}},"created_at":"2026-07-05T03:37:55.735855+00:00","updated_at":"2026-07-05T03:37:55.735855+00:00"}