{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JQK3HUJ24ZDRCSUWFRFOO5XJD6","short_pith_number":"pith:JQK3HUJ2","canonical_record":{"source":{"id":"1708.00964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-03T01:13:40Z","cross_cats_sorted":[],"title_canon_sha256":"46e149bcfe437b09e0b19c5df17b029d6d6d17636f8c72a4534af7dca760ef5d","abstract_canon_sha256":"5cac70fe444c3251ae3a806484f46a29d94634682ef1f088aaa3558b078ab85d"},"schema_version":"1.0"},"canonical_sha256":"4c15b3d13ae647114a962c4ae776e91f9fde111c653079c51646fab31f3667b9","source":{"kind":"arxiv","id":"1708.00964","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00964","created_at":"2026-05-18T00:38:41Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00964v1","created_at":"2026-05-18T00:38:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00964","created_at":"2026-05-18T00:38:41Z"},{"alias_kind":"pith_short_12","alias_value":"JQK3HUJ24ZDR","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JQK3HUJ24ZDRCSUW","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JQK3HUJ2","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JQK3HUJ24ZDRCSUWFRFOO5XJD6","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-03T01:13:40Z","cross_cats_sorted":[],"title_canon_sha256":"46e149bcfe437b09e0b19c5df17b029d6d6d17636f8c72a4534af7dca760ef5d","abstract_canon_sha256":"5cac70fe444c3251ae3a806484f46a29d94634682ef1f088aaa3558b078ab85d"},"schema_version":"1.0"},"canonical_sha256":"4c15b3d13ae647114a962c4ae776e91f9fde111c653079c51646fab31f3667b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:41.015107Z","signature_b64":"qTYlxhLd8jRnByjbyYupRtZpdZJeGrl57LFuxy63av0JfY2R+emFhgb9EUrKF1G2xPDCGDonQDwzNrF3vpgSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c15b3d13ae647114a962c4ae776e91f9fde111c653079c51646fab31f3667b9","last_reissued_at":"2026-05-18T00:38:41.014591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:41.014591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00964","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:38:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q7rsQREUA2ihNkatjgcjn7Xuy1h78pH4CntHsG9fcyCpDcIMJ6hb4BsinROThekPSAXkUZPIvrQ85GwBQrkxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:06:56.077976Z"},"content_sha256":"2786887db5fa200ac14f2d94d8b382d269cf557f6f63c94c8ae7a088894b6dbc","schema_version":"1.0","event_id":"sha256:2786887db5fa200ac14f2d94d8b382d269cf557f6f63c94c8ae7a088894b6dbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JQK3HUJ24ZDRCSUWFRFOO5XJD6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient hybrid search algorithm on ordered datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adnan Saher Mohammed, \\c{S}ahin Emrah Amrahov, Fatih V. \\c{C}elebi","submitted_at":"2017-08-03T01:13:40Z","abstract_excerpt":"The increase in the rate of data is much higher than the increase in the speed of computers, which results in a heavy emphasis on search algorithms in research literature. Searching an item in ordered list is an efficient operation in data processing. Binary and interpolation search algorithms commonly are used for searching ordered dataset in many applications. In this paper, we present a hybrid algorithm to search ordered datasets based on the idea of interpolation and binary search. The proposed algorithm called Hybrid Search (HS), which is designed to work efficiently on unknown distribute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00964","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:38:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uyVvEbY5J7BhimCcHuSK8VRbUAb+wL2FzFGK8FFkM+mYwWZeKeMdabAXnnanq7Pp5Fvhb2XV1a8utvYJ1f+YDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:06:56.078638Z"},"content_sha256":"8b0957633fcd0651e6b4eda736fbba44ab1d40edd36fd8e1e8653fb4d7cfb118","schema_version":"1.0","event_id":"sha256:8b0957633fcd0651e6b4eda736fbba44ab1d40edd36fd8e1e8653fb4d7cfb118"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JQK3HUJ24ZDRCSUWFRFOO5XJD6/bundle.json","state_url":"https://pith.science/pith/JQK3HUJ24ZDRCSUWFRFOO5XJD6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JQK3HUJ24ZDRCSUWFRFOO5XJD6/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-12T02:06:56Z","links":{"resolver":"https://pith.science/pith/JQK3HUJ24ZDRCSUWFRFOO5XJD6","bundle":"https://pith.science/pith/JQK3HUJ24ZDRCSUWFRFOO5XJD6/bundle.json","state":"https://pith.science/pith/JQK3HUJ24ZDRCSUWFRFOO5XJD6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JQK3HUJ24ZDRCSUWFRFOO5XJD6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JQK3HUJ24ZDRCSUWFRFOO5XJD6","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":"5cac70fe444c3251ae3a806484f46a29d94634682ef1f088aaa3558b078ab85d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-03T01:13:40Z","title_canon_sha256":"46e149bcfe437b09e0b19c5df17b029d6d6d17636f8c72a4534af7dca760ef5d"},"schema_version":"1.0","source":{"id":"1708.00964","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00964","created_at":"2026-05-18T00:38:41Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00964v1","created_at":"2026-05-18T00:38:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00964","created_at":"2026-05-18T00:38:41Z"},{"alias_kind":"pith_short_12","alias_value":"JQK3HUJ24ZDR","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JQK3HUJ24ZDRCSUW","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JQK3HUJ2","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:8b0957633fcd0651e6b4eda736fbba44ab1d40edd36fd8e1e8653fb4d7cfb118","target":"graph","created_at":"2026-05-18T00:38:41Z","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":"The increase in the rate of data is much higher than the increase in the speed of computers, which results in a heavy emphasis on search algorithms in research literature. Searching an item in ordered list is an efficient operation in data processing. Binary and interpolation search algorithms commonly are used for searching ordered dataset in many applications. In this paper, we present a hybrid algorithm to search ordered datasets based on the idea of interpolation and binary search. The proposed algorithm called Hybrid Search (HS), which is designed to work efficiently on unknown distribute","authors_text":"Adnan Saher Mohammed, \\c{S}ahin Emrah Amrahov, Fatih V. \\c{C}elebi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-03T01:13:40Z","title":"Efficient hybrid search algorithm on ordered datasets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00964","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:2786887db5fa200ac14f2d94d8b382d269cf557f6f63c94c8ae7a088894b6dbc","target":"record","created_at":"2026-05-18T00:38:41Z","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":"5cac70fe444c3251ae3a806484f46a29d94634682ef1f088aaa3558b078ab85d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-03T01:13:40Z","title_canon_sha256":"46e149bcfe437b09e0b19c5df17b029d6d6d17636f8c72a4534af7dca760ef5d"},"schema_version":"1.0","source":{"id":"1708.00964","kind":"arxiv","version":1}},"canonical_sha256":"4c15b3d13ae647114a962c4ae776e91f9fde111c653079c51646fab31f3667b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c15b3d13ae647114a962c4ae776e91f9fde111c653079c51646fab31f3667b9","first_computed_at":"2026-05-18T00:38:41.014591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:41.014591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qTYlxhLd8jRnByjbyYupRtZpdZJeGrl57LFuxy63av0JfY2R+emFhgb9EUrKF1G2xPDCGDonQDwzNrF3vpgSBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:41.015107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00964","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2786887db5fa200ac14f2d94d8b382d269cf557f6f63c94c8ae7a088894b6dbc","sha256:8b0957633fcd0651e6b4eda736fbba44ab1d40edd36fd8e1e8653fb4d7cfb118"],"state_sha256":"3fe6c05bdcddc6e9351e1081bb8cc0ab1a01420fe6f4de5c0409f3d47411c243"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F1hYM/Uogk/5RDpxpBUkZQmHVDAVlSqETQVNe3mT0SkEyz8eZGpDjZ8M7h8Ys+xMvup21ARMak5Zg18mvJzIAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:06:56.082024Z","bundle_sha256":"1815ecbf8d578e4301e385f48692a4a460035d79e29c3fc57cb412ad1fa515ea"}}