{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QXFRNVHEKPWE3QDUR64BPE6JG5","short_pith_number":"pith:QXFRNVHE","schema_version":"1.0","canonical_sha256":"85cb16d4e453ec4dc0748fb81793c93776d5db2ad4f6ac8faf5d1cefe322928e","source":{"kind":"arxiv","id":"1112.5472","version":3},"attestation_state":"computed","paper":{"title":"Cache-Oblivious Implicit Predecessor Dictionaries with the Working Set Property","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Casper Kejlberg-Rasmussen, Gerth St{\\o}lting Brodal","submitted_at":"2011-12-22T21:45:16Z","abstract_excerpt":"In this paper we present an implicit dynamic dictionary with the working-set property, supporting insert(e) and delete(e) in O(log n) time, predecessor(e) in O(log l_{p(e)}) time, successor(e) in O(log l_{s(e)}) time and search(e) in O(log min(l_{p(e)},l_{e}, l_{s(e)})) time, where n is the number of elements stored in the dictionary, l_{e} is the number of distinct elements searched for since element e was last searched for and p(e) and s(e) are the predecessor and successor of e, respectively. The time-bounds are all worst-case. The dictionary stores the elements in an array of size n using "},"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":"1112.5472","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2011-12-22T21:45:16Z","cross_cats_sorted":[],"title_canon_sha256":"164d547ca322880e6365c289de388197d52eda1608a45c88b9e9e19b55eb6291","abstract_canon_sha256":"cb91738f1081fcc95f2f3c7c9edc68f777abbb4b1522a8c1d9059a6b81ac0af4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:48.658855Z","signature_b64":"2U5GeGGplZjJcB57puRsGKDIFrBCmJUDZYuW9HZmAUsWVmgLW0UJws2sjhUAjO5f+bu2m09go+8jKB5f9AyHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85cb16d4e453ec4dc0748fb81793c93776d5db2ad4f6ac8faf5d1cefe322928e","last_reissued_at":"2026-05-18T03:51:48.657949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:48.657949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cache-Oblivious Implicit Predecessor Dictionaries with the Working Set Property","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Casper Kejlberg-Rasmussen, Gerth St{\\o}lting Brodal","submitted_at":"2011-12-22T21:45:16Z","abstract_excerpt":"In this paper we present an implicit dynamic dictionary with the working-set property, supporting insert(e) and delete(e) in O(log n) time, predecessor(e) in O(log l_{p(e)}) time, successor(e) in O(log l_{s(e)}) time and search(e) in O(log min(l_{p(e)},l_{e}, l_{s(e)})) time, where n is the number of elements stored in the dictionary, l_{e} is the number of distinct elements searched for since element e was last searched for and p(e) and s(e) are the predecessor and successor of e, respectively. The time-bounds are all worst-case. The dictionary stores the elements in an array of size n using "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5472","kind":"arxiv","version":3},"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":"1112.5472","created_at":"2026-05-18T03:51:48.658107+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.5472v3","created_at":"2026-05-18T03:51:48.658107+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5472","created_at":"2026-05-18T03:51:48.658107+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXFRNVHEKPWE","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXFRNVHEKPWE3QDU","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXFRNVHE","created_at":"2026-05-18T12:26:39.201973+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/QXFRNVHEKPWE3QDUR64BPE6JG5","json":"https://pith.science/pith/QXFRNVHEKPWE3QDUR64BPE6JG5.json","graph_json":"https://pith.science/api/pith-number/QXFRNVHEKPWE3QDUR64BPE6JG5/graph.json","events_json":"https://pith.science/api/pith-number/QXFRNVHEKPWE3QDUR64BPE6JG5/events.json","paper":"https://pith.science/paper/QXFRNVHE"},"agent_actions":{"view_html":"https://pith.science/pith/QXFRNVHEKPWE3QDUR64BPE6JG5","download_json":"https://pith.science/pith/QXFRNVHEKPWE3QDUR64BPE6JG5.json","view_paper":"https://pith.science/paper/QXFRNVHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.5472&json=true","fetch_graph":"https://pith.science/api/pith-number/QXFRNVHEKPWE3QDUR64BPE6JG5/graph.json","fetch_events":"https://pith.science/api/pith-number/QXFRNVHEKPWE3QDUR64BPE6JG5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXFRNVHEKPWE3QDUR64BPE6JG5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXFRNVHEKPWE3QDUR64BPE6JG5/action/storage_attestation","attest_author":"https://pith.science/pith/QXFRNVHEKPWE3QDUR64BPE6JG5/action/author_attestation","sign_citation":"https://pith.science/pith/QXFRNVHEKPWE3QDUR64BPE6JG5/action/citation_signature","submit_replication":"https://pith.science/pith/QXFRNVHEKPWE3QDUR64BPE6JG5/action/replication_record"}},"created_at":"2026-05-18T03:51:48.658107+00:00","updated_at":"2026-05-18T03:51:48.658107+00:00"}