{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HAF5BSRU6LZKTDFPF46GCMS4MX","short_pith_number":"pith:HAF5BSRU","schema_version":"1.0","canonical_sha256":"380bd0ca34f2f2a98caf2f3c61325c65f8210ea76b2221c1423618a93bc441b6","source":{"kind":"arxiv","id":"1805.01993","version":1},"attestation_state":"computed","paper":{"title":"Compressed Coded Distributed Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"A. Salman Avestimehr, Mohammad Ali Maddah-Ali, Songze Li","submitted_at":"2018-05-05T03:38:28Z","abstract_excerpt":"Communication overhead is one of the major performance bottlenecks in large-scale distributed computing systems, in particular for machine learning applications. Conventionally, compression techniques are used to reduce the load of communication by combining intermediate results of the same computation task as much as possible. Recently, via the development of coded distributed computing (CDC), it has been shown that it is possible to enable coding opportunities across intermediate results of different computation tasks to further reduce the communication load. We propose a new scheme, named c"},"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":"1805.01993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-05T03:38:28Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"cd680e8d69c1c41e0898007f69869e510ed26b5cd056472c246deef7c267aafc","abstract_canon_sha256":"6d4efa038bf84390ad8c884c4db2977bd79f407dc05c185750c4c3844b12b599"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:41.319511Z","signature_b64":"wT+mkxDrWZoTi2sBy9FgKf2JYSxeoiesuc3zSpCHUZwdInYQUvcjWns22ntE8PDS+MkQMV9ni0cXTNBtOUTuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"380bd0ca34f2f2a98caf2f3c61325c65f8210ea76b2221c1423618a93bc441b6","last_reissued_at":"2026-05-18T00:16:41.318816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:41.318816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed Coded Distributed Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"A. Salman Avestimehr, Mohammad Ali Maddah-Ali, Songze Li","submitted_at":"2018-05-05T03:38:28Z","abstract_excerpt":"Communication overhead is one of the major performance bottlenecks in large-scale distributed computing systems, in particular for machine learning applications. Conventionally, compression techniques are used to reduce the load of communication by combining intermediate results of the same computation task as much as possible. Recently, via the development of coded distributed computing (CDC), it has been shown that it is possible to enable coding opportunities across intermediate results of different computation tasks to further reduce the communication load. We propose a new scheme, named c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01993","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":""},"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":"1805.01993","created_at":"2026-05-18T00:16:41.318929+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.01993v1","created_at":"2026-05-18T00:16:41.318929+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01993","created_at":"2026-05-18T00:16:41.318929+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAF5BSRU6LZK","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAF5BSRU6LZKTDFP","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAF5BSRU","created_at":"2026-05-18T12:32:28.185984+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/HAF5BSRU6LZKTDFPF46GCMS4MX","json":"https://pith.science/pith/HAF5BSRU6LZKTDFPF46GCMS4MX.json","graph_json":"https://pith.science/api/pith-number/HAF5BSRU6LZKTDFPF46GCMS4MX/graph.json","events_json":"https://pith.science/api/pith-number/HAF5BSRU6LZKTDFPF46GCMS4MX/events.json","paper":"https://pith.science/paper/HAF5BSRU"},"agent_actions":{"view_html":"https://pith.science/pith/HAF5BSRU6LZKTDFPF46GCMS4MX","download_json":"https://pith.science/pith/HAF5BSRU6LZKTDFPF46GCMS4MX.json","view_paper":"https://pith.science/paper/HAF5BSRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.01993&json=true","fetch_graph":"https://pith.science/api/pith-number/HAF5BSRU6LZKTDFPF46GCMS4MX/graph.json","fetch_events":"https://pith.science/api/pith-number/HAF5BSRU6LZKTDFPF46GCMS4MX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAF5BSRU6LZKTDFPF46GCMS4MX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAF5BSRU6LZKTDFPF46GCMS4MX/action/storage_attestation","attest_author":"https://pith.science/pith/HAF5BSRU6LZKTDFPF46GCMS4MX/action/author_attestation","sign_citation":"https://pith.science/pith/HAF5BSRU6LZKTDFPF46GCMS4MX/action/citation_signature","submit_replication":"https://pith.science/pith/HAF5BSRU6LZKTDFPF46GCMS4MX/action/replication_record"}},"created_at":"2026-05-18T00:16:41.318929+00:00","updated_at":"2026-05-18T00:16:41.318929+00:00"}