{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LEF2B4CZQVPP5XN6OYVTHILNSY","short_pith_number":"pith:LEF2B4CZ","canonical_record":{"source":{"id":"1110.2737","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-12T18:21:59Z","cross_cats_sorted":[],"title_canon_sha256":"2c313c5bb61b6b165f847b333bd1da5f6d2f6353d70bd1f7fb33b500f851768f","abstract_canon_sha256":"2492836f597daa1f9798ae69f93fc5d756f451f967423ab4727c69f0e7af9b41"},"schema_version":"1.0"},"canonical_sha256":"590ba0f059855efeddbe762b33a16d96157a2f0fbf211aac2bce400eb831e405","source":{"kind":"arxiv","id":"1110.2737","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2737","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2737v1","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2737","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"pith_short_12","alias_value":"LEF2B4CZQVPP","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LEF2B4CZQVPP5XN6","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LEF2B4CZ","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LEF2B4CZQVPP5XN6OYVTHILNSY","target":"record","payload":{"canonical_record":{"source":{"id":"1110.2737","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-12T18:21:59Z","cross_cats_sorted":[],"title_canon_sha256":"2c313c5bb61b6b165f847b333bd1da5f6d2f6353d70bd1f7fb33b500f851768f","abstract_canon_sha256":"2492836f597daa1f9798ae69f93fc5d756f451f967423ab4727c69f0e7af9b41"},"schema_version":"1.0"},"canonical_sha256":"590ba0f059855efeddbe762b33a16d96157a2f0fbf211aac2bce400eb831e405","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:07.622458Z","signature_b64":"lEas0wuvYa8xk+Fl9chwAVSiuzqSI5eqJ5HdrVUHPdP3aTpXsUPjl0hox3z3oujgRnJNknZsawe3ObdX+AO3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"590ba0f059855efeddbe762b33a16d96157a2f0fbf211aac2bce400eb831e405","last_reissued_at":"2026-05-18T04:11:07.621927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:07.621927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.2737","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-18T04:11:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lmOU660ApHxSSSm39VwokqHXGa42dkFVCSy1knM7Fvi6HPP9Q90RVQJlvdx8TL+VQqBirsxkpZ5D41uzJk4rAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:35:55.919683Z"},"content_sha256":"f092be4eabc96f4ca7917d91beabbfad5d0aaa2b67f0ae1543e17969717aea4c","schema_version":"1.0","event_id":"sha256:f092be4eabc96f4ca7917d91beabbfad5d0aaa2b67f0ae1543e17969717aea4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LEF2B4CZQVPP5XN6OYVTHILNSY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anytime Heuristic Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"E. A. Hansen, R. Zhou","submitted_at":"2011-10-12T18:21:59Z","abstract_excerpt":"We describe how to convert the heuristic search algorithm A* into an anytime algorithm that finds a sequence of improved solutions and eventually converges to an optimal solution. The approach we adopt uses weighted heuristic search to find an approximate solution quickly, and then continues the weighted search to find improved solutions as well as to improve a bound on the suboptimality of the current solution. When the time available to solve a search problem is limited or uncertain, this creates an anytime heuristic search algorithm that allows a flexible tradeoff between search time and so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2737","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-18T04:11:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/DWy+jdBHHa+LAiTkr5Vx/Q7XwPRUS7pZcbcEUnH0RvjRGLl2q2xy7gleGs6l1zd+TjYyx8JQ9PrFUHSHkqTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:35:55.920381Z"},"content_sha256":"4dd839857cae5abf0b8a938ee1f5e882617bc45f38e212e9ed8cbdff9035383d","schema_version":"1.0","event_id":"sha256:4dd839857cae5abf0b8a938ee1f5e882617bc45f38e212e9ed8cbdff9035383d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LEF2B4CZQVPP5XN6OYVTHILNSY/bundle.json","state_url":"https://pith.science/pith/LEF2B4CZQVPP5XN6OYVTHILNSY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LEF2B4CZQVPP5XN6OYVTHILNSY/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-06-09T19:35:55Z","links":{"resolver":"https://pith.science/pith/LEF2B4CZQVPP5XN6OYVTHILNSY","bundle":"https://pith.science/pith/LEF2B4CZQVPP5XN6OYVTHILNSY/bundle.json","state":"https://pith.science/pith/LEF2B4CZQVPP5XN6OYVTHILNSY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LEF2B4CZQVPP5XN6OYVTHILNSY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LEF2B4CZQVPP5XN6OYVTHILNSY","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":"2492836f597daa1f9798ae69f93fc5d756f451f967423ab4727c69f0e7af9b41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-12T18:21:59Z","title_canon_sha256":"2c313c5bb61b6b165f847b333bd1da5f6d2f6353d70bd1f7fb33b500f851768f"},"schema_version":"1.0","source":{"id":"1110.2737","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2737","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2737v1","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2737","created_at":"2026-05-18T04:11:07Z"},{"alias_kind":"pith_short_12","alias_value":"LEF2B4CZQVPP","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LEF2B4CZQVPP5XN6","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LEF2B4CZ","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:4dd839857cae5abf0b8a938ee1f5e882617bc45f38e212e9ed8cbdff9035383d","target":"graph","created_at":"2026-05-18T04:11:07Z","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 describe how to convert the heuristic search algorithm A* into an anytime algorithm that finds a sequence of improved solutions and eventually converges to an optimal solution. The approach we adopt uses weighted heuristic search to find an approximate solution quickly, and then continues the weighted search to find improved solutions as well as to improve a bound on the suboptimality of the current solution. When the time available to solve a search problem is limited or uncertain, this creates an anytime heuristic search algorithm that allows a flexible tradeoff between search time and so","authors_text":"E. A. Hansen, R. Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-12T18:21:59Z","title":"Anytime Heuristic Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2737","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:f092be4eabc96f4ca7917d91beabbfad5d0aaa2b67f0ae1543e17969717aea4c","target":"record","created_at":"2026-05-18T04:11:07Z","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":"2492836f597daa1f9798ae69f93fc5d756f451f967423ab4727c69f0e7af9b41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-12T18:21:59Z","title_canon_sha256":"2c313c5bb61b6b165f847b333bd1da5f6d2f6353d70bd1f7fb33b500f851768f"},"schema_version":"1.0","source":{"id":"1110.2737","kind":"arxiv","version":1}},"canonical_sha256":"590ba0f059855efeddbe762b33a16d96157a2f0fbf211aac2bce400eb831e405","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"590ba0f059855efeddbe762b33a16d96157a2f0fbf211aac2bce400eb831e405","first_computed_at":"2026-05-18T04:11:07.621927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:07.621927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lEas0wuvYa8xk+Fl9chwAVSiuzqSI5eqJ5HdrVUHPdP3aTpXsUPjl0hox3z3oujgRnJNknZsawe3ObdX+AO3Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:07.622458Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.2737","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f092be4eabc96f4ca7917d91beabbfad5d0aaa2b67f0ae1543e17969717aea4c","sha256:4dd839857cae5abf0b8a938ee1f5e882617bc45f38e212e9ed8cbdff9035383d"],"state_sha256":"8cc65606812f8136203b72b04359e57bfb8b4dc66ecb279e92d2fd68f1d53647"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVWIqWYQvGOKExWuVSE5I1ALaHjxmxdYS1UeEacFDYLlClDeTB9J7XGnlUKOhr+qfg9ex3XZbg7BcpFXNfCVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:35:55.924134Z","bundle_sha256":"11af824964b5e6ed7cfdf92cbf1a6d5507a8aa86282cbdc5d269d827f5101fa1"}}