{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:I6AODSD6YSUAY273MYBLUIHPLG","short_pith_number":"pith:I6AODSD6","canonical_record":{"source":{"id":"2112.03229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-12-06T18:38:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3f166e74d3d4f420c870968b6b46d1caa69eed7f7a92ad64fa330ee8167a49c2","abstract_canon_sha256":"4150846ff8fda321bdf24106839e4e2d28a6f5b397d50cf80f453ff8dcb024da"},"schema_version":"1.0"},"canonical_sha256":"4780e1c87ec4a80c6bfb6602ba20ef59abe4e3cb2a05211e3c99da67a996c644","source":{"kind":"arxiv","id":"2112.03229","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.03229","created_at":"2026-07-05T03:39:04Z"},{"alias_kind":"arxiv_version","alias_value":"2112.03229v1","created_at":"2026-07-05T03:39:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.03229","created_at":"2026-07-05T03:39:04Z"},{"alias_kind":"pith_short_12","alias_value":"I6AODSD6YSUA","created_at":"2026-07-05T03:39:04Z"},{"alias_kind":"pith_short_16","alias_value":"I6AODSD6YSUAY273","created_at":"2026-07-05T03:39:04Z"},{"alias_kind":"pith_short_8","alias_value":"I6AODSD6","created_at":"2026-07-05T03:39:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:I6AODSD6YSUAY273MYBLUIHPLG","target":"record","payload":{"canonical_record":{"source":{"id":"2112.03229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-12-06T18:38:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3f166e74d3d4f420c870968b6b46d1caa69eed7f7a92ad64fa330ee8167a49c2","abstract_canon_sha256":"4150846ff8fda321bdf24106839e4e2d28a6f5b397d50cf80f453ff8dcb024da"},"schema_version":"1.0"},"canonical_sha256":"4780e1c87ec4a80c6bfb6602ba20ef59abe4e3cb2a05211e3c99da67a996c644","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:39:04.840253Z","signature_b64":"KVEY4G7xvXu4f5bQFIpE6azWMWPvCrqMJskdzn0V+nz8oymQRMtA6xwwCA/+TztCBhCPAOFojYP2+3eLQEpwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4780e1c87ec4a80c6bfb6602ba20ef59abe4e3cb2a05211e3c99da67a996c644","last_reissued_at":"2026-07-05T03:39:04.839796Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:39:04.839796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.03229","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-07-05T03:39:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h1NBFwQMKs/HWzHm7RzOmgYbC0d/KDoiWk2Zbiw3EDrFn2XtAVdXZx/fVFIcKVye2WxHMrMyCXuKM4JHY1EhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T14:55:44.154783Z"},"content_sha256":"fec9defbbb15ce18441c5ab6b7f9c22120ebb2e256a4d3fd511c9dd4e24dd937","schema_version":"1.0","event_id":"sha256:fec9defbbb15ce18441c5ab6b7f9c22120ebb2e256a4d3fd511c9dd4e24dd937"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:I6AODSD6YSUAY273MYBLUIHPLG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SIMD-Optimized Search Over Sorted Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Anna Pietarila Graham, Benjamin Mastripolito, Daniel Sheppard, David A. Pimentel, Dylan Weatherred, Laura Monroe, Nicholas Koskelo, Robert Robey","submitted_at":"2021-12-06T18:38:26Z","abstract_excerpt":"Applications often require a fast, single-threaded search algorithm over sorted data, typical in table-lookup operations. We explore various search algorithms for a large number of search candidates over a relatively small array of logarithmically-distributed sorted data. These include an innovative hash-based search that takes advantage of floating point representation to bin data by the exponent. Algorithms that can be optimized to take advantage of SIMD vector instructions are of particular interest. We then conduct a case study applying our results and analyzing algorithmic performance wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.03229","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.03229/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:39:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NGYUL8f1p+C92PuQqfUe4D2soRi1J11Gcu/qfot7+h4/pFxrxKILpIgq6s4CXLxj6aWsEeKIPbqD8LtVMzbkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T14:55:44.155188Z"},"content_sha256":"f3f66c8a8d977892c398b713cc90b29db75f824d37e22bca275b0c920358f8b8","schema_version":"1.0","event_id":"sha256:f3f66c8a8d977892c398b713cc90b29db75f824d37e22bca275b0c920358f8b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I6AODSD6YSUAY273MYBLUIHPLG/bundle.json","state_url":"https://pith.science/pith/I6AODSD6YSUAY273MYBLUIHPLG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I6AODSD6YSUAY273MYBLUIHPLG/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-07-12T14:55:44Z","links":{"resolver":"https://pith.science/pith/I6AODSD6YSUAY273MYBLUIHPLG","bundle":"https://pith.science/pith/I6AODSD6YSUAY273MYBLUIHPLG/bundle.json","state":"https://pith.science/pith/I6AODSD6YSUAY273MYBLUIHPLG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I6AODSD6YSUAY273MYBLUIHPLG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:I6AODSD6YSUAY273MYBLUIHPLG","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":"4150846ff8fda321bdf24106839e4e2d28a6f5b397d50cf80f453ff8dcb024da","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-12-06T18:38:26Z","title_canon_sha256":"3f166e74d3d4f420c870968b6b46d1caa69eed7f7a92ad64fa330ee8167a49c2"},"schema_version":"1.0","source":{"id":"2112.03229","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.03229","created_at":"2026-07-05T03:39:04Z"},{"alias_kind":"arxiv_version","alias_value":"2112.03229v1","created_at":"2026-07-05T03:39:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.03229","created_at":"2026-07-05T03:39:04Z"},{"alias_kind":"pith_short_12","alias_value":"I6AODSD6YSUA","created_at":"2026-07-05T03:39:04Z"},{"alias_kind":"pith_short_16","alias_value":"I6AODSD6YSUAY273","created_at":"2026-07-05T03:39:04Z"},{"alias_kind":"pith_short_8","alias_value":"I6AODSD6","created_at":"2026-07-05T03:39:04Z"}],"graph_snapshots":[{"event_id":"sha256:f3f66c8a8d977892c398b713cc90b29db75f824d37e22bca275b0c920358f8b8","target":"graph","created_at":"2026-07-05T03:39:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.03229/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Applications often require a fast, single-threaded search algorithm over sorted data, typical in table-lookup operations. We explore various search algorithms for a large number of search candidates over a relatively small array of logarithmically-distributed sorted data. These include an innovative hash-based search that takes advantage of floating point representation to bin data by the exponent. Algorithms that can be optimized to take advantage of SIMD vector instructions are of particular interest. We then conduct a case study applying our results and analyzing algorithmic performance wit","authors_text":"Anna Pietarila Graham, Benjamin Mastripolito, Daniel Sheppard, David A. Pimentel, Dylan Weatherred, Laura Monroe, Nicholas Koskelo, Robert Robey","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-12-06T18:38:26Z","title":"SIMD-Optimized Search Over Sorted Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.03229","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:fec9defbbb15ce18441c5ab6b7f9c22120ebb2e256a4d3fd511c9dd4e24dd937","target":"record","created_at":"2026-07-05T03:39:04Z","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":"4150846ff8fda321bdf24106839e4e2d28a6f5b397d50cf80f453ff8dcb024da","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-12-06T18:38:26Z","title_canon_sha256":"3f166e74d3d4f420c870968b6b46d1caa69eed7f7a92ad64fa330ee8167a49c2"},"schema_version":"1.0","source":{"id":"2112.03229","kind":"arxiv","version":1}},"canonical_sha256":"4780e1c87ec4a80c6bfb6602ba20ef59abe4e3cb2a05211e3c99da67a996c644","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4780e1c87ec4a80c6bfb6602ba20ef59abe4e3cb2a05211e3c99da67a996c644","first_computed_at":"2026-07-05T03:39:04.839796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:39:04.839796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KVEY4G7xvXu4f5bQFIpE6azWMWPvCrqMJskdzn0V+nz8oymQRMtA6xwwCA/+TztCBhCPAOFojYP2+3eLQEpwBg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:39:04.840253Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.03229","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fec9defbbb15ce18441c5ab6b7f9c22120ebb2e256a4d3fd511c9dd4e24dd937","sha256:f3f66c8a8d977892c398b713cc90b29db75f824d37e22bca275b0c920358f8b8"],"state_sha256":"4be272c0c5117f2ece00e9c3228b728ca1459ec602861bee79ffbbc0f54c50ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NEVMwoPqnNPtyvhR7FM0+hl/8szP2pXdmJCBTmvPWngl5QkNE3B8y3svzfh3sLLP3dot5YKeIl2cmia0/VfPBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T14:55:44.158307Z","bundle_sha256":"6a8bff8b5a568c397232ae2b41b5d1a47e0edebbe22c263d9a0b3f58e35b2087"}}