{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FPAZY7JQU3VVD6PQGHAY4GDBO5","short_pith_number":"pith:FPAZY7JQ","canonical_record":{"source":{"id":"1705.03875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-10T17:58:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"47cecef84922e6d9beceb3162b7ea24e1a9a7f78d9d65a8df28ce5a41b0e23c9","abstract_canon_sha256":"b301e40f7c1c2e85d45d98a2fbb0e829d0b019311ed642a28578adb62ff9769a"},"schema_version":"1.0"},"canonical_sha256":"2bc19c7d30a6eb51f9f031c18e18617760fa5eea9c7088afb9a8f886f5f66df4","source":{"kind":"arxiv","id":"1705.03875","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03875","created_at":"2026-05-18T00:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03875v1","created_at":"2026-05-18T00:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03875","created_at":"2026-05-18T00:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"FPAZY7JQU3VV","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FPAZY7JQU3VVD6PQ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FPAZY7JQ","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FPAZY7JQU3VVD6PQGHAY4GDBO5","target":"record","payload":{"canonical_record":{"source":{"id":"1705.03875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-10T17:58:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"47cecef84922e6d9beceb3162b7ea24e1a9a7f78d9d65a8df28ce5a41b0e23c9","abstract_canon_sha256":"b301e40f7c1c2e85d45d98a2fbb0e829d0b019311ed642a28578adb62ff9769a"},"schema_version":"1.0"},"canonical_sha256":"2bc19c7d30a6eb51f9f031c18e18617760fa5eea9c7088afb9a8f886f5f66df4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:42.868470Z","signature_b64":"lOOyyVkYgfdE8dPxHlnHpFQvr4KZu+jfOxP271ip9kGQ17xZLBPCLl3Dgh0YAcxDVE9OnJHnSKrUHLNzZqmhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bc19c7d30a6eb51f9f031c18e18617760fa5eea9c7088afb9a8f886f5f66df4","last_reissued_at":"2026-05-18T00:44:42.867964Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:42.867964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.03875","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-18T00:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rf5qluN53mDSOqiUwn4bzMD3OdXCY1m55ohhLwVs7FAbcjdbkMj41XALRax2bIqZYMwThDhr5P9kYi0UtWPJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:26:59.709907Z"},"content_sha256":"dd4a5a5077152345294be2775d0f7c008713c6a4e2eac1223c2a03480bdf339d","schema_version":"1.0","event_id":"sha256:dd4a5a5077152345294be2775d0f7c008713c6a4e2eac1223c2a03480bdf339d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FPAZY7JQU3VVD6PQGHAY4GDBO5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coded convolution for parallel and distributed computing within a deadline","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Pulkit Grover, Sanghamitra Dutta, Viveck Cadambe","submitted_at":"2017-05-10T17:58:14Z","abstract_excerpt":"We consider the problem of computing the convolution of two long vectors using parallel processing units in the presence of \"stragglers\". Stragglers refer to the small fraction of faulty or slow processors that delays the entire computation in time-critical distributed systems. We first show that splitting the vectors into smaller pieces and using a linear code to encode these pieces provides better resilience against stragglers than replication-based schemes under a simple, worst-case straggler analysis. We then demonstrate that under commonly used models of computation time, coding can drama"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03875","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-18T00:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5PNerArwa6shy4dqX9iX28+KVe2Z61hQpgkq8qzdelmZlPiqLOANNj5r9Ky/aQ4bfib1QR2Vkzw3wJomj1zKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:26:59.710593Z"},"content_sha256":"ab1225e5cefa751b371920bcca20f246c5c2b851a362ee0376e9eda784c6c8c2","schema_version":"1.0","event_id":"sha256:ab1225e5cefa751b371920bcca20f246c5c2b851a362ee0376e9eda784c6c8c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FPAZY7JQU3VVD6PQGHAY4GDBO5/bundle.json","state_url":"https://pith.science/pith/FPAZY7JQU3VVD6PQGHAY4GDBO5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FPAZY7JQU3VVD6PQGHAY4GDBO5/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-05-26T01:26:59Z","links":{"resolver":"https://pith.science/pith/FPAZY7JQU3VVD6PQGHAY4GDBO5","bundle":"https://pith.science/pith/FPAZY7JQU3VVD6PQGHAY4GDBO5/bundle.json","state":"https://pith.science/pith/FPAZY7JQU3VVD6PQGHAY4GDBO5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FPAZY7JQU3VVD6PQGHAY4GDBO5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FPAZY7JQU3VVD6PQGHAY4GDBO5","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":"b301e40f7c1c2e85d45d98a2fbb0e829d0b019311ed642a28578adb62ff9769a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-10T17:58:14Z","title_canon_sha256":"47cecef84922e6d9beceb3162b7ea24e1a9a7f78d9d65a8df28ce5a41b0e23c9"},"schema_version":"1.0","source":{"id":"1705.03875","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03875","created_at":"2026-05-18T00:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03875v1","created_at":"2026-05-18T00:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03875","created_at":"2026-05-18T00:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"FPAZY7JQU3VV","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FPAZY7JQU3VVD6PQ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FPAZY7JQ","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:ab1225e5cefa751b371920bcca20f246c5c2b851a362ee0376e9eda784c6c8c2","target":"graph","created_at":"2026-05-18T00:44:42Z","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 consider the problem of computing the convolution of two long vectors using parallel processing units in the presence of \"stragglers\". Stragglers refer to the small fraction of faulty or slow processors that delays the entire computation in time-critical distributed systems. We first show that splitting the vectors into smaller pieces and using a linear code to encode these pieces provides better resilience against stragglers than replication-based schemes under a simple, worst-case straggler analysis. We then demonstrate that under commonly used models of computation time, coding can drama","authors_text":"Pulkit Grover, Sanghamitra Dutta, Viveck Cadambe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-10T17:58:14Z","title":"Coded convolution for parallel and distributed computing within a deadline"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03875","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:dd4a5a5077152345294be2775d0f7c008713c6a4e2eac1223c2a03480bdf339d","target":"record","created_at":"2026-05-18T00:44:42Z","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":"b301e40f7c1c2e85d45d98a2fbb0e829d0b019311ed642a28578adb62ff9769a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-10T17:58:14Z","title_canon_sha256":"47cecef84922e6d9beceb3162b7ea24e1a9a7f78d9d65a8df28ce5a41b0e23c9"},"schema_version":"1.0","source":{"id":"1705.03875","kind":"arxiv","version":1}},"canonical_sha256":"2bc19c7d30a6eb51f9f031c18e18617760fa5eea9c7088afb9a8f886f5f66df4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bc19c7d30a6eb51f9f031c18e18617760fa5eea9c7088afb9a8f886f5f66df4","first_computed_at":"2026-05-18T00:44:42.867964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:42.867964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lOOyyVkYgfdE8dPxHlnHpFQvr4KZu+jfOxP271ip9kGQ17xZLBPCLl3Dgh0YAcxDVE9OnJHnSKrUHLNzZqmhAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:42.868470Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03875","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd4a5a5077152345294be2775d0f7c008713c6a4e2eac1223c2a03480bdf339d","sha256:ab1225e5cefa751b371920bcca20f246c5c2b851a362ee0376e9eda784c6c8c2"],"state_sha256":"71e28becf7943796bd23643be9c5ad3184a3bd4a69db4a2d646d267f30e66c70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5gQ9SfSyZgfko1XRXNeohvxb3epyFxa55AHLqJB0ZJx8eFg+3qYj4KWc66nuHZOwtVIqE0/siSTTNTmoEm/RDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:26:59.714113Z","bundle_sha256":"2c51e664f8149115dd1dee1d91ff1b02c5530e03b3315f7d67af8a32abc50ed3"}}