{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EDEVZTQDF4D5VVHXS62WPAGA3R","short_pith_number":"pith:EDEVZTQD","schema_version":"1.0","canonical_sha256":"20c95cce032f07dad4f797b56780c0dc79a080befbe5e3ce47d59c0f5c8f6080","source":{"kind":"arxiv","id":"2405.01704","version":3},"attestation_state":"computed","paper":{"title":"Privacy-aware Berrut Approximated Coded Computing for Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC","cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Manuel Fern\\'andez Veiga, Rebeca P. D\\'iaz Redondo, Xavier Mart\\'inez Lua\\~na","submitted_at":"2024-05-02T20:03:13Z","abstract_excerpt":"Federated Learning (FL) is an interesting strategy that enables the collaborative training of an AI model among different data owners without revealing their private datasets. Even so, FL has some privacy vulnerabilities that have been tried to be overcome by applying some techniques like Differential Privacy (DP), Homomorphic Encryption (HE), or Secure Multi-Party Computation (SMPC). However, these techniques have some important drawbacks that might narrow their range of application: problems to work with non-linear functions and to operate large matrix multiplications and high communication "},"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":"2405.01704","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-02T20:03:13Z","cross_cats_sorted":["cs.CC","cs.DC","cs.IT","math.IT"],"title_canon_sha256":"b25784feb1ae039b5e84d48f28fc9167be0cdee2075884de53e2311bd60051d5","abstract_canon_sha256":"f099450a9ded3385132c8a30b1499b9fb9ae84793163cd0d1f49ae527c3bc3ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:02.970910Z","signature_b64":"Tr1fTy/ZYFphgBIOAhT62Vc5ExHa41hEl80rU/E74PJOE9EaXsF5lHlahTg8243Db/tV4oE+O1QsbtC+YcjsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20c95cce032f07dad4f797b56780c0dc79a080befbe5e3ce47d59c0f5c8f6080","last_reissued_at":"2026-07-05T11:20:02.970457Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:02.970457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Privacy-aware Berrut Approximated Coded Computing for Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC","cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Manuel Fern\\'andez Veiga, Rebeca P. D\\'iaz Redondo, Xavier Mart\\'inez Lua\\~na","submitted_at":"2024-05-02T20:03:13Z","abstract_excerpt":"Federated Learning (FL) is an interesting strategy that enables the collaborative training of an AI model among different data owners without revealing their private datasets. Even so, FL has some privacy vulnerabilities that have been tried to be overcome by applying some techniques like Differential Privacy (DP), Homomorphic Encryption (HE), or Secure Multi-Party Computation (SMPC). However, these techniques have some important drawbacks that might narrow their range of application: problems to work with non-linear functions and to operate large matrix multiplications and high communication "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.01704","kind":"arxiv","version":3},"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/2405.01704/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":"2405.01704","created_at":"2026-07-05T11:20:02.970514+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.01704v3","created_at":"2026-07-05T11:20:02.970514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.01704","created_at":"2026-07-05T11:20:02.970514+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDEVZTQDF4D5","created_at":"2026-07-05T11:20:02.970514+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDEVZTQDF4D5VVHX","created_at":"2026-07-05T11:20:02.970514+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDEVZTQD","created_at":"2026-07-05T11:20:02.970514+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.00371","citing_title":"Structured Codes for Distributed Matrix Multiplication","ref_index":101,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EDEVZTQDF4D5VVHXS62WPAGA3R","json":"https://pith.science/pith/EDEVZTQDF4D5VVHXS62WPAGA3R.json","graph_json":"https://pith.science/api/pith-number/EDEVZTQDF4D5VVHXS62WPAGA3R/graph.json","events_json":"https://pith.science/api/pith-number/EDEVZTQDF4D5VVHXS62WPAGA3R/events.json","paper":"https://pith.science/paper/EDEVZTQD"},"agent_actions":{"view_html":"https://pith.science/pith/EDEVZTQDF4D5VVHXS62WPAGA3R","download_json":"https://pith.science/pith/EDEVZTQDF4D5VVHXS62WPAGA3R.json","view_paper":"https://pith.science/paper/EDEVZTQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.01704&json=true","fetch_graph":"https://pith.science/api/pith-number/EDEVZTQDF4D5VVHXS62WPAGA3R/graph.json","fetch_events":"https://pith.science/api/pith-number/EDEVZTQDF4D5VVHXS62WPAGA3R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDEVZTQDF4D5VVHXS62WPAGA3R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDEVZTQDF4D5VVHXS62WPAGA3R/action/storage_attestation","attest_author":"https://pith.science/pith/EDEVZTQDF4D5VVHXS62WPAGA3R/action/author_attestation","sign_citation":"https://pith.science/pith/EDEVZTQDF4D5VVHXS62WPAGA3R/action/citation_signature","submit_replication":"https://pith.science/pith/EDEVZTQDF4D5VVHXS62WPAGA3R/action/replication_record"}},"created_at":"2026-07-05T11:20:02.970514+00:00","updated_at":"2026-07-05T11:20:02.970514+00:00"}