{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IJB5FKI3VNNRFIGQ7V2D57UX5C","short_pith_number":"pith:IJB5FKI3","canonical_record":{"source":{"id":"1403.5007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-20T00:23:05Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0ab25d035879363fe8183f57128cc040d99f37659fca3ef0b727e02ed06020d7","abstract_canon_sha256":"6f83aaa668d7fa2393d0a087faf21a4864423debcff807aada4098df3ee3cff0"},"schema_version":"1.0"},"canonical_sha256":"4243d2a91bab5b12a0d0fd743efe97e8a15c7cbed81bcca5427eaec8a8ce4bf6","source":{"kind":"arxiv","id":"1403.5007","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5007","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5007v1","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5007","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"IJB5FKI3VNNR","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IJB5FKI3VNNRFIGQ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IJB5FKI3","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IJB5FKI3VNNRFIGQ7V2D57UX5C","target":"record","payload":{"canonical_record":{"source":{"id":"1403.5007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-20T00:23:05Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0ab25d035879363fe8183f57128cc040d99f37659fca3ef0b727e02ed06020d7","abstract_canon_sha256":"6f83aaa668d7fa2393d0a087faf21a4864423debcff807aada4098df3ee3cff0"},"schema_version":"1.0"},"canonical_sha256":"4243d2a91bab5b12a0d0fd743efe97e8a15c7cbed81bcca5427eaec8a8ce4bf6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:58.334213Z","signature_b64":"e4c0YZWiBuSap9tgBlkJbs9gNx2EycZI/PnyRa2C9LEIpdLtwhQ3NmKmKpmJyJGFDRinVvBRm//ROdKw64q2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4243d2a91bab5b12a0d0fd743efe97e8a15c7cbed81bcca5427eaec8a8ce4bf6","last_reissued_at":"2026-05-18T02:55:58.333825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:58.333825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.5007","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-18T02:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NNlk0OXWVaffhHbEb1GJ1zkxjrNG5QgxSpen1Stu7TVXzQHuXFuQZas9B0w0j4kDub/D5vC+boYB+jTaYzUzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:14:44.238359Z"},"content_sha256":"aa3fa22b809a2521ae34866057708ba86daf6405e5d74f07e74baffb4b413bfe","schema_version":"1.0","event_id":"sha256:aa3fa22b809a2521ae34866057708ba86daf6405e5d74f07e74baffb4b413bfe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IJB5FKI3VNNRFIGQ7V2D57UX5C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Throughput-Delay Optimal Access to Storage Clouds via Load Adaptive Coding and Chunking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Guanfeng Liang, Ulas C. Kozat","submitted_at":"2014-03-20T00:23:05Z","abstract_excerpt":"Recent literature including our past work provide analysis and solutions for using (i) erasure coding, (ii) parallelism, or (iii) variable slicing/chunking (i.e., dividing an object of a specific size into a variable number of smaller chunks) in speeding the I/O performance of storage clouds. However, a comprehensive approach that considers all three dimensions together to achieve the best throughput-delay trade-off curve had been lacking. This paper presents the first set of solutions that can pick the best combination of coding rate and object chunking/slicing options as the load dynamically"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5007","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-18T02:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qzQhMeJbnCbuNriIggSNKdG7trH7BhEiDEVkqQIqubLdQ3dlUqLhU3OySJTfwVbJwFNilImL2dLBZE7vfknzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:14:44.238709Z"},"content_sha256":"bd5cedf468c6ed4ec1b094985bd707525862a4de2c72610f80778a0a05993c70","schema_version":"1.0","event_id":"sha256:bd5cedf468c6ed4ec1b094985bd707525862a4de2c72610f80778a0a05993c70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJB5FKI3VNNRFIGQ7V2D57UX5C/bundle.json","state_url":"https://pith.science/pith/IJB5FKI3VNNRFIGQ7V2D57UX5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJB5FKI3VNNRFIGQ7V2D57UX5C/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-07-03T09:14:44Z","links":{"resolver":"https://pith.science/pith/IJB5FKI3VNNRFIGQ7V2D57UX5C","bundle":"https://pith.science/pith/IJB5FKI3VNNRFIGQ7V2D57UX5C/bundle.json","state":"https://pith.science/pith/IJB5FKI3VNNRFIGQ7V2D57UX5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJB5FKI3VNNRFIGQ7V2D57UX5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IJB5FKI3VNNRFIGQ7V2D57UX5C","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":"6f83aaa668d7fa2393d0a087faf21a4864423debcff807aada4098df3ee3cff0","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-20T00:23:05Z","title_canon_sha256":"0ab25d035879363fe8183f57128cc040d99f37659fca3ef0b727e02ed06020d7"},"schema_version":"1.0","source":{"id":"1403.5007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5007","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5007v1","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5007","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"IJB5FKI3VNNR","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IJB5FKI3VNNRFIGQ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IJB5FKI3","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:bd5cedf468c6ed4ec1b094985bd707525862a4de2c72610f80778a0a05993c70","target":"graph","created_at":"2026-05-18T02:55:58Z","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":"Recent literature including our past work provide analysis and solutions for using (i) erasure coding, (ii) parallelism, or (iii) variable slicing/chunking (i.e., dividing an object of a specific size into a variable number of smaller chunks) in speeding the I/O performance of storage clouds. However, a comprehensive approach that considers all three dimensions together to achieve the best throughput-delay trade-off curve had been lacking. This paper presents the first set of solutions that can pick the best combination of coding rate and object chunking/slicing options as the load dynamically","authors_text":"Guanfeng Liang, Ulas C. Kozat","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-20T00:23:05Z","title":"On Throughput-Delay Optimal Access to Storage Clouds via Load Adaptive Coding and Chunking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5007","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:aa3fa22b809a2521ae34866057708ba86daf6405e5d74f07e74baffb4b413bfe","target":"record","created_at":"2026-05-18T02:55:58Z","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":"6f83aaa668d7fa2393d0a087faf21a4864423debcff807aada4098df3ee3cff0","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-20T00:23:05Z","title_canon_sha256":"0ab25d035879363fe8183f57128cc040d99f37659fca3ef0b727e02ed06020d7"},"schema_version":"1.0","source":{"id":"1403.5007","kind":"arxiv","version":1}},"canonical_sha256":"4243d2a91bab5b12a0d0fd743efe97e8a15c7cbed81bcca5427eaec8a8ce4bf6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4243d2a91bab5b12a0d0fd743efe97e8a15c7cbed81bcca5427eaec8a8ce4bf6","first_computed_at":"2026-05-18T02:55:58.333825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:58.333825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e4c0YZWiBuSap9tgBlkJbs9gNx2EycZI/PnyRa2C9LEIpdLtwhQ3NmKmKpmJyJGFDRinVvBRm//ROdKw64q2Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:58.334213Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.5007","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa3fa22b809a2521ae34866057708ba86daf6405e5d74f07e74baffb4b413bfe","sha256:bd5cedf468c6ed4ec1b094985bd707525862a4de2c72610f80778a0a05993c70"],"state_sha256":"04b2dfba6583a2afd7a382203e6ad63fb081990bf3d969f17b67242c9ca58fbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DW+fX/9dKlfCpDIizKLM5A1b/3zjonLBIRqFWAaIuZp1bFoJLFVJc9XkzXfdA1zO4D/egrG29qZ8CZVTbdSkBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T09:14:44.240586Z","bundle_sha256":"e292a86f1c1f2309883ab977e101fbd3eed99712bf7e5568d96937f8a8b3be92"}}