{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OBG6NHDPMZLBBO5GX62MSRXW42","short_pith_number":"pith:OBG6NHDP","canonical_record":{"source":{"id":"1706.00990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-03T18:52:57Z","cross_cats_sorted":[],"title_canon_sha256":"8073a0d1c41bd53a1512fa1ec8eabb0fc99ae6e8e8110188d3224b6dfc2b8ef3","abstract_canon_sha256":"754996c76f8ab96d73d2d6ebb93e1dd56caee0e80636d78ca7196dcad4949e6b"},"schema_version":"1.0"},"canonical_sha256":"704de69c6f665610bba6bfb4c946f6e6b9478eb63627a2d5a5b90d4489d6c4f0","source":{"kind":"arxiv","id":"1706.00990","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00990","created_at":"2026-05-18T00:43:07Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00990v1","created_at":"2026-05-18T00:43:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00990","created_at":"2026-05-18T00:43:07Z"},{"alias_kind":"pith_short_12","alias_value":"OBG6NHDPMZLB","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OBG6NHDPMZLBBO5G","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OBG6NHDP","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OBG6NHDPMZLBBO5GX62MSRXW42","target":"record","payload":{"canonical_record":{"source":{"id":"1706.00990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-03T18:52:57Z","cross_cats_sorted":[],"title_canon_sha256":"8073a0d1c41bd53a1512fa1ec8eabb0fc99ae6e8e8110188d3224b6dfc2b8ef3","abstract_canon_sha256":"754996c76f8ab96d73d2d6ebb93e1dd56caee0e80636d78ca7196dcad4949e6b"},"schema_version":"1.0"},"canonical_sha256":"704de69c6f665610bba6bfb4c946f6e6b9478eb63627a2d5a5b90d4489d6c4f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:07.141840Z","signature_b64":"PS2/+4/G85B8vmPLfKU8VXhObN8Tb2bWFDNBE56tS9QDMkes6dS5V9g3yYLrG2AVoAHhmtKQjZpizlfPigX4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"704de69c6f665610bba6bfb4c946f6e6b9478eb63627a2d5a5b90d4489d6c4f0","last_reissued_at":"2026-05-18T00:43:07.141028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:07.141028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.00990","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:43:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ya3MXYR1S1LimNuILGHec0Z9hPTbUa2np4kLBCWikGdjInQSOdUqVdU8eY208vMmu8KSJntUd+R8dOjBqOvgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:50:47.060891Z"},"content_sha256":"b2adabbc31fc2860611943f1fc8bc68cbfdbcbe94089477dbf3d0e101476693a","schema_version":"1.0","event_id":"sha256:b2adabbc31fc2860611943f1fc8bc68cbfdbcbe94089477dbf3d0e101476693a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OBG6NHDPMZLBBO5GX62MSRXW42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast x86 Implementation of Select","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael A. Bender, Prashant Pandey, Rob Johnson","submitted_at":"2017-06-03T18:52:57Z","abstract_excerpt":"Rank and select are fundamental operations in succinct data structures, that is, data structures whose space consumption approaches the information-theoretic optimal. The performance of these primitives is central to the overall performance of succinct data structures.\n  Traditionally, the select operation is the harder to implement efficiently, and most prior implementations of select on machine words use 50--80 machine instructions. (In contrast, rank on machine words can be implemented in only a handful of instructions on machines that support POPCOUNT.) However, recently Pandey et al. gave"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00990","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:43:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d3jA+xXYuXYzpzEi3L2U/5zmcuALwrBZfhfW/c3NpAEgZVVDg+V+a6y4vNT4wHQWyFY1JFh9E3VSUp0/+/62CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:50:47.061263Z"},"content_sha256":"2c46d96ba4f7628da9d36bedb6bbd79f366722a86e7c9cc61c76cbfa4d4ea161","schema_version":"1.0","event_id":"sha256:2c46d96ba4f7628da9d36bedb6bbd79f366722a86e7c9cc61c76cbfa4d4ea161"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OBG6NHDPMZLBBO5GX62MSRXW42/bundle.json","state_url":"https://pith.science/pith/OBG6NHDPMZLBBO5GX62MSRXW42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OBG6NHDPMZLBBO5GX62MSRXW42/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-05-27T15:50:47Z","links":{"resolver":"https://pith.science/pith/OBG6NHDPMZLBBO5GX62MSRXW42","bundle":"https://pith.science/pith/OBG6NHDPMZLBBO5GX62MSRXW42/bundle.json","state":"https://pith.science/pith/OBG6NHDPMZLBBO5GX62MSRXW42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OBG6NHDPMZLBBO5GX62MSRXW42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OBG6NHDPMZLBBO5GX62MSRXW42","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":"754996c76f8ab96d73d2d6ebb93e1dd56caee0e80636d78ca7196dcad4949e6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-03T18:52:57Z","title_canon_sha256":"8073a0d1c41bd53a1512fa1ec8eabb0fc99ae6e8e8110188d3224b6dfc2b8ef3"},"schema_version":"1.0","source":{"id":"1706.00990","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00990","created_at":"2026-05-18T00:43:07Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00990v1","created_at":"2026-05-18T00:43:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00990","created_at":"2026-05-18T00:43:07Z"},{"alias_kind":"pith_short_12","alias_value":"OBG6NHDPMZLB","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OBG6NHDPMZLBBO5G","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OBG6NHDP","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:2c46d96ba4f7628da9d36bedb6bbd79f366722a86e7c9cc61c76cbfa4d4ea161","target":"graph","created_at":"2026-05-18T00:43:07Z","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":"Rank and select are fundamental operations in succinct data structures, that is, data structures whose space consumption approaches the information-theoretic optimal. The performance of these primitives is central to the overall performance of succinct data structures.\n  Traditionally, the select operation is the harder to implement efficiently, and most prior implementations of select on machine words use 50--80 machine instructions. (In contrast, rank on machine words can be implemented in only a handful of instructions on machines that support POPCOUNT.) However, recently Pandey et al. gave","authors_text":"Michael A. Bender, Prashant Pandey, Rob Johnson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-03T18:52:57Z","title":"A Fast x86 Implementation of Select"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00990","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:b2adabbc31fc2860611943f1fc8bc68cbfdbcbe94089477dbf3d0e101476693a","target":"record","created_at":"2026-05-18T00:43:07Z","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":"754996c76f8ab96d73d2d6ebb93e1dd56caee0e80636d78ca7196dcad4949e6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-03T18:52:57Z","title_canon_sha256":"8073a0d1c41bd53a1512fa1ec8eabb0fc99ae6e8e8110188d3224b6dfc2b8ef3"},"schema_version":"1.0","source":{"id":"1706.00990","kind":"arxiv","version":1}},"canonical_sha256":"704de69c6f665610bba6bfb4c946f6e6b9478eb63627a2d5a5b90d4489d6c4f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"704de69c6f665610bba6bfb4c946f6e6b9478eb63627a2d5a5b90d4489d6c4f0","first_computed_at":"2026-05-18T00:43:07.141028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:07.141028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PS2/+4/G85B8vmPLfKU8VXhObN8Tb2bWFDNBE56tS9QDMkes6dS5V9g3yYLrG2AVoAHhmtKQjZpizlfPigX4BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:07.141840Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.00990","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2adabbc31fc2860611943f1fc8bc68cbfdbcbe94089477dbf3d0e101476693a","sha256:2c46d96ba4f7628da9d36bedb6bbd79f366722a86e7c9cc61c76cbfa4d4ea161"],"state_sha256":"d8220a9c6673da1ba28020fafbacfc7d074ccb556959573735e72c4e8969ed09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X7LcPhky1N113fcH7/s0HC+Dr9aM1m8SFiJoKwPtNC03e9506F5UL139e0QRKydaT7eOPgDbmvWKqHqBX6wSCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:50:47.063568Z","bundle_sha256":"95ea20599a90c28abe252d61a29d58f16ae5f92353b9af0b5a60695db2ab34ea"}}