{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VU7KNAX3ULUCCYNI2OAAFWTU72","short_pith_number":"pith:VU7KNAX3","canonical_record":{"source":{"id":"2605.27490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-26T16:19:48Z","cross_cats_sorted":[],"title_canon_sha256":"75d1c1b93bd8f49b6df79af5f0149f897c88e87c255a607ab67eee477a43b19a","abstract_canon_sha256":"f06fb30336f49d6010f83a18e21d588debe42ad9a029cb393aab582180d22e07"},"schema_version":"1.0"},"canonical_sha256":"ad3ea682fba2e82161a8d38002da74fe8afc68ea422f25a913c16aee6fb8db5d","source":{"kind":"arxiv","id":"2605.27490","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.27490","created_at":"2026-05-28T00:05:20Z"},{"alias_kind":"arxiv_version","alias_value":"2605.27490v1","created_at":"2026-05-28T00:05:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27490","created_at":"2026-05-28T00:05:20Z"},{"alias_kind":"pith_short_12","alias_value":"VU7KNAX3ULUC","created_at":"2026-05-28T00:05:20Z"},{"alias_kind":"pith_short_16","alias_value":"VU7KNAX3ULUCCYNI","created_at":"2026-05-28T00:05:20Z"},{"alias_kind":"pith_short_8","alias_value":"VU7KNAX3","created_at":"2026-05-28T00:05:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VU7KNAX3ULUCCYNI2OAAFWTU72","target":"record","payload":{"canonical_record":{"source":{"id":"2605.27490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-26T16:19:48Z","cross_cats_sorted":[],"title_canon_sha256":"75d1c1b93bd8f49b6df79af5f0149f897c88e87c255a607ab67eee477a43b19a","abstract_canon_sha256":"f06fb30336f49d6010f83a18e21d588debe42ad9a029cb393aab582180d22e07"},"schema_version":"1.0"},"canonical_sha256":"ad3ea682fba2e82161a8d38002da74fe8afc68ea422f25a913c16aee6fb8db5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T00:05:20.969475Z","signature_b64":"leuDklaEfsEI5t0a2aZLdRlMpwldiq6cl/+ZRSv3Rf1m4rGI8eRwlX8GqA0GUDdCjudu/lh25BpW7jrA0LulAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad3ea682fba2e82161a8d38002da74fe8afc68ea422f25a913c16aee6fb8db5d","last_reissued_at":"2026-05-28T00:05:20.968996Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T00:05:20.968996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.27490","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-28T00:05:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ExS9WN+ETWlhqhPOOCpZNrkOFggU6Kb9ngzM+iYittWpeKV2HeW1BE//fXLQOkUxA0gjASUxIWZp2v1G0KxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:30:31.853209Z"},"content_sha256":"40d23e50edb9b179079cc0c8f0c0556b50a4958227e029dbc57849c4c7750dad","schema_version":"1.0","event_id":"sha256:40d23e50edb9b179079cc0c8f0c0556b50a4958227e029dbc57849c4c7750dad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VU7KNAX3ULUCCYNI2OAAFWTU72","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree Search With Predictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bob Dong, Michael Dinitz","submitted_at":"2026-05-26T16:19:48Z","abstract_excerpt":"``Algorithms with predictions'', or ``learning-augmented algorithms'', has proved to be an extremely useful paradigm for combining machine learning with traditional algorithms. One of the textbook settings for this is searching a sorted array. Without a prediction, classical binary search takes $O(\\log n)$ queries, while with a prediction we can use ``doubling binary search'' to find the target key using $O(\\log \\eta)$ queries, where $\\eta$ is the error of the prediction measured as the absolute value of the difference between the true location and the predicted location. Since an array is jus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27490","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/2605.27490/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-05-28T00:05:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mSKIC0arPdp/FWnJHaDQu8i/eBivlQ9+GuqH23zUTFqZGDv8BU5FOpWPy4jpsGk3O+nviIpsrURYGIo/oq3iBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:30:31.854001Z"},"content_sha256":"4da6252ba13a823f17b9a2fe4c1fbfc498fca912d47c6310fb95a58aabe0e213","schema_version":"1.0","event_id":"sha256:4da6252ba13a823f17b9a2fe4c1fbfc498fca912d47c6310fb95a58aabe0e213"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VU7KNAX3ULUCCYNI2OAAFWTU72/bundle.json","state_url":"https://pith.science/pith/VU7KNAX3ULUCCYNI2OAAFWTU72/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VU7KNAX3ULUCCYNI2OAAFWTU72/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-08T10:30:31Z","links":{"resolver":"https://pith.science/pith/VU7KNAX3ULUCCYNI2OAAFWTU72","bundle":"https://pith.science/pith/VU7KNAX3ULUCCYNI2OAAFWTU72/bundle.json","state":"https://pith.science/pith/VU7KNAX3ULUCCYNI2OAAFWTU72/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VU7KNAX3ULUCCYNI2OAAFWTU72/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VU7KNAX3ULUCCYNI2OAAFWTU72","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":"f06fb30336f49d6010f83a18e21d588debe42ad9a029cb393aab582180d22e07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-26T16:19:48Z","title_canon_sha256":"75d1c1b93bd8f49b6df79af5f0149f897c88e87c255a607ab67eee477a43b19a"},"schema_version":"1.0","source":{"id":"2605.27490","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.27490","created_at":"2026-05-28T00:05:20Z"},{"alias_kind":"arxiv_version","alias_value":"2605.27490v1","created_at":"2026-05-28T00:05:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27490","created_at":"2026-05-28T00:05:20Z"},{"alias_kind":"pith_short_12","alias_value":"VU7KNAX3ULUC","created_at":"2026-05-28T00:05:20Z"},{"alias_kind":"pith_short_16","alias_value":"VU7KNAX3ULUCCYNI","created_at":"2026-05-28T00:05:20Z"},{"alias_kind":"pith_short_8","alias_value":"VU7KNAX3","created_at":"2026-05-28T00:05:20Z"}],"graph_snapshots":[{"event_id":"sha256:4da6252ba13a823f17b9a2fe4c1fbfc498fca912d47c6310fb95a58aabe0e213","target":"graph","created_at":"2026-05-28T00:05:20Z","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/2605.27490/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"``Algorithms with predictions'', or ``learning-augmented algorithms'', has proved to be an extremely useful paradigm for combining machine learning with traditional algorithms. One of the textbook settings for this is searching a sorted array. Without a prediction, classical binary search takes $O(\\log n)$ queries, while with a prediction we can use ``doubling binary search'' to find the target key using $O(\\log \\eta)$ queries, where $\\eta$ is the error of the prediction measured as the absolute value of the difference between the true location and the predicted location. Since an array is jus","authors_text":"Bob Dong, Michael Dinitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-26T16:19:48Z","title":"Tree Search With Predictions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27490","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:40d23e50edb9b179079cc0c8f0c0556b50a4958227e029dbc57849c4c7750dad","target":"record","created_at":"2026-05-28T00:05:20Z","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":"f06fb30336f49d6010f83a18e21d588debe42ad9a029cb393aab582180d22e07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-26T16:19:48Z","title_canon_sha256":"75d1c1b93bd8f49b6df79af5f0149f897c88e87c255a607ab67eee477a43b19a"},"schema_version":"1.0","source":{"id":"2605.27490","kind":"arxiv","version":1}},"canonical_sha256":"ad3ea682fba2e82161a8d38002da74fe8afc68ea422f25a913c16aee6fb8db5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad3ea682fba2e82161a8d38002da74fe8afc68ea422f25a913c16aee6fb8db5d","first_computed_at":"2026-05-28T00:05:20.968996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T00:05:20.968996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"leuDklaEfsEI5t0a2aZLdRlMpwldiq6cl/+ZRSv3Rf1m4rGI8eRwlX8GqA0GUDdCjudu/lh25BpW7jrA0LulAw==","signature_status":"signed_v1","signed_at":"2026-05-28T00:05:20.969475Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.27490","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40d23e50edb9b179079cc0c8f0c0556b50a4958227e029dbc57849c4c7750dad","sha256:4da6252ba13a823f17b9a2fe4c1fbfc498fca912d47c6310fb95a58aabe0e213"],"state_sha256":"da26538db4cb2a2b63f63cfb8f36c8a6ca2e6731b80b16fd7ebd4241a90468e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WaYzuNnkkOJQ+ZYTYPLB68fkLfWfM531CT3DWY4tgwrYQCZoIO/NeoDNBlNkaTtb9q77ZUr30oXlyKYuyysaCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T10:30:31.858450Z","bundle_sha256":"6d7b460a8558244101e86770c7061c8df968472b365a527b09d540ba2d50587d"}}