{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EFOFF7S5ZL26BOKDT7KEPPZQJH","short_pith_number":"pith:EFOFF7S5","canonical_record":{"source":{"id":"1404.1328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-04T18:05:45Z","cross_cats_sorted":[],"title_canon_sha256":"b432610f6de8d981a0b6145d57a905037101bc7cc64912e3f68b3085d64a79f5","abstract_canon_sha256":"5f55b0c92d9adb3cba8f9080c32033a8046b846c0d6ba121aada13a6c9b3988e"},"schema_version":"1.0"},"canonical_sha256":"215c52fe5dcaf5e0b9439fd447bf3049f958ecf5ca4494fea2c7784f78e475ec","source":{"kind":"arxiv","id":"1404.1328","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1328","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1328v1","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1328","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"EFOFF7S5ZL26","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EFOFF7S5ZL26BOKD","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EFOFF7S5","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EFOFF7S5ZL26BOKDT7KEPPZQJH","target":"record","payload":{"canonical_record":{"source":{"id":"1404.1328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-04T18:05:45Z","cross_cats_sorted":[],"title_canon_sha256":"b432610f6de8d981a0b6145d57a905037101bc7cc64912e3f68b3085d64a79f5","abstract_canon_sha256":"5f55b0c92d9adb3cba8f9080c32033a8046b846c0d6ba121aada13a6c9b3988e"},"schema_version":"1.0"},"canonical_sha256":"215c52fe5dcaf5e0b9439fd447bf3049f958ecf5ca4494fea2c7784f78e475ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:47.746172Z","signature_b64":"e5ht/G6oc9Qm7jgQKO6niKfvN/o+lFa9cW3eKyZ/bacsUyu/uEBq3Ck3Rd6Xd3vGSAeAxjwjR7XSJ9J98miPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"215c52fe5dcaf5e0b9439fd447bf3049f958ecf5ca4494fea2c7784f78e475ec","last_reissued_at":"2026-05-18T02:54:47.745784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:47.745784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.1328","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-18T02:54:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p+wbggA1ltwGnYhWhKuVFB3UAPBjyzqT+uYDQokGSsZi6H7+ItkqeXW5DG+qIRlP31+Y8Q17sZcHUxH97CTPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:26:26.492333Z"},"content_sha256":"3886415224d77d09e3d3d36179a2d695d67968dea43b1ecd37a73890aa59dca6","schema_version":"1.0","event_id":"sha256:3886415224d77d09e3d3d36179a2d695d67968dea43b1ecd37a73890aa59dca6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EFOFF7S5ZL26BOKDT7KEPPZQJH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Task Replication for Fast Response Times in Parallel Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Da Wang, Gauri Joshi, Gregory Wornell","submitted_at":"2014-04-04T18:05:45Z","abstract_excerpt":"One typical use case of large-scale distributed computing in data centers is to decompose a computation job into many independent tasks and run them in parallel on different machines, sometimes known as the \"embarrassingly parallel\" computation. For this type of computation, one challenge is that the time to execute a task for each machine is inherently variable, and the overall response time is constrained by the execution time of the slowest machine. To address this issue, system designers introduce task replication, which sends the same task to multiple machines, and obtains result from the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1328","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-18T02:54:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DsNsLNhqTaQ7gAz8Z//UiDNc2Nktbksi5kr4Lvh/vrq0HjeJWJ05aPqg4skWAQJLjKvMsDNmuJKZ+DXSzF0dBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:26:26.492948Z"},"content_sha256":"106cf9a461b436da6e7a831c9c77fe1117c08c3a095c94a6370b473e4c7965c5","schema_version":"1.0","event_id":"sha256:106cf9a461b436da6e7a831c9c77fe1117c08c3a095c94a6370b473e4c7965c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFOFF7S5ZL26BOKDT7KEPPZQJH/bundle.json","state_url":"https://pith.science/pith/EFOFF7S5ZL26BOKDT7KEPPZQJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFOFF7S5ZL26BOKDT7KEPPZQJH/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-25T18:26:26Z","links":{"resolver":"https://pith.science/pith/EFOFF7S5ZL26BOKDT7KEPPZQJH","bundle":"https://pith.science/pith/EFOFF7S5ZL26BOKDT7KEPPZQJH/bundle.json","state":"https://pith.science/pith/EFOFF7S5ZL26BOKDT7KEPPZQJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFOFF7S5ZL26BOKDT7KEPPZQJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EFOFF7S5ZL26BOKDT7KEPPZQJH","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":"5f55b0c92d9adb3cba8f9080c32033a8046b846c0d6ba121aada13a6c9b3988e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-04T18:05:45Z","title_canon_sha256":"b432610f6de8d981a0b6145d57a905037101bc7cc64912e3f68b3085d64a79f5"},"schema_version":"1.0","source":{"id":"1404.1328","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1328","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1328v1","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1328","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"EFOFF7S5ZL26","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EFOFF7S5ZL26BOKD","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EFOFF7S5","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:106cf9a461b436da6e7a831c9c77fe1117c08c3a095c94a6370b473e4c7965c5","target":"graph","created_at":"2026-05-18T02:54:47Z","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":"One typical use case of large-scale distributed computing in data centers is to decompose a computation job into many independent tasks and run them in parallel on different machines, sometimes known as the \"embarrassingly parallel\" computation. For this type of computation, one challenge is that the time to execute a task for each machine is inherently variable, and the overall response time is constrained by the execution time of the slowest machine. To address this issue, system designers introduce task replication, which sends the same task to multiple machines, and obtains result from the","authors_text":"Da Wang, Gauri Joshi, Gregory Wornell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-04T18:05:45Z","title":"Efficient Task Replication for Fast Response Times in Parallel Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1328","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:3886415224d77d09e3d3d36179a2d695d67968dea43b1ecd37a73890aa59dca6","target":"record","created_at":"2026-05-18T02:54:47Z","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":"5f55b0c92d9adb3cba8f9080c32033a8046b846c0d6ba121aada13a6c9b3988e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-04T18:05:45Z","title_canon_sha256":"b432610f6de8d981a0b6145d57a905037101bc7cc64912e3f68b3085d64a79f5"},"schema_version":"1.0","source":{"id":"1404.1328","kind":"arxiv","version":1}},"canonical_sha256":"215c52fe5dcaf5e0b9439fd447bf3049f958ecf5ca4494fea2c7784f78e475ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"215c52fe5dcaf5e0b9439fd447bf3049f958ecf5ca4494fea2c7784f78e475ec","first_computed_at":"2026-05-18T02:54:47.745784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:47.745784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e5ht/G6oc9Qm7jgQKO6niKfvN/o+lFa9cW3eKyZ/bacsUyu/uEBq3Ck3Rd6Xd3vGSAeAxjwjR7XSJ9J98miPDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:47.746172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1328","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3886415224d77d09e3d3d36179a2d695d67968dea43b1ecd37a73890aa59dca6","sha256:106cf9a461b436da6e7a831c9c77fe1117c08c3a095c94a6370b473e4c7965c5"],"state_sha256":"fd4b73c1c9d4ebae1be24686ba8c46cb5f8c100b496d88a9f7e49dacd4ebda46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MzIP6pFNcI8PD8im2rUqiVO86BvK3d4F8ovjwNYJ5e3ejeAH1AXCY+Gt38saAM4fZ8HXoMRz/8j+asjhz2OjAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:26:26.496826Z","bundle_sha256":"23b83a718ea0ef720f7ccb39abd2ba7fa08d960a70c7371d6e814a220c799567"}}