{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CMGHVVQZDGNORZ7K7GYYKOSIAW","short_pith_number":"pith:CMGHVVQZ","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"},"canonical_sha256":"130c7ad619199ae8e7eaf9b1853a4805ac02e44a5520d9d1dff7ae9294ac20ed","source":{"kind":"arxiv","id":"1711.00808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00808","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00808v1","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00808","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"pith_short_12","alias_value":"CMGHVVQZDGNO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CMGHVVQZDGNORZ7K","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CMGHVVQZ","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CMGHVVQZDGNORZ7K7GYYKOSIAW","target":"record","payload":{"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"},"canonical_sha256":"130c7ad619199ae8e7eaf9b1853a4805ac02e44a5520d9d1dff7ae9294ac20ed","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"},"source_kind":"arxiv","source_id":"1711.00808","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:31:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Tt6Dx3MiFpNnZinWGJxpkSTvPohsPSmeKxs3VZAyqaKqJTWWGyIVtH7FQiA8EkL0DGaBSsOr+KIb2DgIdIKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:54:44.424817Z"},"content_sha256":"38421e45831500c4e0e26e76ecfbe3d722b41b5d3d85d6b103b74214fb673aeb","schema_version":"1.0","event_id":"sha256:38421e45831500c4e0e26e76ecfbe3d722b41b5d3d85d6b103b74214fb673aeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CMGHVVQZDGNORZ7K7GYYKOSIAW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:31:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gqSuODU+lLcicflEjC44M9NPkZnTCFzTWDmuVOHJLAvZpqobeuteM3+MHDvHKL6w3PnoM41U5cS5ZCKjZhr2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:54:44.425505Z"},"content_sha256":"d8ca411e0329852302e02d44b4dd432bbe62c36bd55eb1a9426b313f9a9144f7","schema_version":"1.0","event_id":"sha256:d8ca411e0329852302e02d44b4dd432bbe62c36bd55eb1a9426b313f9a9144f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CMGHVVQZDGNORZ7K7GYYKOSIAW/bundle.json","state_url":"https://pith.science/pith/CMGHVVQZDGNORZ7K7GYYKOSIAW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CMGHVVQZDGNORZ7K7GYYKOSIAW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T19:54:44Z","links":{"resolver":"https://pith.science/pith/CMGHVVQZDGNORZ7K7GYYKOSIAW","bundle":"https://pith.science/pith/CMGHVVQZDGNORZ7K7GYYKOSIAW/bundle.json","state":"https://pith.science/pith/CMGHVVQZDGNORZ7K7GYYKOSIAW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CMGHVVQZDGNORZ7K7GYYKOSIAW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CMGHVVQZDGNORZ7K7GYYKOSIAW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fbc9da39a5303856a2de92d504519359a6d5611f53e0b192dc2c34d6954514e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-02T16:39:24Z","title_canon_sha256":"6eb3f600133714409192e1a078a6fd260542f95eb1477333e88d8c4bfb516ab7"},"schema_version":"1.0","source":{"id":"1711.00808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00808","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00808v1","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00808","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"pith_short_12","alias_value":"CMGHVVQZDGNO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CMGHVVQZDGNORZ7K","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CMGHVVQZ","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:d8ca411e0329852302e02d44b4dd432bbe62c36bd55eb1a9426b313f9a9144f7","target":"graph","created_at":"2026-05-18T00:31:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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+","authors_text":"Torben Hagerup","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-02T16:39:24Z","title":"An Optimal Choice Dictionary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00808","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:38421e45831500c4e0e26e76ecfbe3d722b41b5d3d85d6b103b74214fb673aeb","target":"record","created_at":"2026-05-18T00:31:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fbc9da39a5303856a2de92d504519359a6d5611f53e0b192dc2c34d6954514e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-02T16:39:24Z","title_canon_sha256":"6eb3f600133714409192e1a078a6fd260542f95eb1477333e88d8c4bfb516ab7"},"schema_version":"1.0","source":{"id":"1711.00808","kind":"arxiv","version":1}},"canonical_sha256":"130c7ad619199ae8e7eaf9b1853a4805ac02e44a5520d9d1dff7ae9294ac20ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"130c7ad619199ae8e7eaf9b1853a4805ac02e44a5520d9d1dff7ae9294ac20ed","first_computed_at":"2026-05-18T00:31:29.479680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:29.479680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XOnFK2I3wA4lNxAGvZckOek0QTJunKmASBui/zl0j/OIbfJ/d4pNbjJTtT0TWn1vOIANH4VeGmZ7Z9gSajeHAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:29.480164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38421e45831500c4e0e26e76ecfbe3d722b41b5d3d85d6b103b74214fb673aeb","sha256:d8ca411e0329852302e02d44b4dd432bbe62c36bd55eb1a9426b313f9a9144f7"],"state_sha256":"5e67c446e846e1e7a500bef45a5b9ab99f4a6de3de6d426b464bbaef524172cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q4NHZOGhcCN8Arw9lPYG2YdL0/MSiZ3A5+HSN29bDyjoorN4jzOXaDA5m/HaGM6Xs+9qxvYG/GFhLJym5JiqBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:54:44.429123Z","bundle_sha256":"b72064cb2e1d75587a6390c7b66252fc87d1cd5e6342c7a1acab1e8bd6afc61d"}}