{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TATRQEAMBHGC732P7NYJJR3FLH","short_pith_number":"pith:TATRQEAM","schema_version":"1.0","canonical_sha256":"982718100c09cc2fef4ffb7094c76559c23700fe789b6d6f4fcc3d423ed175f2","source":{"kind":"arxiv","id":"1907.10874","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.10874","created_at":"2026-05-17T23:39:34.247240+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.10874v1","created_at":"2026-05-17T23:39:34.247240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10874","created_at":"2026-05-17T23:39:34.247240+00:00"},{"alias_kind":"pith_short_12","alias_value":"TATRQEAMBHGC","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"TATRQEAMBHGC732P","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"TATRQEAM","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TATRQEAMBHGC732P7NYJJR3FLH","json":"https://pith.science/pith/TATRQEAMBHGC732P7NYJJR3FLH.json","graph_json":"https://pith.science/api/pith-number/TATRQEAMBHGC732P7NYJJR3FLH/graph.json","events_json":"https://pith.science/api/pith-number/TATRQEAMBHGC732P7NYJJR3FLH/events.json","paper":"https://pith.science/paper/TATRQEAM"},"agent_actions":{"view_html":"https://pith.science/pith/TATRQEAMBHGC732P7NYJJR3FLH","download_json":"https://pith.science/pith/TATRQEAMBHGC732P7NYJJR3FLH.json","view_paper":"https://pith.science/paper/TATRQEAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.10874&json=true","fetch_graph":"https://pith.science/api/pith-number/TATRQEAMBHGC732P7NYJJR3FLH/graph.json","fetch_events":"https://pith.science/api/pith-number/TATRQEAMBHGC732P7NYJJR3FLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TATRQEAMBHGC732P7NYJJR3FLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TATRQEAMBHGC732P7NYJJR3FLH/action/storage_attestation","attest_author":"https://pith.science/pith/TATRQEAMBHGC732P7NYJJR3FLH/action/author_attestation","sign_citation":"https://pith.science/pith/TATRQEAMBHGC732P7NYJJR3FLH/action/citation_signature","submit_replication":"https://pith.science/pith/TATRQEAMBHGC732P7NYJJR3FLH/action/replication_record"}},"created_at":"2026-05-17T23:39:34.247240+00:00","updated_at":"2026-05-17T23:39:34.247240+00:00"}