{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5MZT7UF4RO7HKBDMZZBGFUUPVE","short_pith_number":"pith:5MZT7UF4","schema_version":"1.0","canonical_sha256":"eb333fd0bc8bbe75046cce4262d28fa936f5813e7f114ad982f6977a6320a27f","source":{"kind":"arxiv","id":"2605.14112","version":1},"attestation_state":"computed","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; ("},"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":true,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.14112","created_at":"2026-05-17T23:39:11.988409+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14112v1","created_at":"2026-05-17T23:39:11.988409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14112","created_at":"2026-05-17T23:39:11.988409+00:00"},{"alias_kind":"pith_short_12","alias_value":"5MZT7UF4RO7H","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"5MZT7UF4RO7HKBDM","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"5MZT7UF4","created_at":"2026-05-18T12:33:37.589309+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/5MZT7UF4RO7HKBDMZZBGFUUPVE","json":"https://pith.science/pith/5MZT7UF4RO7HKBDMZZBGFUUPVE.json","graph_json":"https://pith.science/api/pith-number/5MZT7UF4RO7HKBDMZZBGFUUPVE/graph.json","events_json":"https://pith.science/api/pith-number/5MZT7UF4RO7HKBDMZZBGFUUPVE/events.json","paper":"https://pith.science/paper/5MZT7UF4"},"agent_actions":{"view_html":"https://pith.science/pith/5MZT7UF4RO7HKBDMZZBGFUUPVE","download_json":"https://pith.science/pith/5MZT7UF4RO7HKBDMZZBGFUUPVE.json","view_paper":"https://pith.science/paper/5MZT7UF4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14112&json=true","fetch_graph":"https://pith.science/api/pith-number/5MZT7UF4RO7HKBDMZZBGFUUPVE/graph.json","fetch_events":"https://pith.science/api/pith-number/5MZT7UF4RO7HKBDMZZBGFUUPVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5MZT7UF4RO7HKBDMZZBGFUUPVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5MZT7UF4RO7HKBDMZZBGFUUPVE/action/storage_attestation","attest_author":"https://pith.science/pith/5MZT7UF4RO7HKBDMZZBGFUUPVE/action/author_attestation","sign_citation":"https://pith.science/pith/5MZT7UF4RO7HKBDMZZBGFUUPVE/action/citation_signature","submit_replication":"https://pith.science/pith/5MZT7UF4RO7HKBDMZZBGFUUPVE/action/replication_record"}},"created_at":"2026-05-17T23:39:11.988409+00:00","updated_at":"2026-05-17T23:39:11.988409+00:00"}