{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:R7T4AB7E2Q4VW65ZRUVEWTACMI","short_pith_number":"pith:R7T4AB7E","canonical_record":{"source":{"id":"1609.09827","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-30T17:31:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"bfba53e94dc31f002573d824ecea5e534863ba524c85658091156de5e8e507f6","abstract_canon_sha256":"1385ae1f75256d35e14976a3a3c1cee06a07ee831981743796b5af1ae0762973"},"schema_version":"1.0"},"canonical_sha256":"8fe7c007e4d4395b7bb98d2a4b4c02622cc7a35af504d927f82de0db6ea5255e","source":{"kind":"arxiv","id":"1609.09827","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09827","created_at":"2026-05-18T00:39:52Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09827v3","created_at":"2026-05-18T00:39:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09827","created_at":"2026-05-18T00:39:52Z"},{"alias_kind":"pith_short_12","alias_value":"R7T4AB7E2Q4V","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R7T4AB7E2Q4VW65Z","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R7T4AB7E","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:R7T4AB7E2Q4VW65ZRUVEWTACMI","target":"record","payload":{"canonical_record":{"source":{"id":"1609.09827","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-30T17:31:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"bfba53e94dc31f002573d824ecea5e534863ba524c85658091156de5e8e507f6","abstract_canon_sha256":"1385ae1f75256d35e14976a3a3c1cee06a07ee831981743796b5af1ae0762973"},"schema_version":"1.0"},"canonical_sha256":"8fe7c007e4d4395b7bb98d2a4b4c02622cc7a35af504d927f82de0db6ea5255e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:52.922078Z","signature_b64":"uXowUZhxEpxA8kEKREP+LwP7KmVOIckYA54dnDqcqjAcRM3hno2yRAmbehYC6hRBTDVJOkh2EXQjGvNOBsYcBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fe7c007e4d4395b7bb98d2a4b4c02622cc7a35af504d927f82de0db6ea5255e","last_reissued_at":"2026-05-18T00:39:52.921440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:52.921440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.09827","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:39:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yNgnLCrlMw8y7fAIwHjt46M1dp4Gddge1QfAfPhd0WZq46jNlSa8agirMe16a9eiHUhyGozjEwq1EJFihBcbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:24:08.745343Z"},"content_sha256":"afe9e7eaa6e25da6ce9b5e8a86508cf745b4a9644830c83489b382d7e7fa8855","schema_version":"1.0","event_id":"sha256:afe9e7eaa6e25da6ce9b5e8a86508cf745b4a9644830c83489b382d7e7fa8855"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:R7T4AB7E2Q4VW65ZRUVEWTACMI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sprout: A functional caching approach to minimize service latency in erasure-coded storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Tian Lan, Vaneet Aggarwal, Yih-Farn R. Chen, Yu Xiang","submitted_at":"2016-09-30T17:31:21Z","abstract_excerpt":"Modern distributed storage systems often use erasure codes to protect against disk and node failures to increase reliability, while trying to meet the latency requirements of the applications and clients. Storage systems may have caches at the proxy or client ends in order to reduce the latency. In this paper, we consider a novel caching framework with erasure code called functional caching. Functional Caching involves using erasure-coded chunks in the cache such that the code formed by the chunks in storage nodes and cache combined are maximal-distance-separable (MDS) erasure codes. Based on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09827","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:39:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GtjWyoS0AYnHM3to32LQgjlbzd9yrQ1PSjxjfvfnsMUTlbD6YAPMcGdVEYBk/I8qi2uiuq6BafPNVDK0X4cwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:24:08.745780Z"},"content_sha256":"010bae949b74ab9d4ceddc71d60ef5d8694dea1f82f83598ee5b1d70c9c512b3","schema_version":"1.0","event_id":"sha256:010bae949b74ab9d4ceddc71d60ef5d8694dea1f82f83598ee5b1d70c9c512b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R7T4AB7E2Q4VW65ZRUVEWTACMI/bundle.json","state_url":"https://pith.science/pith/R7T4AB7E2Q4VW65ZRUVEWTACMI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R7T4AB7E2Q4VW65ZRUVEWTACMI/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-03T00:24:08Z","links":{"resolver":"https://pith.science/pith/R7T4AB7E2Q4VW65ZRUVEWTACMI","bundle":"https://pith.science/pith/R7T4AB7E2Q4VW65ZRUVEWTACMI/bundle.json","state":"https://pith.science/pith/R7T4AB7E2Q4VW65ZRUVEWTACMI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R7T4AB7E2Q4VW65ZRUVEWTACMI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:R7T4AB7E2Q4VW65ZRUVEWTACMI","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":"1385ae1f75256d35e14976a3a3c1cee06a07ee831981743796b5af1ae0762973","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-30T17:31:21Z","title_canon_sha256":"bfba53e94dc31f002573d824ecea5e534863ba524c85658091156de5e8e507f6"},"schema_version":"1.0","source":{"id":"1609.09827","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09827","created_at":"2026-05-18T00:39:52Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09827v3","created_at":"2026-05-18T00:39:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09827","created_at":"2026-05-18T00:39:52Z"},{"alias_kind":"pith_short_12","alias_value":"R7T4AB7E2Q4V","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R7T4AB7E2Q4VW65Z","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R7T4AB7E","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:010bae949b74ab9d4ceddc71d60ef5d8694dea1f82f83598ee5b1d70c9c512b3","target":"graph","created_at":"2026-05-18T00:39:52Z","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":"Modern distributed storage systems often use erasure codes to protect against disk and node failures to increase reliability, while trying to meet the latency requirements of the applications and clients. Storage systems may have caches at the proxy or client ends in order to reduce the latency. In this paper, we consider a novel caching framework with erasure code called functional caching. Functional Caching involves using erasure-coded chunks in the cache such that the code formed by the chunks in storage nodes and cache combined are maximal-distance-separable (MDS) erasure codes. Based on ","authors_text":"Tian Lan, Vaneet Aggarwal, Yih-Farn R. Chen, Yu Xiang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-30T17:31:21Z","title":"Sprout: A functional caching approach to minimize service latency in erasure-coded storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09827","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:afe9e7eaa6e25da6ce9b5e8a86508cf745b4a9644830c83489b382d7e7fa8855","target":"record","created_at":"2026-05-18T00:39:52Z","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":"1385ae1f75256d35e14976a3a3c1cee06a07ee831981743796b5af1ae0762973","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-09-30T17:31:21Z","title_canon_sha256":"bfba53e94dc31f002573d824ecea5e534863ba524c85658091156de5e8e507f6"},"schema_version":"1.0","source":{"id":"1609.09827","kind":"arxiv","version":3}},"canonical_sha256":"8fe7c007e4d4395b7bb98d2a4b4c02622cc7a35af504d927f82de0db6ea5255e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fe7c007e4d4395b7bb98d2a4b4c02622cc7a35af504d927f82de0db6ea5255e","first_computed_at":"2026-05-18T00:39:52.921440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:52.921440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uXowUZhxEpxA8kEKREP+LwP7KmVOIckYA54dnDqcqjAcRM3hno2yRAmbehYC6hRBTDVJOkh2EXQjGvNOBsYcBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:52.922078Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.09827","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afe9e7eaa6e25da6ce9b5e8a86508cf745b4a9644830c83489b382d7e7fa8855","sha256:010bae949b74ab9d4ceddc71d60ef5d8694dea1f82f83598ee5b1d70c9c512b3"],"state_sha256":"d7ba7a1cc17222d85420fd33cb930148ecdeae79eb472da71dec73e25eb4fad8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ExsduqUuWQSxwZUMzxdG9cLe0Gw0r+Hj9MIy5u39oM09SClXKwk0BvbD4dZpfExUzuETsvgvfniV/Hu7HHkNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:24:08.747742Z","bundle_sha256":"6c87b7aa3d0228b47000ddf7be4a3328fab4360bdc9bb024ec8fdff4677238a8"}}