{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:CLCSZH6DGBZ3XUEVRRWFABJEC2","short_pith_number":"pith:CLCSZH6D","schema_version":"1.0","canonical_sha256":"12c52c9fc33073bbd0958c6c500524168f7913bc3cea926065802dd35cc4248d","source":{"kind":"arxiv","id":"1011.1708","version":2},"attestation_state":"computed","paper":{"title":"CRAM: Compressed Random Access Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung","submitted_at":"2010-11-08T04:10:42Z","abstract_excerpt":"We present a new data structure called the \\emph{Compressed Random Access Memory} (CRAM) that can store a dynamic string $T$ of characters, e.g., representing the memory of a computer, in compressed form while achieving asymptotically almost-optimal bounds (in terms of empirical entropy) on the compression ratio. It allows short substrings of $T$ to be decompressed and retrieved efficiently and, significantly, characters at arbitrary positions of $T$ to be modified quickly during execution \\emph{without decompressing the entire string}. This can be regarded as a new type of data compression th"},"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":"1011.1708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-08T04:10:42Z","cross_cats_sorted":[],"title_canon_sha256":"19bbb0ce5b478d27c23154d5d1a1a460dff67d091ab5b95a66934f3a1da26ff5","abstract_canon_sha256":"99c098902bd148661fdcf13ec98ac6f8226d87de1c8f4ebc18d3767b23438d2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:37.399766Z","signature_b64":"RtYK08650qVcw/ViqLAO861hsKirUpwQMoKrIPwUWyKIs6opIB1i+LVh/hEnVH2fIAFoYGqmEpjVrKRFe1RVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12c52c9fc33073bbd0958c6c500524168f7913bc3cea926065802dd35cc4248d","last_reissued_at":"2026-05-18T02:23:37.399116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:37.399116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CRAM: Compressed Random Access Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung","submitted_at":"2010-11-08T04:10:42Z","abstract_excerpt":"We present a new data structure called the \\emph{Compressed Random Access Memory} (CRAM) that can store a dynamic string $T$ of characters, e.g., representing the memory of a computer, in compressed form while achieving asymptotically almost-optimal bounds (in terms of empirical entropy) on the compression ratio. It allows short substrings of $T$ to be decompressed and retrieved efficiently and, significantly, characters at arbitrary positions of $T$ to be modified quickly during execution \\emph{without decompressing the entire string}. This can be regarded as a new type of data compression th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1708","kind":"arxiv","version":2},"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":"1011.1708","created_at":"2026-05-18T02:23:37.399215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.1708v2","created_at":"2026-05-18T02:23:37.399215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1708","created_at":"2026-05-18T02:23:37.399215+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLCSZH6DGBZ3","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLCSZH6DGBZ3XUEV","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLCSZH6D","created_at":"2026-05-18T12:26:06.534383+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/CLCSZH6DGBZ3XUEVRRWFABJEC2","json":"https://pith.science/pith/CLCSZH6DGBZ3XUEVRRWFABJEC2.json","graph_json":"https://pith.science/api/pith-number/CLCSZH6DGBZ3XUEVRRWFABJEC2/graph.json","events_json":"https://pith.science/api/pith-number/CLCSZH6DGBZ3XUEVRRWFABJEC2/events.json","paper":"https://pith.science/paper/CLCSZH6D"},"agent_actions":{"view_html":"https://pith.science/pith/CLCSZH6DGBZ3XUEVRRWFABJEC2","download_json":"https://pith.science/pith/CLCSZH6DGBZ3XUEVRRWFABJEC2.json","view_paper":"https://pith.science/paper/CLCSZH6D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.1708&json=true","fetch_graph":"https://pith.science/api/pith-number/CLCSZH6DGBZ3XUEVRRWFABJEC2/graph.json","fetch_events":"https://pith.science/api/pith-number/CLCSZH6DGBZ3XUEVRRWFABJEC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLCSZH6DGBZ3XUEVRRWFABJEC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLCSZH6DGBZ3XUEVRRWFABJEC2/action/storage_attestation","attest_author":"https://pith.science/pith/CLCSZH6DGBZ3XUEVRRWFABJEC2/action/author_attestation","sign_citation":"https://pith.science/pith/CLCSZH6DGBZ3XUEVRRWFABJEC2/action/citation_signature","submit_replication":"https://pith.science/pith/CLCSZH6DGBZ3XUEVRRWFABJEC2/action/replication_record"}},"created_at":"2026-05-18T02:23:37.399215+00:00","updated_at":"2026-05-18T02:23:37.399215+00:00"}