{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QPSLCLJ72JBKSRILS6KAOD3Z22","short_pith_number":"pith:QPSLCLJ7","canonical_record":{"source":{"id":"1811.10928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-27T11:53:33Z","cross_cats_sorted":[],"title_canon_sha256":"1045ea74e94b37bd74382d1a09ba94d4039821fe36cb11d77524d800a92453e8","abstract_canon_sha256":"ad8faf08b4bef5cf7213bb27d6bcfffb097ba19b7f2a6005e892d74f3ef2598a"},"schema_version":"1.0"},"canonical_sha256":"83e4b12d3fd242a9450b9794070f79d6bd0b6f4a5fb48804511d336a413316a2","source":{"kind":"arxiv","id":"1811.10928","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10928","created_at":"2026-05-17T23:59:43Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10928v2","created_at":"2026-05-17T23:59:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10928","created_at":"2026-05-17T23:59:43Z"},{"alias_kind":"pith_short_12","alias_value":"QPSLCLJ72JBK","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QPSLCLJ72JBKSRIL","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QPSLCLJ7","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QPSLCLJ72JBKSRILS6KAOD3Z22","target":"record","payload":{"canonical_record":{"source":{"id":"1811.10928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-27T11:53:33Z","cross_cats_sorted":[],"title_canon_sha256":"1045ea74e94b37bd74382d1a09ba94d4039821fe36cb11d77524d800a92453e8","abstract_canon_sha256":"ad8faf08b4bef5cf7213bb27d6bcfffb097ba19b7f2a6005e892d74f3ef2598a"},"schema_version":"1.0"},"canonical_sha256":"83e4b12d3fd242a9450b9794070f79d6bd0b6f4a5fb48804511d336a413316a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:43.206227Z","signature_b64":"Phmorw0DxB0KR9dm4/lpK+d1jkdKMiV393EgchueuC0VWTAlD1TDw6fsQNpgt7Q1BZ/QJMiOuRc5yr9m9VHUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83e4b12d3fd242a9450b9794070f79d6bd0b6f4a5fb48804511d336a413316a2","last_reissued_at":"2026-05-17T23:59:43.205721Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:43.205721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.10928","source_version":2,"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:59:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q+FD/qnL984Bxzve8kju6dmftzFZk3FNhFBULTz91s3vPLkNqatW+ENN6nZITBeq7afuBcSwvhNQKqAcBrvaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:04:48.299555Z"},"content_sha256":"771ace0e7fd78187d9dd885d1f2c962253629b9296f34dddb419377fc1be48cb","schema_version":"1.0","event_id":"sha256:771ace0e7fd78187d9dd885d1f2c962253629b9296f34dddb419377fc1be48cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QPSLCLJ72JBKSRILS6KAOD3Z22","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Single-Agent Policy Tree Search With Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Laurent Orseau, Levi H. S. Lelis, Th\\'eophane Weber, Tor Lattimore","submitted_at":"2018-11-27T11:53:33Z","abstract_excerpt":"We introduce two novel tree search algorithms that use a policy to guide search. The first algorithm is a best-first enumeration that uses a cost function that allows us to prove an upper bound on the number of nodes to be expanded before reaching a goal state. We show that this best-first algorithm is particularly well suited for `needle-in-a-haystack' problems. The second algorithm is based on sampling and we prove an upper bound on the expected number of nodes it expands before reaching a set of goal states. We show that this algorithm is better suited for problems where many paths lead to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10928","kind":"arxiv","version":2},"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-17T23:59:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F9JWcpevIh5BRnnjUmJjHgfYmUydvfxKSKIbXmqrEsUrnT4ZXh09ICY5wkYCBQOsVT1cn2DRnFs7DQGvvK0xAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:04:48.300187Z"},"content_sha256":"5cfb4da2268efefcae4677528ccff27d23be44a27e1b86a2bb6127bd662ca963","schema_version":"1.0","event_id":"sha256:5cfb4da2268efefcae4677528ccff27d23be44a27e1b86a2bb6127bd662ca963"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QPSLCLJ72JBKSRILS6KAOD3Z22/bundle.json","state_url":"https://pith.science/pith/QPSLCLJ72JBKSRILS6KAOD3Z22/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QPSLCLJ72JBKSRILS6KAOD3Z22/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-26T07:04:48Z","links":{"resolver":"https://pith.science/pith/QPSLCLJ72JBKSRILS6KAOD3Z22","bundle":"https://pith.science/pith/QPSLCLJ72JBKSRILS6KAOD3Z22/bundle.json","state":"https://pith.science/pith/QPSLCLJ72JBKSRILS6KAOD3Z22/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QPSLCLJ72JBKSRILS6KAOD3Z22/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QPSLCLJ72JBKSRILS6KAOD3Z22","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":"ad8faf08b4bef5cf7213bb27d6bcfffb097ba19b7f2a6005e892d74f3ef2598a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-27T11:53:33Z","title_canon_sha256":"1045ea74e94b37bd74382d1a09ba94d4039821fe36cb11d77524d800a92453e8"},"schema_version":"1.0","source":{"id":"1811.10928","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10928","created_at":"2026-05-17T23:59:43Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10928v2","created_at":"2026-05-17T23:59:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10928","created_at":"2026-05-17T23:59:43Z"},{"alias_kind":"pith_short_12","alias_value":"QPSLCLJ72JBK","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QPSLCLJ72JBKSRIL","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QPSLCLJ7","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:5cfb4da2268efefcae4677528ccff27d23be44a27e1b86a2bb6127bd662ca963","target":"graph","created_at":"2026-05-17T23:59:43Z","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 introduce two novel tree search algorithms that use a policy to guide search. The first algorithm is a best-first enumeration that uses a cost function that allows us to prove an upper bound on the number of nodes to be expanded before reaching a goal state. We show that this best-first algorithm is particularly well suited for `needle-in-a-haystack' problems. The second algorithm is based on sampling and we prove an upper bound on the expected number of nodes it expands before reaching a set of goal states. We show that this algorithm is better suited for problems where many paths lead to ","authors_text":"Laurent Orseau, Levi H. S. Lelis, Th\\'eophane Weber, Tor Lattimore","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-27T11:53:33Z","title":"Single-Agent Policy Tree Search With Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10928","kind":"arxiv","version":2},"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:771ace0e7fd78187d9dd885d1f2c962253629b9296f34dddb419377fc1be48cb","target":"record","created_at":"2026-05-17T23:59:43Z","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":"ad8faf08b4bef5cf7213bb27d6bcfffb097ba19b7f2a6005e892d74f3ef2598a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-27T11:53:33Z","title_canon_sha256":"1045ea74e94b37bd74382d1a09ba94d4039821fe36cb11d77524d800a92453e8"},"schema_version":"1.0","source":{"id":"1811.10928","kind":"arxiv","version":2}},"canonical_sha256":"83e4b12d3fd242a9450b9794070f79d6bd0b6f4a5fb48804511d336a413316a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83e4b12d3fd242a9450b9794070f79d6bd0b6f4a5fb48804511d336a413316a2","first_computed_at":"2026-05-17T23:59:43.205721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:43.205721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Phmorw0DxB0KR9dm4/lpK+d1jkdKMiV393EgchueuC0VWTAlD1TDw6fsQNpgt7Q1BZ/QJMiOuRc5yr9m9VHUAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:43.206227Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10928","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:771ace0e7fd78187d9dd885d1f2c962253629b9296f34dddb419377fc1be48cb","sha256:5cfb4da2268efefcae4677528ccff27d23be44a27e1b86a2bb6127bd662ca963"],"state_sha256":"5641125fe34b7eb61b4325b78b55681b15de4428b4e92e29cd4fac2a60187fa9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+5wD0BBSxYqo4ql91QgQZFELXe1URQt9tkChWEPQPhTV3FJzW4DG5Xh/48RCH1hP05t6zgnvrWjfhnjBEfGvBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:04:48.303449Z","bundle_sha256":"a28f2c08eb4b74efcda2fb593e374998ebea3bc5817c898149275eed4bd1d628"}}