{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:M7E3BPSCWAIWAX7CY5L5BGX52V","short_pith_number":"pith:M7E3BPSC","schema_version":"1.0","canonical_sha256":"67c9b0be42b011605fe2c757d09afdd5618fbe92a9f11a7c02b0cc6f7c8a0341","source":{"kind":"arxiv","id":"1509.05053","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.05053","created_at":"2026-05-18T00:48:43.162498+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05053v2","created_at":"2026-05-18T00:48:43.162498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05053","created_at":"2026-05-18T00:48:43.162498+00:00"},{"alias_kind":"pith_short_12","alias_value":"M7E3BPSCWAIW","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"M7E3BPSCWAIWAX7C","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"M7E3BPSC","created_at":"2026-05-18T12:29:32.376354+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/M7E3BPSCWAIWAX7CY5L5BGX52V","json":"https://pith.science/pith/M7E3BPSCWAIWAX7CY5L5BGX52V.json","graph_json":"https://pith.science/api/pith-number/M7E3BPSCWAIWAX7CY5L5BGX52V/graph.json","events_json":"https://pith.science/api/pith-number/M7E3BPSCWAIWAX7CY5L5BGX52V/events.json","paper":"https://pith.science/paper/M7E3BPSC"},"agent_actions":{"view_html":"https://pith.science/pith/M7E3BPSCWAIWAX7CY5L5BGX52V","download_json":"https://pith.science/pith/M7E3BPSCWAIWAX7CY5L5BGX52V.json","view_paper":"https://pith.science/paper/M7E3BPSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05053&json=true","fetch_graph":"https://pith.science/api/pith-number/M7E3BPSCWAIWAX7CY5L5BGX52V/graph.json","fetch_events":"https://pith.science/api/pith-number/M7E3BPSCWAIWAX7CY5L5BGX52V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M7E3BPSCWAIWAX7CY5L5BGX52V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M7E3BPSCWAIWAX7CY5L5BGX52V/action/storage_attestation","attest_author":"https://pith.science/pith/M7E3BPSCWAIWAX7CY5L5BGX52V/action/author_attestation","sign_citation":"https://pith.science/pith/M7E3BPSCWAIWAX7CY5L5BGX52V/action/citation_signature","submit_replication":"https://pith.science/pith/M7E3BPSCWAIWAX7CY5L5BGX52V/action/replication_record"}},"created_at":"2026-05-18T00:48:43.162498+00:00","updated_at":"2026-05-18T00:48:43.162498+00:00"}