{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:M7E3BPSCWAIWAX7CY5L5BGX52V","short_pith_number":"pith:M7E3BPSC","canonical_record":{"source":{"id":"1509.05053","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-16T20:20:47Z","cross_cats_sorted":[],"title_canon_sha256":"217f21b16ebde64c8d29b65d5318552861fd9ed2cb19d7dd8d6a08c1df590e99","abstract_canon_sha256":"8cead9c11c54d51ee1191389d264e4bacbd25802c9f1953dbb4367fb438bf5ad"},"schema_version":"1.0"},"canonical_sha256":"67c9b0be42b011605fe2c757d09afdd5618fbe92a9f11a7c02b0cc6f7c8a0341","source":{"kind":"arxiv","id":"1509.05053","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05053","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05053v2","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05053","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"M7E3BPSCWAIW","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"M7E3BPSCWAIWAX7C","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"M7E3BPSC","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:M7E3BPSCWAIWAX7CY5L5BGX52V","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05053","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-16T20:20:47Z","cross_cats_sorted":[],"title_canon_sha256":"217f21b16ebde64c8d29b65d5318552861fd9ed2cb19d7dd8d6a08c1df590e99","abstract_canon_sha256":"8cead9c11c54d51ee1191389d264e4bacbd25802c9f1953dbb4367fb438bf5ad"},"schema_version":"1.0"},"canonical_sha256":"67c9b0be42b011605fe2c757d09afdd5618fbe92a9f11a7c02b0cc6f7c8a0341","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:43.162972Z","signature_b64":"JtmZrAB08QKxYHHzkYb+HYnAh6+kJqeuaXxmsl7KSIYG5JbcbgUYuguimubSKdCiQMZE9oJpuGIzrjzMrEAkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67c9b0be42b011605fe2c757d09afdd5618fbe92a9f11a7c02b0cc6f7c8a0341","last_reissued_at":"2026-05-18T00:48:43.162414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:43.162414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05053","source_version":2,"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:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z19G5hV427kNnDhZ82kihN99efnlAbrDdHp2D0rMOggfO1rLWRTKxRNuXEidKT5MFJ/u3daEOztw2YG1B7S2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:53:23.966679Z"},"content_sha256":"da2e6903867c3e785a8b5ff51b649fdefc8113645b24c897cebfb42683731feb","schema_version":"1.0","event_id":"sha256:da2e6903867c3e785a8b5ff51b649fdefc8113645b24c897cebfb42683731feb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:M7E3BPSCWAIWAX7CY5L5BGX52V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Array Layouts for Comparison-Based Searching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pat Morin, Paul-Virak Khuong","submitted_at":"2015-09-16T20:20:47Z","abstract_excerpt":"We attempt to determine the best order and search algorithm to store $n$ comparable data items in an array, $A$, of length $n$ so that we can, for any query value, $x$, quickly find the smallest value in $A$ that is greater than or equal to $x$. In particular, we consider the important case where there are many such queries to the same array, $A$, which resides entirely in RAM. In addition to the obvious sorted order/binary search combination we consider the Eytzinger (BFS) layout normally used for heaps, an implicit B-tree layout that generalizes the Eytzinger layout, and the van Emde Boas la"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05053","kind":"arxiv","version":2},"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:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RnPJkqR87vN4N8wEAZ7VRpH+bi5YaLo7t/pgtU7JBM4rYRoiGSeXwB+FVENMarA9hmNR7jW6f5xTtgRnxaszBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:53:23.967084Z"},"content_sha256":"6ba78fa0cda2f4f605d4c96fa2ae5188f5b47c57a6fdffa33ade2f78b12514b5","schema_version":"1.0","event_id":"sha256:6ba78fa0cda2f4f605d4c96fa2ae5188f5b47c57a6fdffa33ade2f78b12514b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M7E3BPSCWAIWAX7CY5L5BGX52V/bundle.json","state_url":"https://pith.science/pith/M7E3BPSCWAIWAX7CY5L5BGX52V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M7E3BPSCWAIWAX7CY5L5BGX52V/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-10T07:53:23Z","links":{"resolver":"https://pith.science/pith/M7E3BPSCWAIWAX7CY5L5BGX52V","bundle":"https://pith.science/pith/M7E3BPSCWAIWAX7CY5L5BGX52V/bundle.json","state":"https://pith.science/pith/M7E3BPSCWAIWAX7CY5L5BGX52V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M7E3BPSCWAIWAX7CY5L5BGX52V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:M7E3BPSCWAIWAX7CY5L5BGX52V","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":"8cead9c11c54d51ee1191389d264e4bacbd25802c9f1953dbb4367fb438bf5ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-16T20:20:47Z","title_canon_sha256":"217f21b16ebde64c8d29b65d5318552861fd9ed2cb19d7dd8d6a08c1df590e99"},"schema_version":"1.0","source":{"id":"1509.05053","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05053","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05053v2","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05053","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"M7E3BPSCWAIW","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"M7E3BPSCWAIWAX7C","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"M7E3BPSC","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:6ba78fa0cda2f4f605d4c96fa2ae5188f5b47c57a6fdffa33ade2f78b12514b5","target":"graph","created_at":"2026-05-18T00:48:43Z","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":"We attempt to determine the best order and search algorithm to store $n$ comparable data items in an array, $A$, of length $n$ so that we can, for any query value, $x$, quickly find the smallest value in $A$ that is greater than or equal to $x$. In particular, we consider the important case where there are many such queries to the same array, $A$, which resides entirely in RAM. In addition to the obvious sorted order/binary search combination we consider the Eytzinger (BFS) layout normally used for heaps, an implicit B-tree layout that generalizes the Eytzinger layout, and the van Emde Boas la","authors_text":"Pat Morin, Paul-Virak Khuong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-16T20:20:47Z","title":"Array Layouts for Comparison-Based Searching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05053","kind":"arxiv","version":2},"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:da2e6903867c3e785a8b5ff51b649fdefc8113645b24c897cebfb42683731feb","target":"record","created_at":"2026-05-18T00:48:43Z","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":"8cead9c11c54d51ee1191389d264e4bacbd25802c9f1953dbb4367fb438bf5ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-16T20:20:47Z","title_canon_sha256":"217f21b16ebde64c8d29b65d5318552861fd9ed2cb19d7dd8d6a08c1df590e99"},"schema_version":"1.0","source":{"id":"1509.05053","kind":"arxiv","version":2}},"canonical_sha256":"67c9b0be42b011605fe2c757d09afdd5618fbe92a9f11a7c02b0cc6f7c8a0341","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67c9b0be42b011605fe2c757d09afdd5618fbe92a9f11a7c02b0cc6f7c8a0341","first_computed_at":"2026-05-18T00:48:43.162414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:43.162414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JtmZrAB08QKxYHHzkYb+HYnAh6+kJqeuaXxmsl7KSIYG5JbcbgUYuguimubSKdCiQMZE9oJpuGIzrjzMrEAkCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:43.162972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05053","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da2e6903867c3e785a8b5ff51b649fdefc8113645b24c897cebfb42683731feb","sha256:6ba78fa0cda2f4f605d4c96fa2ae5188f5b47c57a6fdffa33ade2f78b12514b5"],"state_sha256":"ebca8a3488257915543ee2fa7b81ba4de2bf1bd1245ede5540e07595a15c7126"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gomq/NS5tKbDyfP20xoZtXu0XPpWjJmMUg+8uQGYjJQkS3ZeQGwRzhkBiehfHldGQX5YG5e5RbXYKBl6EWFwCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T07:53:23.970884Z","bundle_sha256":"575da46f1536b30e6a4bfb3069ef76f63cd9891726f17fbdd3009eb5f98935b2"}}