{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YHSOISZ7PFDQUG46O3MJ2QJO2W","short_pith_number":"pith:YHSOISZ7","canonical_record":{"source":{"id":"1501.01661","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-01-07T21:57:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"357ff7f55c50f5cd2d7318b6c44968d8e7d03cd79e811932b43d4d3a2aa2e62f","abstract_canon_sha256":"4c3cac06673b77b95406df319d4b6461eeffc9f9e606e5c2cfc524736e1c32c0"},"schema_version":"1.0"},"canonical_sha256":"c1e4e44b3f79470a1b9e76d89d412ed58ee8b26b21ddc1865fea6f889d6fb536","source":{"kind":"arxiv","id":"1501.01661","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01661","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01661v3","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01661","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"YHSOISZ7PFDQ","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YHSOISZ7PFDQUG46","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YHSOISZ7","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YHSOISZ7PFDQUG46O3MJ2QJO2W","target":"record","payload":{"canonical_record":{"source":{"id":"1501.01661","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-01-07T21:57:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"357ff7f55c50f5cd2d7318b6c44968d8e7d03cd79e811932b43d4d3a2aa2e62f","abstract_canon_sha256":"4c3cac06673b77b95406df319d4b6461eeffc9f9e606e5c2cfc524736e1c32c0"},"schema_version":"1.0"},"canonical_sha256":"c1e4e44b3f79470a1b9e76d89d412ed58ee8b26b21ddc1865fea6f889d6fb536","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:36.374080Z","signature_b64":"qtxbtaSlw6t1AJlrb8wtNi6P6Ss+23l5NxrPZI9EHCMXv92bRCBzV2/oQnOEc2QQVbSKAQdP4ewTZX8QwH1PAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1e4e44b3f79470a1b9e76d89d412ed58ee8b26b21ddc1865fea6f889d6fb536","last_reissued_at":"2026-05-18T00:58:36.373494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:36.373494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.01661","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:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kvrZyZ2HY2JT+nGbbkzE/YMerKwvJ1JyGUyrwV1FftPmZHylZZO4gWqFn76Acm8ch+n+lkY2vCYZi7WIrCl/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T11:16:26.526540Z"},"content_sha256":"47399cdf6dd0ad657ee4e25e5afd7dffde8bae69f77c435153ca45c4652bfee9","schema_version":"1.0","event_id":"sha256:47399cdf6dd0ad657ee4e25e5afd7dffde8bae69f77c435153ca45c4652bfee9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YHSOISZ7PFDQUG46O3MJ2QJO2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Provably Delay Efficient Data Retrieving in Storage Clouds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"C. Emre Koksal, Kyu-Han Kim, Ness B. Shroff, Yin Sun, Zizhan Zheng","submitted_at":"2015-01-07T21:57:08Z","abstract_excerpt":"One key requirement for storage clouds is to be able to retrieve data quickly. Recent system measurements have shown that the data retrieving delay in storage clouds is highly variable, which may result in a long latency tail. One crucial idea to improve the delay performance is to retrieve multiple data copies by using parallel downloading threads. However, how to optimally schedule these downloading threads to minimize the data retrieving delay remains to be an important open problem. In this paper, we develop low-complexity thread scheduling policies for several important classes of data do"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01661","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:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/4cTISS0XnHEwqJfiI/G71PA/JJGEPOWsnLLQiSJVAZQsJcoe7dS3dR0MqSRkXGQZZ8qoWX6pM971FX0bA3NAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T11:16:26.526886Z"},"content_sha256":"9919d8e80c942b393b292fe59fca10cebc857f5d55a4bb6a095969b9ffcf4b2e","schema_version":"1.0","event_id":"sha256:9919d8e80c942b393b292fe59fca10cebc857f5d55a4bb6a095969b9ffcf4b2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YHSOISZ7PFDQUG46O3MJ2QJO2W/bundle.json","state_url":"https://pith.science/pith/YHSOISZ7PFDQUG46O3MJ2QJO2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YHSOISZ7PFDQUG46O3MJ2QJO2W/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-06-20T11:16:26Z","links":{"resolver":"https://pith.science/pith/YHSOISZ7PFDQUG46O3MJ2QJO2W","bundle":"https://pith.science/pith/YHSOISZ7PFDQUG46O3MJ2QJO2W/bundle.json","state":"https://pith.science/pith/YHSOISZ7PFDQUG46O3MJ2QJO2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YHSOISZ7PFDQUG46O3MJ2QJO2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YHSOISZ7PFDQUG46O3MJ2QJO2W","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":"4c3cac06673b77b95406df319d4b6461eeffc9f9e606e5c2cfc524736e1c32c0","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-01-07T21:57:08Z","title_canon_sha256":"357ff7f55c50f5cd2d7318b6c44968d8e7d03cd79e811932b43d4d3a2aa2e62f"},"schema_version":"1.0","source":{"id":"1501.01661","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01661","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01661v3","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01661","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"YHSOISZ7PFDQ","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YHSOISZ7PFDQUG46","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YHSOISZ7","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:9919d8e80c942b393b292fe59fca10cebc857f5d55a4bb6a095969b9ffcf4b2e","target":"graph","created_at":"2026-05-18T00:58:36Z","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 key requirement for storage clouds is to be able to retrieve data quickly. Recent system measurements have shown that the data retrieving delay in storage clouds is highly variable, which may result in a long latency tail. One crucial idea to improve the delay performance is to retrieve multiple data copies by using parallel downloading threads. However, how to optimally schedule these downloading threads to minimize the data retrieving delay remains to be an important open problem. In this paper, we develop low-complexity thread scheduling policies for several important classes of data do","authors_text":"C. Emre Koksal, Kyu-Han Kim, Ness B. Shroff, Yin Sun, Zizhan Zheng","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-01-07T21:57:08Z","title":"Provably Delay Efficient Data Retrieving in Storage Clouds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01661","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:47399cdf6dd0ad657ee4e25e5afd7dffde8bae69f77c435153ca45c4652bfee9","target":"record","created_at":"2026-05-18T00:58:36Z","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":"4c3cac06673b77b95406df319d4b6461eeffc9f9e606e5c2cfc524736e1c32c0","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-01-07T21:57:08Z","title_canon_sha256":"357ff7f55c50f5cd2d7318b6c44968d8e7d03cd79e811932b43d4d3a2aa2e62f"},"schema_version":"1.0","source":{"id":"1501.01661","kind":"arxiv","version":3}},"canonical_sha256":"c1e4e44b3f79470a1b9e76d89d412ed58ee8b26b21ddc1865fea6f889d6fb536","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1e4e44b3f79470a1b9e76d89d412ed58ee8b26b21ddc1865fea6f889d6fb536","first_computed_at":"2026-05-18T00:58:36.373494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:36.373494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qtxbtaSlw6t1AJlrb8wtNi6P6Ss+23l5NxrPZI9EHCMXv92bRCBzV2/oQnOEc2QQVbSKAQdP4ewTZX8QwH1PAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:36.374080Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.01661","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47399cdf6dd0ad657ee4e25e5afd7dffde8bae69f77c435153ca45c4652bfee9","sha256:9919d8e80c942b393b292fe59fca10cebc857f5d55a4bb6a095969b9ffcf4b2e"],"state_sha256":"299203b5dedad9947588b1177bce85abc7ae0a9514bb90109cabb6a698cf211d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6THQHJGhq1P8BIP73l6khwCuDMkOhzK31nXCSIxR96zv54FaN8G7YW9UdfDrFLZj/m7qmB/nfT0OPhtalfZhAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T11:16:26.528896Z","bundle_sha256":"c24f1974f9b6592b476214b624f47749465e349b78cfda22d6c682923678e70d"}}