{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5MZT7UF4RO7HKBDMZZBGFUUPVE","short_pith_number":"pith:5MZT7UF4","canonical_record":{"source":{"id":"2605.14112","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T20:56:02Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1a6e9383c73575af93683a11754bf79fb138f4ed0e689f435647779fda39149f","abstract_canon_sha256":"c6c1f97b3fa88ce5cca8684047218437a628d5adb46be19dc1b031f0ba88f803"},"schema_version":"1.0"},"canonical_sha256":"eb333fd0bc8bbe75046cce4262d28fa936f5813e7f114ad982f6977a6320a27f","source":{"kind":"arxiv","id":"2605.14112","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14112","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14112v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14112","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"5MZT7UF4RO7H","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"5MZT7UF4RO7HKBDM","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"5MZT7UF4","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5MZT7UF4RO7HKBDMZZBGFUUPVE","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14112","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T20:56:02Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1a6e9383c73575af93683a11754bf79fb138f4ed0e689f435647779fda39149f","abstract_canon_sha256":"c6c1f97b3fa88ce5cca8684047218437a628d5adb46be19dc1b031f0ba88f803"},"schema_version":"1.0"},"canonical_sha256":"eb333fd0bc8bbe75046cce4262d28fa936f5813e7f114ad982f6977a6320a27f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:11.988941Z","signature_b64":"c//bF3MR2N6ygrR4G9gJymJn1u3JgE4XBk5zvLKJoY1VMP97YbLbqntniMWiuQQ47pMVypULn22TT1rwib0IBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb333fd0bc8bbe75046cce4262d28fa936f5813e7f114ad982f6977a6320a27f","last_reissued_at":"2026-05-17T23:39:11.988272Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:11.988272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14112","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-17T23:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FNTc49TJq/dnP8AqMs6YWNLCH3/xlusSZeGRr9J1ZCnTEhPX8iN1Yugv9p0TY0UZiTIH1tLAcclnyV4oLbICDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:01:09.334193Z"},"content_sha256":"343070826936c5a777980edffd6497ffbb732b426646d4c1dda968ab609ce48e","schema_version":"1.0","event_id":"sha256:343070826936c5a777980edffd6497ffbb732b426646d4c1dda968ab609ce48e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5MZT7UF4RO7HKBDMZZBGFUUPVE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Leaf-to-Ancestor Minimum Query in the Oracle Model","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"A static data structure preprocesses a rooted tree in O(n log h) oracle comparisons to answer any leaf-to-ancestor minimum query in O(1) time with no comparisons at query time.","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Aleksandr Levin, Aleksey Upirvitskiy","submitted_at":"2026-05-13T20:56:02Z","abstract_excerpt":"We study leaf-to-ancestor path-minimum queries on a rooted, weighted tree in the oracle model, where the only allowed value operation is a comparison oracle on edge (or node) weights. We give a static data structure that, after O(n log h) preprocessing time, space, and oracle calls (where $n$ is the number of nodes and $h$ is the tree height), answers any leaf-to-ancestor query in O(1) worst-case time with zero oracle calls at query time. The method combines (I) an edge-to-node weight conversion with a deterministic tie-break to obtain a total order; (II) ladder (longest-path) decomposition; ("},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We give a static data structure that, after O(n log h) preprocessing time, space, and oracle calls, answers any leaf-to-ancestor query in O(1) worst-case time with zero oracle calls at query time. The preprocessing oracle-comparison bound is tight in the deterministic comparison model.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The input is a rooted tree whose edge (or node) weights admit a total order via a deterministic tie-breaking rule when the comparison oracle returns equality; the oracle is consistent across all calls.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A data structure preprocesses a rooted weighted tree in O(n log h) time and space using comparisons to support O(1)-time leaf-to-ancestor minimum queries with zero oracle calls at query time.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A static data structure preprocesses a rooted tree in O(n log h) oracle comparisons to answer any leaf-to-ancestor minimum query in O(1) time with no comparisons at query time.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ac1f06fca66a752bc098f50966947ec2d11d455793a90380f2bb26ef6ef10c48"},"source":{"id":"2605.14112","kind":"arxiv","version":1},"verdict":{"id":"ff91019e-6703-4c8c-a998-a8dd0d08b4b1","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:51:31.411426Z","strongest_claim":"We give a static data structure that, after O(n log h) preprocessing time, space, and oracle calls, answers any leaf-to-ancestor query in O(1) worst-case time with zero oracle calls at query time. The preprocessing oracle-comparison bound is tight in the deterministic comparison model.","one_line_summary":"A data structure preprocesses a rooted weighted tree in O(n log h) time and space using comparisons to support O(1)-time leaf-to-ancestor minimum queries with zero oracle calls at query time.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The input is a rooted tree whose edge (or node) weights admit a total order via a deterministic tie-breaking rule when the comparison oracle returns equality; the oracle is consistent across all calls.","pith_extraction_headline":"A static data structure preprocesses a rooted tree in O(n log h) oracle comparisons to answer any leaf-to-ancestor minimum query in O(1) time with no comparisons at query time."},"references":{"count":3,"sample":[{"doi":"","year":2021,"title":"arXiv:2105.01864 [cs.DS] (2021).https://arxiv.org/abs/2105.01864","work_id":"cb65e55b-de28-4603-87bd-8c93a50c7b06","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/bf02526037","year":1997,"title":"Algorithmica 18, 263–270 (1997).https://doi.org/10.1007/BF02526037","work_id":"84887db8-ccb3-4d0b-99da-7b9209c58f98","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.tcs","year":2004,"title":"Robustness of temporal logic specifications for continuous-time sig- nals","work_id":"b4fc9e91-7fe2-4ebf-8b5d-fdb12379e17e","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":3,"snapshot_sha256":"2f5a73ff2cd64fd5cfdd22c307f66f5fb1a5ccff03b2a37eb603e7eb9936e037","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":"ff91019e-6703-4c8c-a998-a8dd0d08b4b1"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/MNw2qdQsYIIxM+uQHvVOHDH8AJKGb8bPclRIv4piRgsUZ7+XpTWR8H7WOwu1cuaBUxoSUrwRQ/K9bLm+giQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:01:09.335447Z"},"content_sha256":"4ffa93ba567785348c64130980b2b1ab93fdcd7a6d49fbfd7867a52b7fe99338","schema_version":"1.0","event_id":"sha256:4ffa93ba567785348c64130980b2b1ab93fdcd7a6d49fbfd7867a52b7fe99338"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5MZT7UF4RO7HKBDMZZBGFUUPVE/bundle.json","state_url":"https://pith.science/pith/5MZT7UF4RO7HKBDMZZBGFUUPVE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5MZT7UF4RO7HKBDMZZBGFUUPVE/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-10T12:01:09Z","links":{"resolver":"https://pith.science/pith/5MZT7UF4RO7HKBDMZZBGFUUPVE","bundle":"https://pith.science/pith/5MZT7UF4RO7HKBDMZZBGFUUPVE/bundle.json","state":"https://pith.science/pith/5MZT7UF4RO7HKBDMZZBGFUUPVE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5MZT7UF4RO7HKBDMZZBGFUUPVE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5MZT7UF4RO7HKBDMZZBGFUUPVE","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":"c6c1f97b3fa88ce5cca8684047218437a628d5adb46be19dc1b031f0ba88f803","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T20:56:02Z","title_canon_sha256":"1a6e9383c73575af93683a11754bf79fb138f4ed0e689f435647779fda39149f"},"schema_version":"1.0","source":{"id":"2605.14112","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14112","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14112v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14112","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"5MZT7UF4RO7H","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"5MZT7UF4RO7HKBDM","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"5MZT7UF4","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:4ffa93ba567785348c64130980b2b1ab93fdcd7a6d49fbfd7867a52b7fe99338","target":"graph","created_at":"2026-05-17T23:39:11Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We give a static data structure that, after O(n log h) preprocessing time, space, and oracle calls, answers any leaf-to-ancestor query in O(1) worst-case time with zero oracle calls at query time. The preprocessing oracle-comparison bound is tight in the deterministic comparison model."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The input is a rooted tree whose edge (or node) weights admit a total order via a deterministic tie-breaking rule when the comparison oracle returns equality; the oracle is consistent across all calls."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A data structure preprocesses a rooted weighted tree in O(n log h) time and space using comparisons to support O(1)-time leaf-to-ancestor minimum queries with zero oracle calls at query time."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A static data structure preprocesses a rooted tree in O(n log h) oracle comparisons to answer any leaf-to-ancestor minimum query in O(1) time with no comparisons at query time."}],"snapshot_sha256":"ac1f06fca66a752bc098f50966947ec2d11d455793a90380f2bb26ef6ef10c48"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study leaf-to-ancestor path-minimum queries on a rooted, weighted tree in the oracle model, where the only allowed value operation is a comparison oracle on edge (or node) weights. We give a static data structure that, after O(n log h) preprocessing time, space, and oracle calls (where $n$ is the number of nodes and $h$ is the tree height), answers any leaf-to-ancestor query in O(1) worst-case time with zero oracle calls at query time. The method combines (I) an edge-to-node weight conversion with a deterministic tie-break to obtain a total order; (II) ladder (longest-path) decomposition; (","authors_text":"Aleksandr Levin, Aleksey Upirvitskiy","cross_cats":["cs.CC"],"headline":"A static data structure preprocesses a rooted tree in O(n log h) oracle comparisons to answer any leaf-to-ancestor minimum query in O(1) time with no comparisons at query time.","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T20:56:02Z","title":"Fast Leaf-to-Ancestor Minimum Query in the Oracle Model"},"references":{"count":3,"internal_anchors":0,"resolved_work":3,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"arXiv:2105.01864 [cs.DS] (2021).https://arxiv.org/abs/2105.01864","work_id":"cb65e55b-de28-4603-87bd-8c93a50c7b06","year":2021},{"cited_arxiv_id":"","doi":"10.1007/bf02526037","is_internal_anchor":false,"ref_index":2,"title":"Algorithmica 18, 263–270 (1997).https://doi.org/10.1007/BF02526037","work_id":"84887db8-ccb3-4d0b-99da-7b9209c58f98","year":1997},{"cited_arxiv_id":"","doi":"10.1016/j.tcs","is_internal_anchor":false,"ref_index":3,"title":"Robustness of temporal logic specifications for continuous-time sig- nals","work_id":"b4fc9e91-7fe2-4ebf-8b5d-fdb12379e17e","year":2004}],"snapshot_sha256":"2f5a73ff2cd64fd5cfdd22c307f66f5fb1a5ccff03b2a37eb603e7eb9936e037"},"source":{"id":"2605.14112","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:51:31.411426Z","id":"ff91019e-6703-4c8c-a998-a8dd0d08b4b1","model_set":{"reader":"grok-4.3"},"one_line_summary":"A data structure preprocesses a rooted weighted tree in O(n log h) time and space using comparisons to support O(1)-time leaf-to-ancestor minimum queries with zero oracle calls at query time.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A static data structure preprocesses a rooted tree in O(n log h) oracle comparisons to answer any leaf-to-ancestor minimum query in O(1) time with no comparisons at query time.","strongest_claim":"We give a static data structure that, after O(n log h) preprocessing time, space, and oracle calls, answers any leaf-to-ancestor query in O(1) worst-case time with zero oracle calls at query time. The preprocessing oracle-comparison bound is tight in the deterministic comparison model.","weakest_assumption":"The input is a rooted tree whose edge (or node) weights admit a total order via a deterministic tie-breaking rule when the comparison oracle returns equality; the oracle is consistent across all calls."}},"verdict_id":"ff91019e-6703-4c8c-a998-a8dd0d08b4b1"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:343070826936c5a777980edffd6497ffbb732b426646d4c1dda968ab609ce48e","target":"record","created_at":"2026-05-17T23:39:11Z","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":"c6c1f97b3fa88ce5cca8684047218437a628d5adb46be19dc1b031f0ba88f803","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T20:56:02Z","title_canon_sha256":"1a6e9383c73575af93683a11754bf79fb138f4ed0e689f435647779fda39149f"},"schema_version":"1.0","source":{"id":"2605.14112","kind":"arxiv","version":1}},"canonical_sha256":"eb333fd0bc8bbe75046cce4262d28fa936f5813e7f114ad982f6977a6320a27f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb333fd0bc8bbe75046cce4262d28fa936f5813e7f114ad982f6977a6320a27f","first_computed_at":"2026-05-17T23:39:11.988272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:11.988272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c//bF3MR2N6ygrR4G9gJymJn1u3JgE4XBk5zvLKJoY1VMP97YbLbqntniMWiuQQ47pMVypULn22TT1rwib0IBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:11.988941Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14112","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:343070826936c5a777980edffd6497ffbb732b426646d4c1dda968ab609ce48e","sha256:4ffa93ba567785348c64130980b2b1ab93fdcd7a6d49fbfd7867a52b7fe99338"],"state_sha256":"a39beabfdf08cf74b34be339e52e1876e3db3a2241d07f7c748799b9e7d38c11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A5t4BpAvqXn+2H+oAapHOgYbrAz3ZdtZTQ27bf9L8XkIhIw58liL2+VLPrSWky8NRNzLoyBbVV61g9uCGse1CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T12:01:09.341570Z","bundle_sha256":"e6cada56e72e387f7264620290c87a05c87f3c00b5311e1ac05bece45df0ffb5"}}