{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GMSQYBQENCBTZ25IHVHUUB5OC2","short_pith_number":"pith:GMSQYBQE","schema_version":"1.0","canonical_sha256":"33250c060468833ceba83d4f4a07ae16a086b20d343e2dd9eddce3717c4ca142","source":{"kind":"arxiv","id":"1103.4282","version":2},"attestation_state":"computed","paper":{"title":"Stratified B-trees and versioning dictionaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Andrew Byde, Andy Twigg, Grzegorz Milos, John Wilkes, Tim Moreton, Tom Wilkie","submitted_at":"2011-03-22T14:58:20Z","abstract_excerpt":"A classic versioned data structure in storage and computer science is the copy-on-write (CoW) B-tree -- it underlies many of today's file systems and databases, including WAFL, ZFS, Btrfs and more. Unfortunately, it doesn't inherit the B-tree's optimality properties; it has poor space utilization, cannot offer fast updates, and relies on random IO to scale. Yet, nothing better has been developed since. We describe the `stratified B-tree', which beats all known semi-external memory versioned B-trees, including the CoW B-tree. In particular, it is the first versioned dictionary to achieve optima"},"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":"1103.4282","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-22T14:58:20Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"1310978c2b5fe0fed83a148eb6e8df9bae1734a41932ad554402d191c09c16ea","abstract_canon_sha256":"cc32ff8e817e611350f7dbeea019e35d1d728043da90e5ed130fa4492ed24350"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:11.740462Z","signature_b64":"0NBcGi91lMHAvR9eZjMN1wokmXPIjkRhKzXB8kotpTzpLtYkKhJHBYLxtHg+X9z82/p88+5KWRy+nQQ61hcHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33250c060468833ceba83d4f4a07ae16a086b20d343e2dd9eddce3717c4ca142","last_reissued_at":"2026-05-18T02:22:11.740036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:11.740036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stratified B-trees and versioning dictionaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Andrew Byde, Andy Twigg, Grzegorz Milos, John Wilkes, Tim Moreton, Tom Wilkie","submitted_at":"2011-03-22T14:58:20Z","abstract_excerpt":"A classic versioned data structure in storage and computer science is the copy-on-write (CoW) B-tree -- it underlies many of today's file systems and databases, including WAFL, ZFS, Btrfs and more. Unfortunately, it doesn't inherit the B-tree's optimality properties; it has poor space utilization, cannot offer fast updates, and relies on random IO to scale. Yet, nothing better has been developed since. We describe the `stratified B-tree', which beats all known semi-external memory versioned B-trees, including the CoW B-tree. In particular, it is the first versioned dictionary to achieve optima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4282","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":"1103.4282","created_at":"2026-05-18T02:22:11.740096+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.4282v2","created_at":"2026-05-18T02:22:11.740096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4282","created_at":"2026-05-18T02:22:11.740096+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMSQYBQENCBT","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMSQYBQENCBTZ25I","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMSQYBQE","created_at":"2026-05-18T12:26:30.835961+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/GMSQYBQENCBTZ25IHVHUUB5OC2","json":"https://pith.science/pith/GMSQYBQENCBTZ25IHVHUUB5OC2.json","graph_json":"https://pith.science/api/pith-number/GMSQYBQENCBTZ25IHVHUUB5OC2/graph.json","events_json":"https://pith.science/api/pith-number/GMSQYBQENCBTZ25IHVHUUB5OC2/events.json","paper":"https://pith.science/paper/GMSQYBQE"},"agent_actions":{"view_html":"https://pith.science/pith/GMSQYBQENCBTZ25IHVHUUB5OC2","download_json":"https://pith.science/pith/GMSQYBQENCBTZ25IHVHUUB5OC2.json","view_paper":"https://pith.science/paper/GMSQYBQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.4282&json=true","fetch_graph":"https://pith.science/api/pith-number/GMSQYBQENCBTZ25IHVHUUB5OC2/graph.json","fetch_events":"https://pith.science/api/pith-number/GMSQYBQENCBTZ25IHVHUUB5OC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMSQYBQENCBTZ25IHVHUUB5OC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMSQYBQENCBTZ25IHVHUUB5OC2/action/storage_attestation","attest_author":"https://pith.science/pith/GMSQYBQENCBTZ25IHVHUUB5OC2/action/author_attestation","sign_citation":"https://pith.science/pith/GMSQYBQENCBTZ25IHVHUUB5OC2/action/citation_signature","submit_replication":"https://pith.science/pith/GMSQYBQENCBTZ25IHVHUUB5OC2/action/replication_record"}},"created_at":"2026-05-18T02:22:11.740096+00:00","updated_at":"2026-05-18T02:22:11.740096+00:00"}