{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TATRQEAMBHGC732P7NYJJR3FLH","short_pith_number":"pith:TATRQEAM","canonical_record":{"source":{"id":"1907.10874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T07:37:42Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"849539a870ed9c13e022e6a77959ddc3eb3bc9ff766e9a3ec64df3bc1ede516a","abstract_canon_sha256":"7e322d4dbfb23f2f986b2aee8b49c0b14e8a9aa88908e707e6d609bb070bfccb"},"schema_version":"1.0"},"canonical_sha256":"982718100c09cc2fef4ffb7094c76559c23700fe789b6d6f4fcc3d423ed175f2","source":{"kind":"arxiv","id":"1907.10874","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10874","created_at":"2026-05-17T23:39:34Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10874v1","created_at":"2026-05-17T23:39:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10874","created_at":"2026-05-17T23:39:34Z"},{"alias_kind":"pith_short_12","alias_value":"TATRQEAMBHGC","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TATRQEAMBHGC732P","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TATRQEAM","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TATRQEAMBHGC732P7NYJJR3FLH","target":"record","payload":{"canonical_record":{"source":{"id":"1907.10874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T07:37:42Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"849539a870ed9c13e022e6a77959ddc3eb3bc9ff766e9a3ec64df3bc1ede516a","abstract_canon_sha256":"7e322d4dbfb23f2f986b2aee8b49c0b14e8a9aa88908e707e6d609bb070bfccb"},"schema_version":"1.0"},"canonical_sha256":"982718100c09cc2fef4ffb7094c76559c23700fe789b6d6f4fcc3d423ed175f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:34.247691Z","signature_b64":"7uiJHyGDQEXwDM8LM9O5eGvfc+UOAKIIUDqpJsDQQ9OWoVdQFB0zcVm1t3M046GY3RURbELtPRbgpyEk7O3UAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"982718100c09cc2fef4ffb7094c76559c23700fe789b6d6f4fcc3d423ed175f2","last_reissued_at":"2026-05-17T23:39:34.247155Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:34.247155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.10874","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-17T23:39:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KQGTYSRutF5RpkzuHa/2R0B51Og2OK1zyVOt9w5Vwk9MHrUYEZMU1eW6HEt6m29C3kjzm5voxtme5NyO9srECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:58:57.875107Z"},"content_sha256":"cb0f337711e8cac2ebc831e1ba2c20b2c56ac32b035801d2f8e7553aa2466fa8","schema_version":"1.0","event_id":"sha256:cb0f337711e8cac2ebc831e1ba2c20b2c56ac32b035801d2f8e7553aa2466fa8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TATRQEAMBHGC732P7NYJJR3FLH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to Store a Random Walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Emanuele Viola, Huacheng Yu, Omri Weinstein","submitted_at":"2019-07-25T07:37:42Z","abstract_excerpt":"Motivated by storage applications, we study the following data structure problem: An encoder wishes to store a collection of jointly-distributed files $\\overline{X}:=(X_1,X_2,\\ldots, X_n) \\sim \\mu$ which are \\emph{correlated} ($H_\\mu(\\overline{X}) \\ll \\sum_i H_\\mu(X_i)$), using as little (expected) memory as possible, such that each individual file $X_i$ can be recovered quickly with few (ideally constant) memory accesses.\n  In the case of independent random files, a dramatic result by \\Pat (FOCS'08) and subsequently by Dodis, \\Pat and Thorup (STOC'10) shows that it is possible to store $\\over"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10874","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-17T23:39:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6umN1G1lU6C5xDHgRseZB0GXGPDtqUb3rSPf9GTGjbgbE5WoJCOh6O4Ohp57IphflPYwZXXMnPrPDRXbZ8LqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:58:57.875465Z"},"content_sha256":"64fd5035408dfff016f45bcc00a23966f4f8d4cb1e21ae0e6946b597ad51a1de","schema_version":"1.0","event_id":"sha256:64fd5035408dfff016f45bcc00a23966f4f8d4cb1e21ae0e6946b597ad51a1de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TATRQEAMBHGC732P7NYJJR3FLH/bundle.json","state_url":"https://pith.science/pith/TATRQEAMBHGC732P7NYJJR3FLH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TATRQEAMBHGC732P7NYJJR3FLH/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-03T03:58:57Z","links":{"resolver":"https://pith.science/pith/TATRQEAMBHGC732P7NYJJR3FLH","bundle":"https://pith.science/pith/TATRQEAMBHGC732P7NYJJR3FLH/bundle.json","state":"https://pith.science/pith/TATRQEAMBHGC732P7NYJJR3FLH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TATRQEAMBHGC732P7NYJJR3FLH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TATRQEAMBHGC732P7NYJJR3FLH","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":"7e322d4dbfb23f2f986b2aee8b49c0b14e8a9aa88908e707e6d609bb070bfccb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T07:37:42Z","title_canon_sha256":"849539a870ed9c13e022e6a77959ddc3eb3bc9ff766e9a3ec64df3bc1ede516a"},"schema_version":"1.0","source":{"id":"1907.10874","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10874","created_at":"2026-05-17T23:39:34Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10874v1","created_at":"2026-05-17T23:39:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10874","created_at":"2026-05-17T23:39:34Z"},{"alias_kind":"pith_short_12","alias_value":"TATRQEAMBHGC","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TATRQEAMBHGC732P","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TATRQEAM","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:64fd5035408dfff016f45bcc00a23966f4f8d4cb1e21ae0e6946b597ad51a1de","target":"graph","created_at":"2026-05-17T23:39:34Z","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":"Motivated by storage applications, we study the following data structure problem: An encoder wishes to store a collection of jointly-distributed files $\\overline{X}:=(X_1,X_2,\\ldots, X_n) \\sim \\mu$ which are \\emph{correlated} ($H_\\mu(\\overline{X}) \\ll \\sum_i H_\\mu(X_i)$), using as little (expected) memory as possible, such that each individual file $X_i$ can be recovered quickly with few (ideally constant) memory accesses.\n  In the case of independent random files, a dramatic result by \\Pat (FOCS'08) and subsequently by Dodis, \\Pat and Thorup (STOC'10) shows that it is possible to store $\\over","authors_text":"Emanuele Viola, Huacheng Yu, Omri Weinstein","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T07:37:42Z","title":"How to Store a Random Walk"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10874","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:cb0f337711e8cac2ebc831e1ba2c20b2c56ac32b035801d2f8e7553aa2466fa8","target":"record","created_at":"2026-05-17T23:39:34Z","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":"7e322d4dbfb23f2f986b2aee8b49c0b14e8a9aa88908e707e6d609bb070bfccb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-25T07:37:42Z","title_canon_sha256":"849539a870ed9c13e022e6a77959ddc3eb3bc9ff766e9a3ec64df3bc1ede516a"},"schema_version":"1.0","source":{"id":"1907.10874","kind":"arxiv","version":1}},"canonical_sha256":"982718100c09cc2fef4ffb7094c76559c23700fe789b6d6f4fcc3d423ed175f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"982718100c09cc2fef4ffb7094c76559c23700fe789b6d6f4fcc3d423ed175f2","first_computed_at":"2026-05-17T23:39:34.247155Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:34.247155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7uiJHyGDQEXwDM8LM9O5eGvfc+UOAKIIUDqpJsDQQ9OWoVdQFB0zcVm1t3M046GY3RURbELtPRbgpyEk7O3UAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:34.247691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.10874","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb0f337711e8cac2ebc831e1ba2c20b2c56ac32b035801d2f8e7553aa2466fa8","sha256:64fd5035408dfff016f45bcc00a23966f4f8d4cb1e21ae0e6946b597ad51a1de"],"state_sha256":"1700af3ad7453479d70c32aaaef05ebc42c184183ca238a29aa6948c3c8189da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q500NpzplF8mgF+r6CxPUDzKvTDwjSIXyCOAKi28s/y7CQSbfflJph+LQZiY0Pn8WYrXX9GAWikpvMv6Ua1TCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:58:57.877424Z","bundle_sha256":"e56205f4af6f0d8c7d65f2b9e82d986535e9b77ecb0ca73f3ed9e8e15c28f34a"}}