{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HFI2JEORESFT4I57JJVEMSE63M","short_pith_number":"pith:HFI2JEOR","schema_version":"1.0","canonical_sha256":"3951a491d1248b3e23bf4a6a46489edb23701eb442196a3e717ddb48d6ae5108","source":{"kind":"arxiv","id":"1103.2566","version":2},"attestation_state":"computed","paper":{"title":"Optimal query/update tradeoffs in versioned 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","submitted_at":"2011-03-13T23:35:48Z","abstract_excerpt":"External-memory dictionaries are a fundamental data structure in file systems and databases. Versioned (or fully-persistent) dictionaries have an associated version tree where queries can be performed at any version, updates can be performed on leaf versions, and any version can be `cloned' by adding a child. Various query/update tradeoffs are known for unversioned dictionaries, many of them with matching upper and lower bounds. No fully-versioned external-memory dictionaries are known with optimal space/query/update tradeoffs. In particular, no versioned constructions are known that offer upd"},"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.2566","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-13T23:35:48Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"c7a9b103086c213ef909cce0a08364f13e25f2127155d41c5b52faea9251ee88","abstract_canon_sha256":"130c233626b0b10640b66f5138255dfce5dd27c2533085ce3fa1d55b68bdb6f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:19.543284Z","signature_b64":"dlMGExZiF0MyzZyA4qVqCQBl5rj9IZMEBF+TDOf4OTi/SE1k5naejHBEjI+TwFiQCWhJOZOxei4tOPfKliecCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3951a491d1248b3e23bf4a6a46489edb23701eb442196a3e717ddb48d6ae5108","last_reissued_at":"2026-05-18T02:22:19.542617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:19.542617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal query/update tradeoffs in versioned 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","submitted_at":"2011-03-13T23:35:48Z","abstract_excerpt":"External-memory dictionaries are a fundamental data structure in file systems and databases. Versioned (or fully-persistent) dictionaries have an associated version tree where queries can be performed at any version, updates can be performed on leaf versions, and any version can be `cloned' by adding a child. Various query/update tradeoffs are known for unversioned dictionaries, many of them with matching upper and lower bounds. No fully-versioned external-memory dictionaries are known with optimal space/query/update tradeoffs. In particular, no versioned constructions are known that offer upd"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2566","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.2566","created_at":"2026-05-18T02:22:19.542705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2566v2","created_at":"2026-05-18T02:22:19.542705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2566","created_at":"2026-05-18T02:22:19.542705+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFI2JEORESFT","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFI2JEORESFT4I57","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFI2JEOR","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/HFI2JEORESFT4I57JJVEMSE63M","json":"https://pith.science/pith/HFI2JEORESFT4I57JJVEMSE63M.json","graph_json":"https://pith.science/api/pith-number/HFI2JEORESFT4I57JJVEMSE63M/graph.json","events_json":"https://pith.science/api/pith-number/HFI2JEORESFT4I57JJVEMSE63M/events.json","paper":"https://pith.science/paper/HFI2JEOR"},"agent_actions":{"view_html":"https://pith.science/pith/HFI2JEORESFT4I57JJVEMSE63M","download_json":"https://pith.science/pith/HFI2JEORESFT4I57JJVEMSE63M.json","view_paper":"https://pith.science/paper/HFI2JEOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2566&json=true","fetch_graph":"https://pith.science/api/pith-number/HFI2JEORESFT4I57JJVEMSE63M/graph.json","fetch_events":"https://pith.science/api/pith-number/HFI2JEORESFT4I57JJVEMSE63M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFI2JEORESFT4I57JJVEMSE63M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFI2JEORESFT4I57JJVEMSE63M/action/storage_attestation","attest_author":"https://pith.science/pith/HFI2JEORESFT4I57JJVEMSE63M/action/author_attestation","sign_citation":"https://pith.science/pith/HFI2JEORESFT4I57JJVEMSE63M/action/citation_signature","submit_replication":"https://pith.science/pith/HFI2JEORESFT4I57JJVEMSE63M/action/replication_record"}},"created_at":"2026-05-18T02:22:19.542705+00:00","updated_at":"2026-05-18T02:22:19.542705+00:00"}