{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:U3DYC4W3DSRQFFKZTOPITTZMZU","short_pith_number":"pith:U3DYC4W3","schema_version":"1.0","canonical_sha256":"a6c78172db1ca30295599b9e89cf2ccd0efa1120a1477ee395abe5ea23c1edce","source":{"kind":"arxiv","id":"2404.03524","version":1},"attestation_state":"computed","paper":{"title":"Approximate Gradient Coding for Privacy-Flexible Federated Learning with Non-IID Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Camilla Hollanti, Okko Makkonen, Sampo Niemel\\\"a, Serge Kas Hanna","submitted_at":"2024-04-04T15:29:50Z","abstract_excerpt":"This work focuses on the challenges of non-IID data and stragglers/dropouts in federated learning. We introduce and explore a privacy-flexible paradigm that models parts of the clients' local data as non-private, offering a more versatile and business-oriented perspective on privacy. Within this framework, we propose a data-driven strategy for mitigating the effects of label heterogeneity and client straggling on federated learning. Our solution combines both offline data sharing and approximate gradient coding techniques. Through numerical simulations using the MNIST dataset, we demonstrate t"},"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":"2404.03524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-04-04T15:29:50Z","cross_cats_sorted":["cs.CR","cs.DC","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"391845233056ef4414c99ab429b74b9c09ac505f1392e95ee6b030c210ed8812","abstract_canon_sha256":"9eb027e27eef61a790301989f3d4372b50ad3f5253ebc83b0d8e1b02b4243a6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:04:27.016238Z","signature_b64":"D6GTRieAnJ7Gx4+TS3hgKXn3qgdPGHIq2INLcFk1n7CmoRzKZ1EyQKI6YLDEY6/0a8FSDA6FMlUKN4nAwCriBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6c78172db1ca30295599b9e89cf2ccd0efa1120a1477ee395abe5ea23c1edce","last_reissued_at":"2026-07-05T08:04:27.015886Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:04:27.015886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Gradient Coding for Privacy-Flexible Federated Learning with Non-IID Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Camilla Hollanti, Okko Makkonen, Sampo Niemel\\\"a, Serge Kas Hanna","submitted_at":"2024-04-04T15:29:50Z","abstract_excerpt":"This work focuses on the challenges of non-IID data and stragglers/dropouts in federated learning. We introduce and explore a privacy-flexible paradigm that models parts of the clients' local data as non-private, offering a more versatile and business-oriented perspective on privacy. Within this framework, we propose a data-driven strategy for mitigating the effects of label heterogeneity and client straggling on federated learning. Our solution combines both offline data sharing and approximate gradient coding techniques. Through numerical simulations using the MNIST dataset, we demonstrate t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.03524","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/2404.03524/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":"2404.03524","created_at":"2026-07-05T08:04:27.015950+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.03524v1","created_at":"2026-07-05T08:04:27.015950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.03524","created_at":"2026-07-05T08:04:27.015950+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3DYC4W3DSRQ","created_at":"2026-07-05T08:04:27.015950+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3DYC4W3DSRQFFKZ","created_at":"2026-07-05T08:04:27.015950+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3DYC4W3","created_at":"2026-07-05T08:04:27.015950+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U3DYC4W3DSRQFFKZTOPITTZMZU","json":"https://pith.science/pith/U3DYC4W3DSRQFFKZTOPITTZMZU.json","graph_json":"https://pith.science/api/pith-number/U3DYC4W3DSRQFFKZTOPITTZMZU/graph.json","events_json":"https://pith.science/api/pith-number/U3DYC4W3DSRQFFKZTOPITTZMZU/events.json","paper":"https://pith.science/paper/U3DYC4W3"},"agent_actions":{"view_html":"https://pith.science/pith/U3DYC4W3DSRQFFKZTOPITTZMZU","download_json":"https://pith.science/pith/U3DYC4W3DSRQFFKZTOPITTZMZU.json","view_paper":"https://pith.science/paper/U3DYC4W3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.03524&json=true","fetch_graph":"https://pith.science/api/pith-number/U3DYC4W3DSRQFFKZTOPITTZMZU/graph.json","fetch_events":"https://pith.science/api/pith-number/U3DYC4W3DSRQFFKZTOPITTZMZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3DYC4W3DSRQFFKZTOPITTZMZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3DYC4W3DSRQFFKZTOPITTZMZU/action/storage_attestation","attest_author":"https://pith.science/pith/U3DYC4W3DSRQFFKZTOPITTZMZU/action/author_attestation","sign_citation":"https://pith.science/pith/U3DYC4W3DSRQFFKZTOPITTZMZU/action/citation_signature","submit_replication":"https://pith.science/pith/U3DYC4W3DSRQFFKZTOPITTZMZU/action/replication_record"}},"created_at":"2026-07-05T08:04:27.015950+00:00","updated_at":"2026-07-05T08:04:27.015950+00:00"}