{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OURTODK2AW36INFQFEW5QI2575","short_pith_number":"pith:OURTODK2","schema_version":"1.0","canonical_sha256":"7523370d5a05b7e434b0292dd8235dff577b7d256921653119deae1d1027993b","source":{"kind":"arxiv","id":"1809.07661","version":1},"attestation_state":"computed","paper":{"title":"Small Uncolored and Colored Choice Dictionaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Torben Hagerup","submitted_at":"2018-09-20T14:57:04Z","abstract_excerpt":"A choice dictionary can be initialized with a parameter $n\\in\\mathbb{N}$ and subsequently maintains an initially empty subset $S$ of $\\{1,\\ldots,n\\}$ under insertion, deletion, membership queries and an operation $\\textit{choice}$ that returns an arbitrary element of $S$. The choice dictionary is fundamental in space-efficient computing and has numerous applications. The best previous choice dictionary can be initialized with $n$ and $t\\in\\mathbb{N}$ and subsequently executes all operations in $O(t)$ time and occupies $n+O(n({t/w})^t+\\log n)$ bits on a word RAM with a word length of $w=\\Omega("},"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":"1809.07661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-20T14:57:04Z","cross_cats_sorted":[],"title_canon_sha256":"ae5631b52f274d7049a44407deb8a0c1ca51beede6aca83cd0485927606cb22f","abstract_canon_sha256":"b2e75e14232376890600116af69072d7b37cd9d76ad7be4508b6827f58013e49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:15.588778Z","signature_b64":"quZ07zusBzWnOVKtbXpc6fF326J84BTSO892A7RtpC1jnJXQj8SsgYG1z9uFRkj8c2rIk3AuegIxGFXnZcguBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7523370d5a05b7e434b0292dd8235dff577b7d256921653119deae1d1027993b","last_reissued_at":"2026-05-18T00:05:15.588270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:15.588270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Small Uncolored and Colored Choice Dictionaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Torben Hagerup","submitted_at":"2018-09-20T14:57:04Z","abstract_excerpt":"A choice dictionary can be initialized with a parameter $n\\in\\mathbb{N}$ and subsequently maintains an initially empty subset $S$ of $\\{1,\\ldots,n\\}$ under insertion, deletion, membership queries and an operation $\\textit{choice}$ that returns an arbitrary element of $S$. The choice dictionary is fundamental in space-efficient computing and has numerous applications. The best previous choice dictionary can be initialized with $n$ and $t\\in\\mathbb{N}$ and subsequently executes all operations in $O(t)$ time and occupies $n+O(n({t/w})^t+\\log n)$ bits on a word RAM with a word length of $w=\\Omega("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07661","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":"1809.07661","created_at":"2026-05-18T00:05:15.588359+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.07661v1","created_at":"2026-05-18T00:05:15.588359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07661","created_at":"2026-05-18T00:05:15.588359+00:00"},{"alias_kind":"pith_short_12","alias_value":"OURTODK2AW36","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OURTODK2AW36INFQ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OURTODK2","created_at":"2026-05-18T12:32:43.782077+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/OURTODK2AW36INFQFEW5QI2575","json":"https://pith.science/pith/OURTODK2AW36INFQFEW5QI2575.json","graph_json":"https://pith.science/api/pith-number/OURTODK2AW36INFQFEW5QI2575/graph.json","events_json":"https://pith.science/api/pith-number/OURTODK2AW36INFQFEW5QI2575/events.json","paper":"https://pith.science/paper/OURTODK2"},"agent_actions":{"view_html":"https://pith.science/pith/OURTODK2AW36INFQFEW5QI2575","download_json":"https://pith.science/pith/OURTODK2AW36INFQFEW5QI2575.json","view_paper":"https://pith.science/paper/OURTODK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.07661&json=true","fetch_graph":"https://pith.science/api/pith-number/OURTODK2AW36INFQFEW5QI2575/graph.json","fetch_events":"https://pith.science/api/pith-number/OURTODK2AW36INFQFEW5QI2575/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OURTODK2AW36INFQFEW5QI2575/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OURTODK2AW36INFQFEW5QI2575/action/storage_attestation","attest_author":"https://pith.science/pith/OURTODK2AW36INFQFEW5QI2575/action/author_attestation","sign_citation":"https://pith.science/pith/OURTODK2AW36INFQFEW5QI2575/action/citation_signature","submit_replication":"https://pith.science/pith/OURTODK2AW36INFQFEW5QI2575/action/replication_record"}},"created_at":"2026-05-18T00:05:15.588359+00:00","updated_at":"2026-05-18T00:05:15.588359+00:00"}