{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TWMG72XMB7VDCASK5CCJEBOIVW","short_pith_number":"pith:TWMG72XM","schema_version":"1.0","canonical_sha256":"9d986feaec0fea31024ae8849205c8ad8c7f7bdb6ed03194f25068750511b6fb","source":{"kind":"arxiv","id":"1506.08620","version":3},"attestation_state":"computed","paper":{"title":"Fast and Vectorizable Alternative to Binary Search in O(1) Applicable to a Wide Domain of Sorted Arrays of Floating Point Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabio Cannizzo","submitted_at":"2015-06-29T13:44:21Z","abstract_excerpt":"Given an array $X$ of $N+1$ strictly ordered floating point numbers and a floating point number $z$ in the interval $[X_0,X_N)$, a common problem is to find the index $i$ of the interval $[X_{i},X_{i+1})$ containing $z$. This problem arises for instance in the context of spline interpolation or the computation of empirical probability distribution from empirical data. Often it needs to be solved for a large number of different values $z$ and the same array $X$, which makes it worth investing resources upfront in pre-processing the array $X$ with the goal of speeding up subsequent search operat"},"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":"1506.08620","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-29T13:44:21Z","cross_cats_sorted":[],"title_canon_sha256":"4cd1ced77be8eaeb30313f23aa052fddde2fecc45b44ef759bf5c8b3ef85cf9e","abstract_canon_sha256":"765c5bfcb46aa67602766ac799effad2bc76516795e4b8f642291d554e0d1074"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:15.846611Z","signature_b64":"thiwB96OYhxLTE3ERO2iYcDbdjtLN9XOocGXjDwduxDlK+dPNoP4nIdRY3f/8RngDEa2CUvaia0xS+NAn6jTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d986feaec0fea31024ae8849205c8ad8c7f7bdb6ed03194f25068750511b6fb","last_reissued_at":"2026-05-18T00:29:15.845927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:15.845927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Vectorizable Alternative to Binary Search in O(1) Applicable to a Wide Domain of Sorted Arrays of Floating Point Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabio Cannizzo","submitted_at":"2015-06-29T13:44:21Z","abstract_excerpt":"Given an array $X$ of $N+1$ strictly ordered floating point numbers and a floating point number $z$ in the interval $[X_0,X_N)$, a common problem is to find the index $i$ of the interval $[X_{i},X_{i+1})$ containing $z$. This problem arises for instance in the context of spline interpolation or the computation of empirical probability distribution from empirical data. Often it needs to be solved for a large number of different values $z$ and the same array $X$, which makes it worth investing resources upfront in pre-processing the array $X$ with the goal of speeding up subsequent search operat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08620","kind":"arxiv","version":3},"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":"1506.08620","created_at":"2026-05-18T00:29:15.846034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.08620v3","created_at":"2026-05-18T00:29:15.846034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08620","created_at":"2026-05-18T00:29:15.846034+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWMG72XMB7VD","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWMG72XMB7VDCASK","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWMG72XM","created_at":"2026-05-18T12:29:42.218222+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/TWMG72XMB7VDCASK5CCJEBOIVW","json":"https://pith.science/pith/TWMG72XMB7VDCASK5CCJEBOIVW.json","graph_json":"https://pith.science/api/pith-number/TWMG72XMB7VDCASK5CCJEBOIVW/graph.json","events_json":"https://pith.science/api/pith-number/TWMG72XMB7VDCASK5CCJEBOIVW/events.json","paper":"https://pith.science/paper/TWMG72XM"},"agent_actions":{"view_html":"https://pith.science/pith/TWMG72XMB7VDCASK5CCJEBOIVW","download_json":"https://pith.science/pith/TWMG72XMB7VDCASK5CCJEBOIVW.json","view_paper":"https://pith.science/paper/TWMG72XM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.08620&json=true","fetch_graph":"https://pith.science/api/pith-number/TWMG72XMB7VDCASK5CCJEBOIVW/graph.json","fetch_events":"https://pith.science/api/pith-number/TWMG72XMB7VDCASK5CCJEBOIVW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWMG72XMB7VDCASK5CCJEBOIVW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWMG72XMB7VDCASK5CCJEBOIVW/action/storage_attestation","attest_author":"https://pith.science/pith/TWMG72XMB7VDCASK5CCJEBOIVW/action/author_attestation","sign_citation":"https://pith.science/pith/TWMG72XMB7VDCASK5CCJEBOIVW/action/citation_signature","submit_replication":"https://pith.science/pith/TWMG72XMB7VDCASK5CCJEBOIVW/action/replication_record"}},"created_at":"2026-05-18T00:29:15.846034+00:00","updated_at":"2026-05-18T00:29:15.846034+00:00"}