{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CMGHVVQZDGNORZ7K7GYYKOSIAW","short_pith_number":"pith:CMGHVVQZ","schema_version":"1.0","canonical_sha256":"130c7ad619199ae8e7eaf9b1853a4805ac02e44a5520d9d1dff7ae9294ac20ed","source":{"kind":"arxiv","id":"1711.00808","version":1},"attestation_state":"computed","paper":{"title":"An Optimal Choice Dictionary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Torben Hagerup","submitted_at":"2017-11-02T16:39:24Z","abstract_excerpt":"A choice dictionary is a data structure that can be initialized with a parameter $n\\in\\{1,2,\\ldots\\}$ and subsequently maintains an initially empty subset $S$ of $\\{1,\\ldots,n\\}$ under insertion, deletion, membership queries and an operation '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 a second parameter $t\\in\\{1,2,\\ldots\\}$ in constant time and subsequently executes all operations in $O(t)$ time and occupies $n+O(n({t/w})^t+"},"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":"1711.00808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-02T16:39:24Z","cross_cats_sorted":[],"title_canon_sha256":"6eb3f600133714409192e1a078a6fd260542f95eb1477333e88d8c4bfb516ab7","abstract_canon_sha256":"fbc9da39a5303856a2de92d504519359a6d5611f53e0b192dc2c34d6954514e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:29.480164Z","signature_b64":"XOnFK2I3wA4lNxAGvZckOek0QTJunKmASBui/zl0j/OIbfJ/d4pNbjJTtT0TWn1vOIANH4VeGmZ7Z9gSajeHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"130c7ad619199ae8e7eaf9b1853a4805ac02e44a5520d9d1dff7ae9294ac20ed","last_reissued_at":"2026-05-18T00:31:29.479680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:29.479680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimal Choice Dictionary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Torben Hagerup","submitted_at":"2017-11-02T16:39:24Z","abstract_excerpt":"A choice dictionary is a data structure that can be initialized with a parameter $n\\in\\{1,2,\\ldots\\}$ and subsequently maintains an initially empty subset $S$ of $\\{1,\\ldots,n\\}$ under insertion, deletion, membership queries and an operation '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 a second parameter $t\\in\\{1,2,\\ldots\\}$ in constant time and subsequently executes all operations in $O(t)$ time and occupies $n+O(n({t/w})^t+"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00808","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":"1711.00808","created_at":"2026-05-18T00:31:29.479754+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00808v1","created_at":"2026-05-18T00:31:29.479754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00808","created_at":"2026-05-18T00:31:29.479754+00:00"},{"alias_kind":"pith_short_12","alias_value":"CMGHVVQZDGNO","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CMGHVVQZDGNORZ7K","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CMGHVVQZ","created_at":"2026-05-18T12:31:10.602751+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/CMGHVVQZDGNORZ7K7GYYKOSIAW","json":"https://pith.science/pith/CMGHVVQZDGNORZ7K7GYYKOSIAW.json","graph_json":"https://pith.science/api/pith-number/CMGHVVQZDGNORZ7K7GYYKOSIAW/graph.json","events_json":"https://pith.science/api/pith-number/CMGHVVQZDGNORZ7K7GYYKOSIAW/events.json","paper":"https://pith.science/paper/CMGHVVQZ"},"agent_actions":{"view_html":"https://pith.science/pith/CMGHVVQZDGNORZ7K7GYYKOSIAW","download_json":"https://pith.science/pith/CMGHVVQZDGNORZ7K7GYYKOSIAW.json","view_paper":"https://pith.science/paper/CMGHVVQZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00808&json=true","fetch_graph":"https://pith.science/api/pith-number/CMGHVVQZDGNORZ7K7GYYKOSIAW/graph.json","fetch_events":"https://pith.science/api/pith-number/CMGHVVQZDGNORZ7K7GYYKOSIAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CMGHVVQZDGNORZ7K7GYYKOSIAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CMGHVVQZDGNORZ7K7GYYKOSIAW/action/storage_attestation","attest_author":"https://pith.science/pith/CMGHVVQZDGNORZ7K7GYYKOSIAW/action/author_attestation","sign_citation":"https://pith.science/pith/CMGHVVQZDGNORZ7K7GYYKOSIAW/action/citation_signature","submit_replication":"https://pith.science/pith/CMGHVVQZDGNORZ7K7GYYKOSIAW/action/replication_record"}},"created_at":"2026-05-18T00:31:29.479754+00:00","updated_at":"2026-05-18T00:31:29.479754+00:00"}