{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Z2UDUC7CAX7BOIAX5GYM2HBOHX","short_pith_number":"pith:Z2UDUC7C","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"},"canonical_sha256":"cea83a0be205fe172017e9b0cd1c2e3dee126f7b0445bc8d9d6a4fe6bc8a06d4","source":{"kind":"arxiv","id":"1404.4504","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4504","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4504v1","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4504","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"Z2UDUC7CAX7B","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z2UDUC7CAX7BOIAX","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z2UDUC7C","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Z2UDUC7CAX7BOIAX5GYM2HBOHX","target":"record","payload":{"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"},"canonical_sha256":"cea83a0be205fe172017e9b0cd1c2e3dee126f7b0445bc8d9d6a4fe6bc8a06d4","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"},"source_kind":"arxiv","source_id":"1404.4504","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:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+0aWHPBqrQAKweThnvaylI00yM/9Ox2DebLwSQ8dbqIXqMXRkWwwxgy0fOM1qLAp8q0mywhyHcYDjJXqC6lWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:39:38.242705Z"},"content_sha256":"8177d06d5a242bd344193ca4d2acd9c654d2ba2cbc5518cd77044365a1c34b5b","schema_version":"1.0","event_id":"sha256:8177d06d5a242bd344193ca4d2acd9c654d2ba2cbc5518cd77044365a1c34b5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Z2UDUC7CAX7BOIAX5GYM2HBOHX","target":"graph","payload":{"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"},"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:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WszukjmPn74m9PUmKR2jptHYvSdA5BpMQJJTwrrmEHbc5Z+Y8eAvqszinaqNeiDWDAHBUC0SdJEJICnSWMFFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:39:38.243374Z"},"content_sha256":"fe8b0d5a855575c96dd45f6e345e8018e656513deb74a695998426273b2d0194","schema_version":"1.0","event_id":"sha256:fe8b0d5a855575c96dd45f6e345e8018e656513deb74a695998426273b2d0194"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z2UDUC7CAX7BOIAX5GYM2HBOHX/bundle.json","state_url":"https://pith.science/pith/Z2UDUC7CAX7BOIAX5GYM2HBOHX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z2UDUC7CAX7BOIAX5GYM2HBOHX/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-05-26T01:39:38Z","links":{"resolver":"https://pith.science/pith/Z2UDUC7CAX7BOIAX5GYM2HBOHX","bundle":"https://pith.science/pith/Z2UDUC7CAX7BOIAX5GYM2HBOHX/bundle.json","state":"https://pith.science/pith/Z2UDUC7CAX7BOIAX5GYM2HBOHX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z2UDUC7CAX7BOIAX5GYM2HBOHX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Z2UDUC7CAX7BOIAX5GYM2HBOHX","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":"2023747079063053d4eac30ea1a8b0a33d944093f59387561d0e620ff75df45f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T12:12:48Z","title_canon_sha256":"e9b6168cee7b6df0d8a2a503b9129411db2ae9816afe80cb1cb0ba83d38426f7"},"schema_version":"1.0","source":{"id":"1404.4504","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4504","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4504v1","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4504","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"Z2UDUC7CAX7B","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z2UDUC7CAX7BOIAX","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z2UDUC7C","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:fe8b0d5a855575c96dd45f6e345e8018e656513deb74a695998426273b2d0194","target":"graph","created_at":"2026-05-18T00:54:58Z","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":"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","authors_text":"Bal\\'azs Keszegh, Bernard Lidick\\'y, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Ferdinando Cicalese, Tom\\'a\\v{s} Valla","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T12:12:48Z","title":"On the Tree Search Problem with Non-uniform Costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4504","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:8177d06d5a242bd344193ca4d2acd9c654d2ba2cbc5518cd77044365a1c34b5b","target":"record","created_at":"2026-05-18T00:54:58Z","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":"2023747079063053d4eac30ea1a8b0a33d944093f59387561d0e620ff75df45f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-17T12:12:48Z","title_canon_sha256":"e9b6168cee7b6df0d8a2a503b9129411db2ae9816afe80cb1cb0ba83d38426f7"},"schema_version":"1.0","source":{"id":"1404.4504","kind":"arxiv","version":1}},"canonical_sha256":"cea83a0be205fe172017e9b0cd1c2e3dee126f7b0445bc8d9d6a4fe6bc8a06d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cea83a0be205fe172017e9b0cd1c2e3dee126f7b0445bc8d9d6a4fe6bc8a06d4","first_computed_at":"2026-05-18T00:54:58.376990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:58.376990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KwTAmNGlvdwERuchxCc+MxkdOCccjL8ninu63clOYSi4fT+hb3th8AmH8EsEmIkJynWsRYxNNGptPk3In4sgDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:58.377514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4504","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8177d06d5a242bd344193ca4d2acd9c654d2ba2cbc5518cd77044365a1c34b5b","sha256:fe8b0d5a855575c96dd45f6e345e8018e656513deb74a695998426273b2d0194"],"state_sha256":"b4eaccd21f37a6415b68773e605fe88be6ff592910303b9bf297f8538532999c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHYtKqQFbUkgCMYjScOTNddpoNXxCpd2pvK7r5ltjAN55qQ+buQelaYms5Sa9a6EQiMd8fx1atsCqy1+a+QsDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:39:38.247137Z","bundle_sha256":"b3517537bd6478367c07a0eeba8a43a4bf89a6560924476c9b5aba361105716f"}}