{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JYOV32E6DUGMUTJTNYRZF7BBJ2","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":"6ad1247e04709b89ae0cc66de76a819f92f1695d8089d40102ab7c4a1040c091","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-27T09:52:17Z","title_canon_sha256":"9029ab8b6157bb1784ef8f276e2e6b338f488ccf399a56f12d8cfe99adbf4ccc"},"schema_version":"1.0","source":{"id":"1702.08207","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08207","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08207v1","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08207","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"pith_short_12","alias_value":"JYOV32E6DUGM","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JYOV32E6DUGMUTJT","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JYOV32E6","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:38633c66cd2ad26d918de3cfbee9c83aa152b17fdbc15bbd2150c128a7fd3c21","target":"graph","created_at":"2026-05-18T00:49:55Z","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":"We consider the following generalization of the binary search problem. A search strategy is required to locate an unknown target node $t$ in a given tree $T$. Upon querying a node $v$ of the tree, the strategy receives as a reply an indication of the connected component of $T\\setminus\\{v\\}$ containing the target $t$. The cost of querying each node is given by a known non-negative weight function, and the considered objective is to minimize the total query cost for a worst-case choice of the target. Designing an optimal strategy for a weighted tree search instance is known to be strongly NP-har","authors_text":"Adrian Kosowski (GANG), Dariusz Dereniowski (Gdansk University of Technology), Mengchuan Zou (GANG), Przemyslaw Uznanski (ETH Zurich)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-27T09:52:17Z","title":"Approximation Strategies for Generalized Binary Search in Weighted Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08207","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:97a63efa6ef291ddc186359be0ad072dda838eea6c33f99ca5a4f447013fc36a","target":"record","created_at":"2026-05-18T00:49:55Z","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":"6ad1247e04709b89ae0cc66de76a819f92f1695d8089d40102ab7c4a1040c091","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-27T09:52:17Z","title_canon_sha256":"9029ab8b6157bb1784ef8f276e2e6b338f488ccf399a56f12d8cfe99adbf4ccc"},"schema_version":"1.0","source":{"id":"1702.08207","kind":"arxiv","version":1}},"canonical_sha256":"4e1d5de89e1d0cca4d336e2392fc214e9b9ec15c0f0b0560c051bd1385dfff2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e1d5de89e1d0cca4d336e2392fc214e9b9ec15c0f0b0560c051bd1385dfff2c","first_computed_at":"2026-05-18T00:49:55.609153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:55.609153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oyFvUS2gPhnnfmtmbav5vOYl8hqHTE5TN7ziBOfdyb/Ofeo/0whJsZCPEaqlJ3FPfNTTQtspDeV8YeSoMt7eDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:55.609926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08207","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97a63efa6ef291ddc186359be0ad072dda838eea6c33f99ca5a4f447013fc36a","sha256:38633c66cd2ad26d918de3cfbee9c83aa152b17fdbc15bbd2150c128a7fd3c21"],"state_sha256":"7c1ad405e2b90c01c776e16939999f3d99dc91ea658cdf3805050e4ca171bf29"}