{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:G3PUOG5LQ2NXH2QKEXLUTRDCP3","short_pith_number":"pith:G3PUOG5L","canonical_record":{"source":{"id":"1510.04731","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-15T22:29:42Z","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"title_canon_sha256":"dad887334e23e59d9fe29d8025cc5ea3278a1fb412b46f1b3a53e35b5bd8aca2","abstract_canon_sha256":"ef99b353941f644b0363b3299511339f2ec52f8f6590f432622845d16b003860"},"schema_version":"1.0"},"canonical_sha256":"36df471bab869b73ea0a25d749c4627eeb9150f08bdd61dd5153b98418376cff","source":{"kind":"arxiv","id":"1510.04731","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04731","created_at":"2026-05-18T01:29:40Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04731v1","created_at":"2026-05-18T01:29:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04731","created_at":"2026-05-18T01:29:40Z"},{"alias_kind":"pith_short_12","alias_value":"G3PUOG5LQ2NX","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G3PUOG5LQ2NXH2QK","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G3PUOG5L","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:G3PUOG5LQ2NXH2QKEXLUTRDCP3","target":"record","payload":{"canonical_record":{"source":{"id":"1510.04731","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-15T22:29:42Z","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"title_canon_sha256":"dad887334e23e59d9fe29d8025cc5ea3278a1fb412b46f1b3a53e35b5bd8aca2","abstract_canon_sha256":"ef99b353941f644b0363b3299511339f2ec52f8f6590f432622845d16b003860"},"schema_version":"1.0"},"canonical_sha256":"36df471bab869b73ea0a25d749c4627eeb9150f08bdd61dd5153b98418376cff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:40.138878Z","signature_b64":"YMwRDdU7Insv6bg2mSlsfexWd5C5eGTm2pqx6sXoSMVQcSqnff+jfue0H9yIfqgQ65YnPsszrTJztR1EEDaeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36df471bab869b73ea0a25d749c4627eeb9150f08bdd61dd5153b98418376cff","last_reissued_at":"2026-05-18T01:29:40.138156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:40.138156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.04731","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-18T01:29:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rcjh5C61b26KPMpBRVj7J7S2eWu20ydtgMOkcEAGzreEXmHP8nx3jDG4dZVIgvVOhEhMKcVgujMtPXuqRq0dAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:36:16.050504Z"},"content_sha256":"d276de0681a4d7cd7bd794044fdd15b967294f5332df752f2c9a6f138cd0847f","schema_version":"1.0","event_id":"sha256:d276de0681a4d7cd7bd794044fdd15b967294f5332df752f2c9a6f138cd0847f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:G3PUOG5LQ2NXH2QKEXLUTRDCP3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Replication of Queued Tasks for Latency Reduction in Cloud Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.PF","math.IT"],"primary_cat":"cs.DC","authors_text":"Emina Soljanin, Gauri Joshi, Gregory Wornell","submitted_at":"2015-10-15T22:29:42Z","abstract_excerpt":"In cloud computing systems, assigning a job 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. Although adding redundant replicas always reduces service time, the total computing time spent per job may be higher, thus increasing waiting time in queue. The total time spent per job is also proportional to the cost of computing resources. We analyze how different redundancy strategies, for eg. number of replicas, and the time when they are issued and canceled, affect the latency and computing cos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04731","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-18T01:29:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CwBcV6I3m1KbwLgS8izi0JMXYS5m7KSsyZFLFMPaFsUW4v7+Bg6dHdU7tQ75IfZN7+7L1bbecigFCzd6BqVuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:36:16.051218Z"},"content_sha256":"ed77532959563de5edd251272b3e41fccd482f04bd07fefd048baf6239529f16","schema_version":"1.0","event_id":"sha256:ed77532959563de5edd251272b3e41fccd482f04bd07fefd048baf6239529f16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G3PUOG5LQ2NXH2QKEXLUTRDCP3/bundle.json","state_url":"https://pith.science/pith/G3PUOG5LQ2NXH2QKEXLUTRDCP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G3PUOG5LQ2NXH2QKEXLUTRDCP3/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-25T16:36:16Z","links":{"resolver":"https://pith.science/pith/G3PUOG5LQ2NXH2QKEXLUTRDCP3","bundle":"https://pith.science/pith/G3PUOG5LQ2NXH2QKEXLUTRDCP3/bundle.json","state":"https://pith.science/pith/G3PUOG5LQ2NXH2QKEXLUTRDCP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G3PUOG5LQ2NXH2QKEXLUTRDCP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:G3PUOG5LQ2NXH2QKEXLUTRDCP3","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":"ef99b353941f644b0363b3299511339f2ec52f8f6590f432622845d16b003860","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-15T22:29:42Z","title_canon_sha256":"dad887334e23e59d9fe29d8025cc5ea3278a1fb412b46f1b3a53e35b5bd8aca2"},"schema_version":"1.0","source":{"id":"1510.04731","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04731","created_at":"2026-05-18T01:29:40Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04731v1","created_at":"2026-05-18T01:29:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04731","created_at":"2026-05-18T01:29:40Z"},{"alias_kind":"pith_short_12","alias_value":"G3PUOG5LQ2NX","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"G3PUOG5LQ2NXH2QK","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"G3PUOG5L","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:ed77532959563de5edd251272b3e41fccd482f04bd07fefd048baf6239529f16","target":"graph","created_at":"2026-05-18T01:29:40Z","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 job 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. Although adding redundant replicas always reduces service time, the total computing time spent per job may be higher, thus increasing waiting time in queue. The total time spent per job is also proportional to the cost of computing resources. We analyze how different redundancy strategies, for eg. number of replicas, and the time when they are issued and canceled, affect the latency and computing cos","authors_text":"Emina Soljanin, Gauri Joshi, Gregory Wornell","cross_cats":["cs.IT","cs.PF","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-15T22:29:42Z","title":"Efficient Replication of Queued Tasks for Latency Reduction in Cloud Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04731","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:d276de0681a4d7cd7bd794044fdd15b967294f5332df752f2c9a6f138cd0847f","target":"record","created_at":"2026-05-18T01:29:40Z","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":"ef99b353941f644b0363b3299511339f2ec52f8f6590f432622845d16b003860","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-15T22:29:42Z","title_canon_sha256":"dad887334e23e59d9fe29d8025cc5ea3278a1fb412b46f1b3a53e35b5bd8aca2"},"schema_version":"1.0","source":{"id":"1510.04731","kind":"arxiv","version":1}},"canonical_sha256":"36df471bab869b73ea0a25d749c4627eeb9150f08bdd61dd5153b98418376cff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36df471bab869b73ea0a25d749c4627eeb9150f08bdd61dd5153b98418376cff","first_computed_at":"2026-05-18T01:29:40.138156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:40.138156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YMwRDdU7Insv6bg2mSlsfexWd5C5eGTm2pqx6sXoSMVQcSqnff+jfue0H9yIfqgQ65YnPsszrTJztR1EEDaeCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:40.138878Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.04731","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d276de0681a4d7cd7bd794044fdd15b967294f5332df752f2c9a6f138cd0847f","sha256:ed77532959563de5edd251272b3e41fccd482f04bd07fefd048baf6239529f16"],"state_sha256":"afcdc20b2d29336d83593306c49c765a69b3c96a84968c99b60fbd593212ca0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/9lTiL44NC9bbuN8USxK9MSCU/tjznolVso0N+MkZFcO+qe9tT221KrE7dOO/JWis8emhs/VcQ4qnk+8qrY1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:36:16.055232Z","bundle_sha256":"aabe83df9558bd7773b6c27787509e7da203fee6c38b0cb2da1c2cab7c232cec"}}