{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Z2UDUC7CAX7BOIAX5GYM2HBOHX","short_pith_number":"pith:Z2UDUC7C","schema_version":"1.0","canonical_sha256":"cea83a0be205fe172017e9b0cd1c2e3dee126f7b0445bc8d9d6a4fe6bc8a06d4","source":{"kind":"arxiv","id":"1404.4504","version":1},"attestation_state":"computed","paper":{"title":"On the Tree Search Problem with Non-uniform Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bal\\'azs Keszegh, Bernard Lidick\\'y, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Ferdinando Cicalese, Tom\\'a\\v{s} Valla","submitted_at":"2014-04-17T12:12:48Z","abstract_excerpt":"Searching in partially ordered structures has been considered in the context of information retrieval and efficient tree-like indexes, as well as in hierarchy based knowledge representation. In this paper we focus on tree-like partial orders and consider the problem of identifying an initially unknown vertex in a tree by asking edge queries: an edge query $e$ returns the component of $T-e$ containing the vertex sought for, while incurring some known cost $c(e)$.\n  The Tree Search Problem with Non-Uniform Cost is: given a tree $T$ where each edge has an associated cost, construct a strategy tha"},"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":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1404.4504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T12:12:48Z","cross_cats_sorted":[],"title_canon_sha256":"e9b6168cee7b6df0d8a2a503b9129411db2ae9816afe80cb1cb0ba83d38426f7","abstract_canon_sha256":"2023747079063053d4eac30ea1a8b0a33d944093f59387561d0e620ff75df45f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:58.377514Z","signature_b64":"KwTAmNGlvdwERuchxCc+MxkdOCccjL8ninu63clOYSi4fT+hb3th8AmH8EsEmIkJynWsRYxNNGptPk3In4sgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cea83a0be205fe172017e9b0cd1c2e3dee126f7b0445bc8d9d6a4fe6bc8a06d4","last_reissued_at":"2026-05-18T00:54:58.376990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:58.376990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Tree Search Problem with Non-uniform Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bal\\'azs Keszegh, Bernard Lidick\\'y, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Ferdinando Cicalese, Tom\\'a\\v{s} Valla","submitted_at":"2014-04-17T12:12:48Z","abstract_excerpt":"Searching in partially ordered structures has been considered in the context of information retrieval and efficient tree-like indexes, as well as in hierarchy based knowledge representation. In this paper we focus on tree-like partial orders and consider the problem of identifying an initially unknown vertex in a tree by asking edge queries: an edge query $e$ returns the component of $T-e$ containing the vertex sought for, while incurring some known cost $c(e)$.\n  The Tree Search Problem with Non-Uniform Cost is: given a tree $T$ where each edge has an associated cost, construct a strategy tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4504","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.4504","created_at":"2026-05-18T00:54:58.377079+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.4504v1","created_at":"2026-05-18T00:54:58.377079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4504","created_at":"2026-05-18T00:54:58.377079+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2UDUC7CAX7B","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2UDUC7CAX7BOIAX","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2UDUC7C","created_at":"2026-05-18T12:28:59.999130+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/Z2UDUC7CAX7BOIAX5GYM2HBOHX","json":"https://pith.science/pith/Z2UDUC7CAX7BOIAX5GYM2HBOHX.json","graph_json":"https://pith.science/api/pith-number/Z2UDUC7CAX7BOIAX5GYM2HBOHX/graph.json","events_json":"https://pith.science/api/pith-number/Z2UDUC7CAX7BOIAX5GYM2HBOHX/events.json","paper":"https://pith.science/paper/Z2UDUC7C"},"agent_actions":{"view_html":"https://pith.science/pith/Z2UDUC7CAX7BOIAX5GYM2HBOHX","download_json":"https://pith.science/pith/Z2UDUC7CAX7BOIAX5GYM2HBOHX.json","view_paper":"https://pith.science/paper/Z2UDUC7C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.4504&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2UDUC7CAX7BOIAX5GYM2HBOHX/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2UDUC7CAX7BOIAX5GYM2HBOHX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2UDUC7CAX7BOIAX5GYM2HBOHX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2UDUC7CAX7BOIAX5GYM2HBOHX/action/storage_attestation","attest_author":"https://pith.science/pith/Z2UDUC7CAX7BOIAX5GYM2HBOHX/action/author_attestation","sign_citation":"https://pith.science/pith/Z2UDUC7CAX7BOIAX5GYM2HBOHX/action/citation_signature","submit_replication":"https://pith.science/pith/Z2UDUC7CAX7BOIAX5GYM2HBOHX/action/replication_record"}},"created_at":"2026-05-18T00:54:58.377079+00:00","updated_at":"2026-05-18T00:54:58.377079+00:00"}