{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GFFBTEHTPLJYTUJO7EEDXU4CXR","short_pith_number":"pith:GFFBTEHT","canonical_record":{"source":{"id":"1306.3707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-06-16T21:19:48Z","cross_cats_sorted":[],"title_canon_sha256":"2ee090ae23b65f4aa7409e1c92cdcddfd9529d61cc5039b35f9096f108477480","abstract_canon_sha256":"f20368d542c3f6fd6fe8bf36d7d3a2ae374287c5ed3ee48874314ef913fba77a"},"schema_version":"1.0"},"canonical_sha256":"314a1990f37ad389d12ef9083bd382bc66dc21367ab8769da0d1409d721338be","source":{"kind":"arxiv","id":"1306.3707","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3707","created_at":"2026-05-18T03:20:46Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3707v1","created_at":"2026-05-18T03:20:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3707","created_at":"2026-05-18T03:20:46Z"},{"alias_kind":"pith_short_12","alias_value":"GFFBTEHTPLJY","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GFFBTEHTPLJYTUJO","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GFFBTEHT","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GFFBTEHTPLJYTUJO7EEDXU4CXR","target":"record","payload":{"canonical_record":{"source":{"id":"1306.3707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-06-16T21:19:48Z","cross_cats_sorted":[],"title_canon_sha256":"2ee090ae23b65f4aa7409e1c92cdcddfd9529d61cc5039b35f9096f108477480","abstract_canon_sha256":"f20368d542c3f6fd6fe8bf36d7d3a2ae374287c5ed3ee48874314ef913fba77a"},"schema_version":"1.0"},"canonical_sha256":"314a1990f37ad389d12ef9083bd382bc66dc21367ab8769da0d1409d721338be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:46.678129Z","signature_b64":"OBU5RbZ9zrwovMnHiauT/8iWXeElPfHe84XK6df3We+/NOLZA3UWeRwAu7jVHNest1tL+77hKI2wQrE7jQsEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"314a1990f37ad389d12ef9083bd382bc66dc21367ab8769da0d1409d721338be","last_reissued_at":"2026-05-18T03:20:46.677296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:46.677296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.3707","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-18T03:20:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AgvDC4TLC/czCCyJbDt6CmMRw0srC1EqcsD67b1pdoc8DV8rYIx7DDKuSVRzOwJTDErhdQ9/Xf17QNB5v4MuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:43:07.265200Z"},"content_sha256":"ecb802731adf266b003e6cf6bbe9f59654ab5e709fe4aaef6d57cf9d4e7c3a56","schema_version":"1.0","event_id":"sha256:ecb802731adf266b003e6cf6bbe9f59654ab5e709fe4aaef6d57cf9d4e7c3a56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GFFBTEHTPLJYTUJO7EEDXU4CXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low latency via redundancy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ashish Vulimiri, Justine Sherry, P. Brighten Godfrey, Radhika Mittal, Scott Shenker, Sylvia Ratnasamy","submitted_at":"2013-06-16T21:19:48Z","abstract_excerpt":"Low latency is critical for interactive networked applications. But while we know how to scale systems to increase capacity, reducing latency --- especially the tail of the latency distribution --- can be much more difficult. In this paper, we argue that the use of redundancy is an effective way to convert extra capacity into reduced latency. By initiating redundant operations across diverse resources and using the first result which completes, redundancy improves a system's latency even under exceptional conditions. We study the tradeoff with added system utilization, characterizing the situa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3707","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-18T03:20:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qA6EHXSSbbDl+UO6kksZjzWoR4i5TIG/4o62B2aLPDYpVyMX/rTmtWtwmmgtW7JPS0IoCYC5cE9tiaqcaq/xCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:43:07.265844Z"},"content_sha256":"a6679507e4018ad430929ac527c9df1c81aa0b1d006b07eecf81f6e484fae757","schema_version":"1.0","event_id":"sha256:a6679507e4018ad430929ac527c9df1c81aa0b1d006b07eecf81f6e484fae757"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GFFBTEHTPLJYTUJO7EEDXU4CXR/bundle.json","state_url":"https://pith.science/pith/GFFBTEHTPLJYTUJO7EEDXU4CXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GFFBTEHTPLJYTUJO7EEDXU4CXR/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-29T14:43:07Z","links":{"resolver":"https://pith.science/pith/GFFBTEHTPLJYTUJO7EEDXU4CXR","bundle":"https://pith.science/pith/GFFBTEHTPLJYTUJO7EEDXU4CXR/bundle.json","state":"https://pith.science/pith/GFFBTEHTPLJYTUJO7EEDXU4CXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GFFBTEHTPLJYTUJO7EEDXU4CXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GFFBTEHTPLJYTUJO7EEDXU4CXR","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":"f20368d542c3f6fd6fe8bf36d7d3a2ae374287c5ed3ee48874314ef913fba77a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-06-16T21:19:48Z","title_canon_sha256":"2ee090ae23b65f4aa7409e1c92cdcddfd9529d61cc5039b35f9096f108477480"},"schema_version":"1.0","source":{"id":"1306.3707","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3707","created_at":"2026-05-18T03:20:46Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3707v1","created_at":"2026-05-18T03:20:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3707","created_at":"2026-05-18T03:20:46Z"},{"alias_kind":"pith_short_12","alias_value":"GFFBTEHTPLJY","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GFFBTEHTPLJYTUJO","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GFFBTEHT","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:a6679507e4018ad430929ac527c9df1c81aa0b1d006b07eecf81f6e484fae757","target":"graph","created_at":"2026-05-18T03:20:46Z","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":"Low latency is critical for interactive networked applications. But while we know how to scale systems to increase capacity, reducing latency --- especially the tail of the latency distribution --- can be much more difficult. In this paper, we argue that the use of redundancy is an effective way to convert extra capacity into reduced latency. By initiating redundant operations across diverse resources and using the first result which completes, redundancy improves a system's latency even under exceptional conditions. We study the tradeoff with added system utilization, characterizing the situa","authors_text":"Ashish Vulimiri, Justine Sherry, P. Brighten Godfrey, Radhika Mittal, Scott Shenker, Sylvia Ratnasamy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-06-16T21:19:48Z","title":"Low latency via redundancy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3707","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:ecb802731adf266b003e6cf6bbe9f59654ab5e709fe4aaef6d57cf9d4e7c3a56","target":"record","created_at":"2026-05-18T03:20:46Z","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":"f20368d542c3f6fd6fe8bf36d7d3a2ae374287c5ed3ee48874314ef913fba77a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-06-16T21:19:48Z","title_canon_sha256":"2ee090ae23b65f4aa7409e1c92cdcddfd9529d61cc5039b35f9096f108477480"},"schema_version":"1.0","source":{"id":"1306.3707","kind":"arxiv","version":1}},"canonical_sha256":"314a1990f37ad389d12ef9083bd382bc66dc21367ab8769da0d1409d721338be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"314a1990f37ad389d12ef9083bd382bc66dc21367ab8769da0d1409d721338be","first_computed_at":"2026-05-18T03:20:46.677296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:46.677296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OBU5RbZ9zrwovMnHiauT/8iWXeElPfHe84XK6df3We+/NOLZA3UWeRwAu7jVHNest1tL+77hKI2wQrE7jQsEAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:46.678129Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.3707","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecb802731adf266b003e6cf6bbe9f59654ab5e709fe4aaef6d57cf9d4e7c3a56","sha256:a6679507e4018ad430929ac527c9df1c81aa0b1d006b07eecf81f6e484fae757"],"state_sha256":"72eb0d8a3002f260e7b777af2bd6ff2b737fd7396b3f4c34ebac6ca9cec2995e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6VVU7JOa065p0EB6AlUiBw+hBlVRuqiH5Q0iE9JNT4VGCwi9q0aWWMFVFn4AhLw8O11btObsfgCTd9hr/JoEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:43:07.269464Z","bundle_sha256":"c4ff6ed6ceadbc038a1bb4b907708e63aaf6fc7430284709d1a1da3dfa1815b1"}}