{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5KSMF7CYI2UM22AJ6MEN7CRK7J","short_pith_number":"pith:5KSMF7CY","canonical_record":{"source":{"id":"1508.03599","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-14T18:37:10Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ee258b2642ccff293c6eab474a2bf86394444976da563eb8ae5411a64b723737","abstract_canon_sha256":"45c16fd35c700dc56aa016361c0cffe6e86d8dddd9df61f8de46a122575578ce"},"schema_version":"1.0"},"canonical_sha256":"eaa4c2fc5846a8cd6809f308df8a2afa771237766f4696419912d6cbd8007db4","source":{"kind":"arxiv","id":"1508.03599","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03599","created_at":"2026-05-18T00:46:32Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03599v3","created_at":"2026-05-18T00:46:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03599","created_at":"2026-05-18T00:46:32Z"},{"alias_kind":"pith_short_12","alias_value":"5KSMF7CYI2UM","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5KSMF7CYI2UM22AJ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5KSMF7CY","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5KSMF7CYI2UM22AJ6MEN7CRK7J","target":"record","payload":{"canonical_record":{"source":{"id":"1508.03599","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-14T18:37:10Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ee258b2642ccff293c6eab474a2bf86394444976da563eb8ae5411a64b723737","abstract_canon_sha256":"45c16fd35c700dc56aa016361c0cffe6e86d8dddd9df61f8de46a122575578ce"},"schema_version":"1.0"},"canonical_sha256":"eaa4c2fc5846a8cd6809f308df8a2afa771237766f4696419912d6cbd8007db4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:32.173359Z","signature_b64":"Ju/KUB7UtuMUguT0H99dXlB+gH2s+G43Yyv+vZvDVTTqj4DssPONucnL6GnVbbXUK+iGKwhAQoY6JG38CNkMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eaa4c2fc5846a8cd6809f308df8a2afa771237766f4696419912d6cbd8007db4","last_reissued_at":"2026-05-18T00:46:32.172696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:32.172696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.03599","source_version":3,"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:46:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V2lbDHHMbeVfrM5GNplmm40Dwh9JS5v2l8pPpWMf6mIwkV/CdTAqkZonRgYbgDmW+NvuVqcwVQOR3vCEo5IVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:59:35.458537Z"},"content_sha256":"0ddc570ff207e57e232fd8b70fa7e2b8889e3fc62c95e1454245f2bbd021ece0","schema_version":"1.0","event_id":"sha256:0ddc570ff207e57e232fd8b70fa7e2b8889e3fc62c95e1454245f2bbd021ece0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5KSMF7CYI2UM22AJ6MEN7CRK7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Redundancy Techniques for Latency Reduction in Cloud Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Emina Soljanin, Gauri Joshi, Gregory Wornell","submitted_at":"2015-08-14T18:37:10Z","abstract_excerpt":"In cloud computing systems, assigning a task to multiple servers and waiting for the earliest copy to finish is an effective method to combat the variability in response time of individual servers, and reduce latency. But adding redundancy may result in higher cost of computing resources, as well as an increase in queueing delay due to higher traffic load. This work helps understand when and how redundancy gives a cost-efficient reduction in latency. For a general task service time distribution, we compare different redundancy strategies in terms of the number of redundant tasks, and time when"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03599","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":""},"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:46:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X3eyzNmj+WGzSZEmSxy/rs7DSN1838volx1q6+ARfaUCxLGX/O/g2t0Cy3NA5GaUfqiMLF6+JJXHtzX0Qh6jAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:59:35.458909Z"},"content_sha256":"43fd161e8491a354fbd802506277d4a3b41ab7f9b4d05b2dc57d32af7a114dca","schema_version":"1.0","event_id":"sha256:43fd161e8491a354fbd802506277d4a3b41ab7f9b4d05b2dc57d32af7a114dca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5KSMF7CYI2UM22AJ6MEN7CRK7J/bundle.json","state_url":"https://pith.science/pith/5KSMF7CYI2UM22AJ6MEN7CRK7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5KSMF7CYI2UM22AJ6MEN7CRK7J/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-26T02:59:35Z","links":{"resolver":"https://pith.science/pith/5KSMF7CYI2UM22AJ6MEN7CRK7J","bundle":"https://pith.science/pith/5KSMF7CYI2UM22AJ6MEN7CRK7J/bundle.json","state":"https://pith.science/pith/5KSMF7CYI2UM22AJ6MEN7CRK7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5KSMF7CYI2UM22AJ6MEN7CRK7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5KSMF7CYI2UM22AJ6MEN7CRK7J","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":"45c16fd35c700dc56aa016361c0cffe6e86d8dddd9df61f8de46a122575578ce","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-14T18:37:10Z","title_canon_sha256":"ee258b2642ccff293c6eab474a2bf86394444976da563eb8ae5411a64b723737"},"schema_version":"1.0","source":{"id":"1508.03599","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03599","created_at":"2026-05-18T00:46:32Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03599v3","created_at":"2026-05-18T00:46:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03599","created_at":"2026-05-18T00:46:32Z"},{"alias_kind":"pith_short_12","alias_value":"5KSMF7CYI2UM","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5KSMF7CYI2UM22AJ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5KSMF7CY","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:43fd161e8491a354fbd802506277d4a3b41ab7f9b4d05b2dc57d32af7a114dca","target":"graph","created_at":"2026-05-18T00:46:32Z","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":"In cloud computing systems, assigning a task to multiple servers and waiting for the earliest copy to finish is an effective method to combat the variability in response time of individual servers, and reduce latency. But adding redundancy may result in higher cost of computing resources, as well as an increase in queueing delay due to higher traffic load. This work helps understand when and how redundancy gives a cost-efficient reduction in latency. For a general task service time distribution, we compare different redundancy strategies in terms of the number of redundant tasks, and time when","authors_text":"Emina Soljanin, Gauri Joshi, Gregory Wornell","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-14T18:37:10Z","title":"Efficient Redundancy Techniques for Latency Reduction in Cloud Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03599","kind":"arxiv","version":3},"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:0ddc570ff207e57e232fd8b70fa7e2b8889e3fc62c95e1454245f2bbd021ece0","target":"record","created_at":"2026-05-18T00:46:32Z","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":"45c16fd35c700dc56aa016361c0cffe6e86d8dddd9df61f8de46a122575578ce","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-14T18:37:10Z","title_canon_sha256":"ee258b2642ccff293c6eab474a2bf86394444976da563eb8ae5411a64b723737"},"schema_version":"1.0","source":{"id":"1508.03599","kind":"arxiv","version":3}},"canonical_sha256":"eaa4c2fc5846a8cd6809f308df8a2afa771237766f4696419912d6cbd8007db4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eaa4c2fc5846a8cd6809f308df8a2afa771237766f4696419912d6cbd8007db4","first_computed_at":"2026-05-18T00:46:32.172696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:32.172696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ju/KUB7UtuMUguT0H99dXlB+gH2s+G43Yyv+vZvDVTTqj4DssPONucnL6GnVbbXUK+iGKwhAQoY6JG38CNkMCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:32.173359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03599","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ddc570ff207e57e232fd8b70fa7e2b8889e3fc62c95e1454245f2bbd021ece0","sha256:43fd161e8491a354fbd802506277d4a3b41ab7f9b4d05b2dc57d32af7a114dca"],"state_sha256":"cfe933b435daea7a74fff2cd1ac32fd88f0ce86af5dd70ff375a9755f01172e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HNQFDXPg3v8b13JM/rkv2DTVApIycQh8aQcy3QBGCgzpRZ+xlNVvrxxDaU7qM6cE8FJLgNCuHSwQXGhhOc29Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:59:35.462223Z","bundle_sha256":"a951164150fc4be520552c89c0458e481ce78379f85e1bc6e597775215d96e99"}}