{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3LEDCM5O3KCHMXFG4J3KPW2HYV","short_pith_number":"pith:3LEDCM5O","canonical_record":{"source":{"id":"1905.13685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-31T15:47:58Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"a6ab773ba281372b15f33aa0c0ca9f3df309827752bb49ec58cd809f5e57b74b","abstract_canon_sha256":"c2c4e8b018eb585e89f1069fab1fa9b59d465d26610f42badf53b291e66a32e4"},"schema_version":"1.0"},"canonical_sha256":"dac83133aeda84765ca6e276a7db47c57e40f52644c3dbb40669d3eb2387a221","source":{"kind":"arxiv","id":"1905.13685","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13685","created_at":"2026-05-17T23:44:34Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13685v1","created_at":"2026-05-17T23:44:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13685","created_at":"2026-05-17T23:44:34Z"},{"alias_kind":"pith_short_12","alias_value":"3LEDCM5O3KCH","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3LEDCM5O3KCHMXFG","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3LEDCM5O","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3LEDCM5O3KCHMXFG4J3KPW2HYV","target":"record","payload":{"canonical_record":{"source":{"id":"1905.13685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-31T15:47:58Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"a6ab773ba281372b15f33aa0c0ca9f3df309827752bb49ec58cd809f5e57b74b","abstract_canon_sha256":"c2c4e8b018eb585e89f1069fab1fa9b59d465d26610f42badf53b291e66a32e4"},"schema_version":"1.0"},"canonical_sha256":"dac83133aeda84765ca6e276a7db47c57e40f52644c3dbb40669d3eb2387a221","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:34.228225Z","signature_b64":"b6PtSZ2FGVrVvaW9/oGfERVXiUG+O91ffotYW3GSjwgDJiQMCBxY1iTyCPane/65obek7/GsdQ8/eF2zuT+yCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dac83133aeda84765ca6e276a7db47c57e40f52644c3dbb40669d3eb2387a221","last_reissued_at":"2026-05-17T23:44:34.227514Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:34.227514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.13685","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2joO5AKBF6ezMiwJ2VcdavLVuH3JUoQozKuRK85pE7zLWtlTSYVshXee3bXWVIZ/+HKGbF2Cvwx4WcOC6K+eAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:45:06.897195Z"},"content_sha256":"bf19c15b4affd00bd5ae1d47f222b6a06d4b7116910a0394749b8d1365b7cb31","schema_version":"1.0","event_id":"sha256:bf19c15b4affd00bd5ae1d47f222b6a06d4b7116910a0394749b8d1365b7cb31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3LEDCM5O3KCHMXFG4J3KPW2HYV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Collaborative Decoding of Polynomial Codes for Distributed Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Adarsh M. Subramaniam, Anoosheh Heiderzadeh, Krishna R. Narayanan","submitted_at":"2019-05-31T15:47:58Z","abstract_excerpt":"We show that polynomial codes (and some related codes) used for distributed matrix multiplication are interleaved Reed-Solomon codes and, hence, can be collaboratively decoded. We consider a fault tolerant setup where $t$ worker nodes return erroneous values. For an additive random Gaussian error model, we show that for all $t < N-K$, errors can be corrected with probability 1. Further, numerical results show that in the presence of additive errors, when $L$ Reed-Solomon codes are collaboratively decoded, the numerical stability in recovering the error locator polynomial improves with increasi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13685","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASaSqVtMxr+/C0E0jDjr/Wd+CDD274JdjsK8phhH+mOsX+gOsUKgdJ4YChbuaj4Eih6nS2iAhJ6wubOSI4UdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:45:06.897547Z"},"content_sha256":"a050c4e2a7bfb747e74367b3e4edd7946f6055f7f9fdba38b87cbaccb0ad8899","schema_version":"1.0","event_id":"sha256:a050c4e2a7bfb747e74367b3e4edd7946f6055f7f9fdba38b87cbaccb0ad8899"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LEDCM5O3KCHMXFG4J3KPW2HYV/bundle.json","state_url":"https://pith.science/pith/3LEDCM5O3KCHMXFG4J3KPW2HYV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LEDCM5O3KCHMXFG4J3KPW2HYV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T14:45:06Z","links":{"resolver":"https://pith.science/pith/3LEDCM5O3KCHMXFG4J3KPW2HYV","bundle":"https://pith.science/pith/3LEDCM5O3KCHMXFG4J3KPW2HYV/bundle.json","state":"https://pith.science/pith/3LEDCM5O3KCHMXFG4J3KPW2HYV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LEDCM5O3KCHMXFG4J3KPW2HYV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3LEDCM5O3KCHMXFG4J3KPW2HYV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c2c4e8b018eb585e89f1069fab1fa9b59d465d26610f42badf53b291e66a32e4","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-31T15:47:58Z","title_canon_sha256":"a6ab773ba281372b15f33aa0c0ca9f3df309827752bb49ec58cd809f5e57b74b"},"schema_version":"1.0","source":{"id":"1905.13685","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13685","created_at":"2026-05-17T23:44:34Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13685v1","created_at":"2026-05-17T23:44:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13685","created_at":"2026-05-17T23:44:34Z"},{"alias_kind":"pith_short_12","alias_value":"3LEDCM5O3KCH","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3LEDCM5O3KCHMXFG","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3LEDCM5O","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:a050c4e2a7bfb747e74367b3e4edd7946f6055f7f9fdba38b87cbaccb0ad8899","target":"graph","created_at":"2026-05-17T23:44:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We show that polynomial codes (and some related codes) used for distributed matrix multiplication are interleaved Reed-Solomon codes and, hence, can be collaboratively decoded. We consider a fault tolerant setup where $t$ worker nodes return erroneous values. For an additive random Gaussian error model, we show that for all $t < N-K$, errors can be corrected with probability 1. Further, numerical results show that in the presence of additive errors, when $L$ Reed-Solomon codes are collaboratively decoded, the numerical stability in recovering the error locator polynomial improves with increasi","authors_text":"Adarsh M. Subramaniam, Anoosheh Heiderzadeh, Krishna R. Narayanan","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-31T15:47:58Z","title":"Collaborative Decoding of Polynomial Codes for Distributed Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13685","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bf19c15b4affd00bd5ae1d47f222b6a06d4b7116910a0394749b8d1365b7cb31","target":"record","created_at":"2026-05-17T23:44:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c2c4e8b018eb585e89f1069fab1fa9b59d465d26610f42badf53b291e66a32e4","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-31T15:47:58Z","title_canon_sha256":"a6ab773ba281372b15f33aa0c0ca9f3df309827752bb49ec58cd809f5e57b74b"},"schema_version":"1.0","source":{"id":"1905.13685","kind":"arxiv","version":1}},"canonical_sha256":"dac83133aeda84765ca6e276a7db47c57e40f52644c3dbb40669d3eb2387a221","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dac83133aeda84765ca6e276a7db47c57e40f52644c3dbb40669d3eb2387a221","first_computed_at":"2026-05-17T23:44:34.227514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:34.227514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b6PtSZ2FGVrVvaW9/oGfERVXiUG+O91ffotYW3GSjwgDJiQMCBxY1iTyCPane/65obek7/GsdQ8/eF2zuT+yCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:34.228225Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.13685","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf19c15b4affd00bd5ae1d47f222b6a06d4b7116910a0394749b8d1365b7cb31","sha256:a050c4e2a7bfb747e74367b3e4edd7946f6055f7f9fdba38b87cbaccb0ad8899"],"state_sha256":"cf00c3534646f0a45b4f308d1f7e9c6f0ad110eb73ffd51648e9d314c558ef09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jDVl78aA5kkHoH4I8gwEsoWoQ5WLlVNvpG7NS7GsQIUDE/BLfZVystZedlCPzAGC9X8X6rQ3ZQOW8ZAV4WPlCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T14:45:06.899476Z","bundle_sha256":"d462a0baebbe6b65f03c914bd4c8efb7b5cb933904d5d4d6bd1323dfadd9f433"}}