{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VHZDD65Y4QH2ABKVWE6PUJBVMF","short_pith_number":"pith:VHZDD65Y","canonical_record":{"source":{"id":"1709.02377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-07T17:53:44Z","cross_cats_sorted":[],"title_canon_sha256":"cce048f083800689bb10325a7a32e1e4d5ae253fff4652b750890ab8e9429405","abstract_canon_sha256":"9709bc7a3940df574bc5e2eeff50c6b1fc244d1f6825ae246a0d1b429e328a1b"},"schema_version":"1.0"},"canonical_sha256":"a9f231fbb8e40fa00555b13cfa24356161b5340f0a8cce851de7c4e57c44ca30","source":{"kind":"arxiv","id":"1709.02377","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02377","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02377v1","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02377","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"pith_short_12","alias_value":"VHZDD65Y4QH2","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VHZDD65Y4QH2ABKV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VHZDD65Y","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VHZDD65Y4QH2ABKVWE6PUJBVMF","target":"record","payload":{"canonical_record":{"source":{"id":"1709.02377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-07T17:53:44Z","cross_cats_sorted":[],"title_canon_sha256":"cce048f083800689bb10325a7a32e1e4d5ae253fff4652b750890ab8e9429405","abstract_canon_sha256":"9709bc7a3940df574bc5e2eeff50c6b1fc244d1f6825ae246a0d1b429e328a1b"},"schema_version":"1.0"},"canonical_sha256":"a9f231fbb8e40fa00555b13cfa24356161b5340f0a8cce851de7c4e57c44ca30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:49.381719Z","signature_b64":"5T3BmaHGRu89Ldnj7DQscLStagfJS/EV8hprhk5HVOzfJ22A/x7p+SlezIdvLmL1dcIltFBIozciTZdA3bR9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9f231fbb8e40fa00555b13cfa24356161b5340f0a8cce851de7c4e57c44ca30","last_reissued_at":"2026-05-18T00:35:49.380893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:49.380893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.02377","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:35:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sTLweONMRjDaXrJOraaPCOHBjViySNP1H1wzFh85dIHT6scSH/g96wSQgHCdKPLYqMwVZjXjXTHTm9Q17SVCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:23:44.661861Z"},"content_sha256":"8f840517362db02e04a22ac5b3535b80152f4b4a221cccc3c36beb973007658e","schema_version":"1.0","event_id":"sha256:8f840517362db02e04a22ac5b3535b80152f4b4a221cccc3c36beb973007658e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VHZDD65Y4QH2ABKVWE6PUJBVMF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rank-Select Indices Without Tears","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tim Baumann, Torben Hagerup","submitted_at":"2017-09-07T17:53:44Z","abstract_excerpt":"A rank-select index for a sequence $B=(b_1,\\ldots,b_n)$ of $n$ bits is a data structure that, if provided with an operation to access $\\Theta(\\log n)$ arbitrary consecutive bits of $B$ in constant time (thus $B$ is stored outside of the data structure), can compute $\\mathit{rank}_B(j)=\\sum_{i=1}^j b_i$ for given $j\\in\\{0,\\ldots,n\\}$ and $\\mathit{select}_B(k)=\\min\\{j:\\mathit{rank}_B(j)\\ge k\\}$ for given $k\\in\\{1,\\ldots,\\sum_{i=1}^n b_i\\}$. We describe a new rank-select index that, like previous rank-select indices, occupies $O(n\\log\\log n/\\log n)$ bits and executes $\\mathit{rank}$ and $\\mathit{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02377","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:35:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JRczFPBFLrAMY1ESTvMYnBfQd06kL3lvS1cwXoeDhOlWbx9WUmtpKAuSSW9urXbcLsUp6MMPdkfe2KGlSBkZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:23:44.662519Z"},"content_sha256":"afe7807680ea0149ff3c34a3c496342c26ba3ecb1b8ffe0f9de03595c2d1fe2e","schema_version":"1.0","event_id":"sha256:afe7807680ea0149ff3c34a3c496342c26ba3ecb1b8ffe0f9de03595c2d1fe2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHZDD65Y4QH2ABKVWE6PUJBVMF/bundle.json","state_url":"https://pith.science/pith/VHZDD65Y4QH2ABKVWE6PUJBVMF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHZDD65Y4QH2ABKVWE6PUJBVMF/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-06T17:23:44Z","links":{"resolver":"https://pith.science/pith/VHZDD65Y4QH2ABKVWE6PUJBVMF","bundle":"https://pith.science/pith/VHZDD65Y4QH2ABKVWE6PUJBVMF/bundle.json","state":"https://pith.science/pith/VHZDD65Y4QH2ABKVWE6PUJBVMF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHZDD65Y4QH2ABKVWE6PUJBVMF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VHZDD65Y4QH2ABKVWE6PUJBVMF","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":"9709bc7a3940df574bc5e2eeff50c6b1fc244d1f6825ae246a0d1b429e328a1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-07T17:53:44Z","title_canon_sha256":"cce048f083800689bb10325a7a32e1e4d5ae253fff4652b750890ab8e9429405"},"schema_version":"1.0","source":{"id":"1709.02377","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02377","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02377v1","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02377","created_at":"2026-05-18T00:35:49Z"},{"alias_kind":"pith_short_12","alias_value":"VHZDD65Y4QH2","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VHZDD65Y4QH2ABKV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VHZDD65Y","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:afe7807680ea0149ff3c34a3c496342c26ba3ecb1b8ffe0f9de03595c2d1fe2e","target":"graph","created_at":"2026-05-18T00:35:49Z","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 rank-select index for a sequence $B=(b_1,\\ldots,b_n)$ of $n$ bits is a data structure that, if provided with an operation to access $\\Theta(\\log n)$ arbitrary consecutive bits of $B$ in constant time (thus $B$ is stored outside of the data structure), can compute $\\mathit{rank}_B(j)=\\sum_{i=1}^j b_i$ for given $j\\in\\{0,\\ldots,n\\}$ and $\\mathit{select}_B(k)=\\min\\{j:\\mathit{rank}_B(j)\\ge k\\}$ for given $k\\in\\{1,\\ldots,\\sum_{i=1}^n b_i\\}$. We describe a new rank-select index that, like previous rank-select indices, occupies $O(n\\log\\log n/\\log n)$ bits and executes $\\mathit{rank}$ and $\\mathit{","authors_text":"Tim Baumann, Torben Hagerup","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-07T17:53:44Z","title":"Rank-Select Indices Without Tears"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02377","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:8f840517362db02e04a22ac5b3535b80152f4b4a221cccc3c36beb973007658e","target":"record","created_at":"2026-05-18T00:35:49Z","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":"9709bc7a3940df574bc5e2eeff50c6b1fc244d1f6825ae246a0d1b429e328a1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-07T17:53:44Z","title_canon_sha256":"cce048f083800689bb10325a7a32e1e4d5ae253fff4652b750890ab8e9429405"},"schema_version":"1.0","source":{"id":"1709.02377","kind":"arxiv","version":1}},"canonical_sha256":"a9f231fbb8e40fa00555b13cfa24356161b5340f0a8cce851de7c4e57c44ca30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9f231fbb8e40fa00555b13cfa24356161b5340f0a8cce851de7c4e57c44ca30","first_computed_at":"2026-05-18T00:35:49.380893Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:49.380893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5T3BmaHGRu89Ldnj7DQscLStagfJS/EV8hprhk5HVOzfJ22A/x7p+SlezIdvLmL1dcIltFBIozciTZdA3bR9AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:49.381719Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.02377","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f840517362db02e04a22ac5b3535b80152f4b4a221cccc3c36beb973007658e","sha256:afe7807680ea0149ff3c34a3c496342c26ba3ecb1b8ffe0f9de03595c2d1fe2e"],"state_sha256":"4f4dffb02ea0d38922108f192dfce4eef2932b0523969ca7f084d0549f411de8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yK1kUAHlPNdpxYjva0ylAUQxDlMP8nVMbstkJyWNjhpOh31D2J6SkgBcUkCZbHQYJ/iwcJRwxagTjnxJL74pAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T17:23:44.666922Z","bundle_sha256":"255b103752fb73809221f28219273532f9f44cde8102b77aa6e6835f8790e779"}}