{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:PREYGY4TAP42YIGJYUIRAFBZY5","short_pith_number":"pith:PREYGY4T","canonical_record":{"source":{"id":"0808.3546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2008-08-26T16:02:50Z","cross_cats_sorted":[],"title_canon_sha256":"6c731f8969529fd479c529fe6ea7bdb8b487a66843328ba1b8d3dc0850735c30","abstract_canon_sha256":"72eb4336ad63b064a5b807091edc71ba6043b09281fb739152c1b66a8d848ffa"},"schema_version":"1.0"},"canonical_sha256":"7c4983639303f9ac20c9c511101439c77a528e24d77d90bbe06cebc4186037ba","source":{"kind":"arxiv","id":"0808.3546","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.3546","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0808.3546v1","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.3546","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"PREYGY4TAP42","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"PREYGY4TAP42YIGJ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"PREYGY4T","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:PREYGY4TAP42YIGJYUIRAFBZY5","target":"record","payload":{"canonical_record":{"source":{"id":"0808.3546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2008-08-26T16:02:50Z","cross_cats_sorted":[],"title_canon_sha256":"6c731f8969529fd479c529fe6ea7bdb8b487a66843328ba1b8d3dc0850735c30","abstract_canon_sha256":"72eb4336ad63b064a5b807091edc71ba6043b09281fb739152c1b66a8d848ffa"},"schema_version":"1.0"},"canonical_sha256":"7c4983639303f9ac20c9c511101439c77a528e24d77d90bbe06cebc4186037ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.443980Z","signature_b64":"GlDMQX+LIhTwxcoK/tFDYHSdLw5qAWxa8BKdDeIpH1HOYDSG4CDuiGhozYbcVuJWoOUr1yXg2RDii4Ko1dK6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c4983639303f9ac20c9c511101439c77a528e24d77d90bbe06cebc4186037ba","last_reissued_at":"2026-05-18T00:58:48.443357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.443357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0808.3546","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-18T00:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e5L8bJ6AvOERmhENtKOgZTDaCroIuqNCVRYysRLxBV+itNcqvKugAckhp75Cb8MQZqzAvONR9Ro8WYTCHBVLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:28:21.449780Z"},"content_sha256":"4b1f8c696cc1235e0a151ed3e219d374de36c854cf3f175b0430848b8fcbff86","schema_version":"1.0","event_id":"sha256:4b1f8c696cc1235e0a151ed3e219d374de36c854cf3f175b0430848b8fcbff86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:PREYGY4TAP42YIGJYUIRAFBZY5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Large-scale Data Exploration through Data Diffusion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alex Szalay, Ian Foster, Ioan Raicu, Yong Zhao","submitted_at":"2008-08-26T16:02:50Z","abstract_excerpt":"Data-intensive applications often require exploratory analysis of large datasets. If analysis is performed on distributed resources, data locality can be crucial to high throughput and performance. We propose a \"data diffusion\" approach that acquires compute and storage resources dynamically, replicates data in response to demand, and schedules computations close to data. As demand increases, more resources are acquired, thus allowing faster response to subsequent requests that refer to the same data; when demand drops, resources are released. This approach can provide the benefits of dedicate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.3546","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-18T00:58:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wrtKYjEUVdn4seDGr6+nq9GLzD6+L1H4C/UEMOhXQevKR/eVX7ePxpS68z+/TIgUdiSvREWF4+w9PJr2ZjjOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:28:21.450359Z"},"content_sha256":"72167e6613d5b538627157dfa7653e8df70836f0624786afca9dd1d3a798b73e","schema_version":"1.0","event_id":"sha256:72167e6613d5b538627157dfa7653e8df70836f0624786afca9dd1d3a798b73e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PREYGY4TAP42YIGJYUIRAFBZY5/bundle.json","state_url":"https://pith.science/pith/PREYGY4TAP42YIGJYUIRAFBZY5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PREYGY4TAP42YIGJYUIRAFBZY5/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-26T14:28:21Z","links":{"resolver":"https://pith.science/pith/PREYGY4TAP42YIGJYUIRAFBZY5","bundle":"https://pith.science/pith/PREYGY4TAP42YIGJYUIRAFBZY5/bundle.json","state":"https://pith.science/pith/PREYGY4TAP42YIGJYUIRAFBZY5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PREYGY4TAP42YIGJYUIRAFBZY5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:PREYGY4TAP42YIGJYUIRAFBZY5","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":"72eb4336ad63b064a5b807091edc71ba6043b09281fb739152c1b66a8d848ffa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2008-08-26T16:02:50Z","title_canon_sha256":"6c731f8969529fd479c529fe6ea7bdb8b487a66843328ba1b8d3dc0850735c30"},"schema_version":"1.0","source":{"id":"0808.3546","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.3546","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0808.3546v1","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.3546","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"PREYGY4TAP42","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"PREYGY4TAP42YIGJ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"PREYGY4T","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:72167e6613d5b538627157dfa7653e8df70836f0624786afca9dd1d3a798b73e","target":"graph","created_at":"2026-05-18T00:58:48Z","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":"Data-intensive applications often require exploratory analysis of large datasets. If analysis is performed on distributed resources, data locality can be crucial to high throughput and performance. We propose a \"data diffusion\" approach that acquires compute and storage resources dynamically, replicates data in response to demand, and schedules computations close to data. As demand increases, more resources are acquired, thus allowing faster response to subsequent requests that refer to the same data; when demand drops, resources are released. This approach can provide the benefits of dedicate","authors_text":"Alex Szalay, Ian Foster, Ioan Raicu, Yong Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2008-08-26T16:02:50Z","title":"Accelerating Large-scale Data Exploration through Data Diffusion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.3546","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:4b1f8c696cc1235e0a151ed3e219d374de36c854cf3f175b0430848b8fcbff86","target":"record","created_at":"2026-05-18T00:58:48Z","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":"72eb4336ad63b064a5b807091edc71ba6043b09281fb739152c1b66a8d848ffa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2008-08-26T16:02:50Z","title_canon_sha256":"6c731f8969529fd479c529fe6ea7bdb8b487a66843328ba1b8d3dc0850735c30"},"schema_version":"1.0","source":{"id":"0808.3546","kind":"arxiv","version":1}},"canonical_sha256":"7c4983639303f9ac20c9c511101439c77a528e24d77d90bbe06cebc4186037ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c4983639303f9ac20c9c511101439c77a528e24d77d90bbe06cebc4186037ba","first_computed_at":"2026-05-18T00:58:48.443357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:48.443357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GlDMQX+LIhTwxcoK/tFDYHSdLw5qAWxa8BKdDeIpH1HOYDSG4CDuiGhozYbcVuJWoOUr1yXg2RDii4Ko1dK6Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:48.443980Z","signed_message":"canonical_sha256_bytes"},"source_id":"0808.3546","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b1f8c696cc1235e0a151ed3e219d374de36c854cf3f175b0430848b8fcbff86","sha256:72167e6613d5b538627157dfa7653e8df70836f0624786afca9dd1d3a798b73e"],"state_sha256":"3e4b1da2085b472194590dcf621954c7a4ce4da8b2ebe8b74f0e9ab5ba0bb7ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PEWx2osuKXYm9qQ9Oq+pHhsh+JnshquJlTvg9tfNpMizkYey4oMN0BO0sZLeohVCGTiqCq+zv4jzoX8io4USBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:28:21.453118Z","bundle_sha256":"132f744677d2925c85fb6f75aadd00ff88418996d8029468ee55e2666e810dc8"}}