{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OZNY4AE5WPH6C6YUTWCEHCUCYP","short_pith_number":"pith:OZNY4AE5","canonical_record":{"source":{"id":"1305.3945","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-05-16T22:03:57Z","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"title_canon_sha256":"71ffa5f39ce0a37246d6c3d28f392131982f2bdd7ae57b9c14859483c2a32dee","abstract_canon_sha256":"ddade5c85f37152148ecc98667f7c54c53c966d0682b24245cf9a78f52494651"},"schema_version":"1.0"},"canonical_sha256":"765b8e009db3cfe17b149d84438a82c3d2791166d4f74af2f5555e90eafc4be1","source":{"kind":"arxiv","id":"1305.3945","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3945","created_at":"2026-05-18T01:19:39Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3945v2","created_at":"2026-05-18T01:19:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3945","created_at":"2026-05-18T01:19:39Z"},{"alias_kind":"pith_short_12","alias_value":"OZNY4AE5WPH6","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OZNY4AE5WPH6C6YU","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OZNY4AE5","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OZNY4AE5WPH6C6YUTWCEHCUCYP","target":"record","payload":{"canonical_record":{"source":{"id":"1305.3945","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-05-16T22:03:57Z","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"title_canon_sha256":"71ffa5f39ce0a37246d6c3d28f392131982f2bdd7ae57b9c14859483c2a32dee","abstract_canon_sha256":"ddade5c85f37152148ecc98667f7c54c53c966d0682b24245cf9a78f52494651"},"schema_version":"1.0"},"canonical_sha256":"765b8e009db3cfe17b149d84438a82c3d2791166d4f74af2f5555e90eafc4be1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:39.119595Z","signature_b64":"pRtPqDkj3ehnrNrjCNDGAikPiotTVSwFufXo5HqLG68BRXdGzcNosc8Qq2NgPBcqPOyIG56c1rRSu6LqzfXUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"765b8e009db3cfe17b149d84438a82c3d2791166d4f74af2f5555e90eafc4be1","last_reissued_at":"2026-05-18T01:19:39.119165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:39.119165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.3945","source_version":2,"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:19:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NEzA6kcyKJGL7nXiKQgXdkAbWxECMGh3X/M91i6i4sGP6UO2I5zxCYBQJ39UwU1JtSkZCX7a3R8d1EtdaV1CCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:05:50.921564Z"},"content_sha256":"861e6166cf343ff41d3146d57674344ca6676dd9b6e66fa1cfae8953a1632fa9","schema_version":"1.0","event_id":"sha256:861e6166cf343ff41d3146d57674344ca6676dd9b6e66fa1cfae8953a1632fa9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OZNY4AE5WPH6C6YUTWCEHCUCYP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Delay-Storage Trade-off in Content Download from Coded Distributed Storage 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, Yanpei Liu","submitted_at":"2013-05-16T22:03:57Z","abstract_excerpt":"In this paper we study how coding in distributed storage reduces expected download time, in addition to providing reliability against disk failures. The expected download time is reduced because when a content file is encoded to add redundancy and distributed across multiple disks, reading only a subset of the disks is sufficient to reconstruct the content. For the same total storage used, coding exploits the diversity in storage better than simple replication, and hence gives faster download. We use a novel fork-join queuing framework to model multiple users requesting the content simultaneou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3945","kind":"arxiv","version":2},"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:19:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ltkPG7eT4TQd6UC+vp4xnR3fnaGLMDO1HmMaUPqJD6DLgZc6BJcUCrIfA2WmgJC8mPLuyTVe3ZfYTkExyVzgAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:05:50.922217Z"},"content_sha256":"a71d9b1ef893ebc2aedd0dc2fc401a73737d8bcec710cba56970c558a64d90c6","schema_version":"1.0","event_id":"sha256:a71d9b1ef893ebc2aedd0dc2fc401a73737d8bcec710cba56970c558a64d90c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZNY4AE5WPH6C6YUTWCEHCUCYP/bundle.json","state_url":"https://pith.science/pith/OZNY4AE5WPH6C6YUTWCEHCUCYP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZNY4AE5WPH6C6YUTWCEHCUCYP/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-25T10:05:50Z","links":{"resolver":"https://pith.science/pith/OZNY4AE5WPH6C6YUTWCEHCUCYP","bundle":"https://pith.science/pith/OZNY4AE5WPH6C6YUTWCEHCUCYP/bundle.json","state":"https://pith.science/pith/OZNY4AE5WPH6C6YUTWCEHCUCYP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZNY4AE5WPH6C6YUTWCEHCUCYP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OZNY4AE5WPH6C6YUTWCEHCUCYP","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":"ddade5c85f37152148ecc98667f7c54c53c966d0682b24245cf9a78f52494651","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-05-16T22:03:57Z","title_canon_sha256":"71ffa5f39ce0a37246d6c3d28f392131982f2bdd7ae57b9c14859483c2a32dee"},"schema_version":"1.0","source":{"id":"1305.3945","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3945","created_at":"2026-05-18T01:19:39Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3945v2","created_at":"2026-05-18T01:19:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3945","created_at":"2026-05-18T01:19:39Z"},{"alias_kind":"pith_short_12","alias_value":"OZNY4AE5WPH6","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OZNY4AE5WPH6C6YU","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OZNY4AE5","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:a71d9b1ef893ebc2aedd0dc2fc401a73737d8bcec710cba56970c558a64d90c6","target":"graph","created_at":"2026-05-18T01:19:39Z","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 this paper we study how coding in distributed storage reduces expected download time, in addition to providing reliability against disk failures. The expected download time is reduced because when a content file is encoded to add redundancy and distributed across multiple disks, reading only a subset of the disks is sufficient to reconstruct the content. For the same total storage used, coding exploits the diversity in storage better than simple replication, and hence gives faster download. We use a novel fork-join queuing framework to model multiple users requesting the content simultaneou","authors_text":"Emina Soljanin, Gauri Joshi, Yanpei Liu","cross_cats":["cs.IT","cs.PF","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-05-16T22:03:57Z","title":"On the Delay-Storage Trade-off in Content Download from Coded Distributed Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3945","kind":"arxiv","version":2},"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:861e6166cf343ff41d3146d57674344ca6676dd9b6e66fa1cfae8953a1632fa9","target":"record","created_at":"2026-05-18T01:19:39Z","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":"ddade5c85f37152148ecc98667f7c54c53c966d0682b24245cf9a78f52494651","cross_cats_sorted":["cs.IT","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-05-16T22:03:57Z","title_canon_sha256":"71ffa5f39ce0a37246d6c3d28f392131982f2bdd7ae57b9c14859483c2a32dee"},"schema_version":"1.0","source":{"id":"1305.3945","kind":"arxiv","version":2}},"canonical_sha256":"765b8e009db3cfe17b149d84438a82c3d2791166d4f74af2f5555e90eafc4be1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"765b8e009db3cfe17b149d84438a82c3d2791166d4f74af2f5555e90eafc4be1","first_computed_at":"2026-05-18T01:19:39.119165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:39.119165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pRtPqDkj3ehnrNrjCNDGAikPiotTVSwFufXo5HqLG68BRXdGzcNosc8Qq2NgPBcqPOyIG56c1rRSu6LqzfXUCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:39.119595Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.3945","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:861e6166cf343ff41d3146d57674344ca6676dd9b6e66fa1cfae8953a1632fa9","sha256:a71d9b1ef893ebc2aedd0dc2fc401a73737d8bcec710cba56970c558a64d90c6"],"state_sha256":"2639ca1bb182f6ecbaf2d2cd69606bc912b05f6cf5041930de4028ac24db371d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ld9UiV2b4FUJ1ZsuEfX3N5L4WZH8kadCm21XcEakAGrXHjw+kk3LkbfXrJxIGp4bYc74bcQzhewLMxAysTODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:05:50.925811Z","bundle_sha256":"86d0b70c8b2baef0ec60d2a8be966d47fab387e2528d3ffbd93da112fecc1bdb"}}