{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZFPL6EFSSIJDOTU6VROXX3DJ4A","short_pith_number":"pith:ZFPL6EFS","canonical_record":{"source":{"id":"1411.6593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-24T20:04:20Z","cross_cats_sorted":[],"title_canon_sha256":"3fac53542ed655cee00121e97e43804a05d2a3d54d316432950433862fd8a951","abstract_canon_sha256":"0b722d742e5abd847a2d578877f7a11b61ff9203d3c820f7a2fd78bbf290da99"},"schema_version":"1.0"},"canonical_sha256":"c95ebf10b29212374e9eac5d7bec69e020c159f1759bb556556850c1b3c5a8c2","source":{"kind":"arxiv","id":"1411.6593","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6593","created_at":"2026-05-18T02:32:54Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6593v1","created_at":"2026-05-18T02:32:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6593","created_at":"2026-05-18T02:32:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZFPL6EFSSIJD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZFPL6EFSSIJDOTU6","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZFPL6EFS","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZFPL6EFSSIJDOTU6VROXX3DJ4A","target":"record","payload":{"canonical_record":{"source":{"id":"1411.6593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-24T20:04:20Z","cross_cats_sorted":[],"title_canon_sha256":"3fac53542ed655cee00121e97e43804a05d2a3d54d316432950433862fd8a951","abstract_canon_sha256":"0b722d742e5abd847a2d578877f7a11b61ff9203d3c820f7a2fd78bbf290da99"},"schema_version":"1.0"},"canonical_sha256":"c95ebf10b29212374e9eac5d7bec69e020c159f1759bb556556850c1b3c5a8c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:54.748996Z","signature_b64":"lbYEDQ6l/sdDmHbpmjf/DtbG7CRRlMgTTeQXg7rDyeFzdvRSucHmUEcW8BT8IHRj5bk3RlFFOXPsjlxD+rEDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c95ebf10b29212374e9eac5d7bec69e020c159f1759bb556556850c1b3c5a8c2","last_reissued_at":"2026-05-18T02:32:54.748619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:54.748619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.6593","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-18T02:32:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L6qLJzseD0z21Cm71pBdbIw5getzzFQtx0oi4msZPG0FFh4c/4P9xHQzr6/SBNbuoSXNferpDr/20WTtDgq1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:46:42.850074Z"},"content_sha256":"9f1861cf68cc9bf5e70ef92586f9bbedfc2f65bdac6c79f6902d8386780adcde","schema_version":"1.0","event_id":"sha256:9f1861cf68cc9bf5e70ef92586f9bbedfc2f65bdac6c79f6902d8386780adcde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZFPL6EFSSIJDOTU6VROXX3DJ4A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rational Deployment of Multiple Heuristics in IDA*","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ariel Felner, David Tolpin, Oded Betzalel, Solomon Eyal Shimony","submitted_at":"2014-11-24T20:04:20Z","abstract_excerpt":"Recent advances in metareasoning for search has shown its usefulness in improving numerous search algorithms. This paper applies rational metareasoning to IDA* when several admissible heuristics are available. The obvious basic approach of taking the maximum of the heuristics is improved upon by lazy evaluation of the heuristics, resulting in a variant known as Lazy IDA*. We introduce a rational version of lazy IDA* that decides whether to compute the more expensive heuristics or to bypass it, based on a myopic expected regret estimate. Empirical evaluation in several domains supports the theo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6593","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-18T02:32:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XLb8G3nzUB6ayzoGz3yCcCUYTniGpKWAxq/fsXCyhhmoafP0isrrAu3bzBrH2hPMHX+0phOPCnqFEfDGUBs9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:46:42.850762Z"},"content_sha256":"a8f7fc6ad0beadd1a2f36fcf76117b2646bf56420b1df08631ab3a9dda7f0c02","schema_version":"1.0","event_id":"sha256:a8f7fc6ad0beadd1a2f36fcf76117b2646bf56420b1df08631ab3a9dda7f0c02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZFPL6EFSSIJDOTU6VROXX3DJ4A/bundle.json","state_url":"https://pith.science/pith/ZFPL6EFSSIJDOTU6VROXX3DJ4A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZFPL6EFSSIJDOTU6VROXX3DJ4A/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-25T17:46:42Z","links":{"resolver":"https://pith.science/pith/ZFPL6EFSSIJDOTU6VROXX3DJ4A","bundle":"https://pith.science/pith/ZFPL6EFSSIJDOTU6VROXX3DJ4A/bundle.json","state":"https://pith.science/pith/ZFPL6EFSSIJDOTU6VROXX3DJ4A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZFPL6EFSSIJDOTU6VROXX3DJ4A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZFPL6EFSSIJDOTU6VROXX3DJ4A","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":"0b722d742e5abd847a2d578877f7a11b61ff9203d3c820f7a2fd78bbf290da99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-24T20:04:20Z","title_canon_sha256":"3fac53542ed655cee00121e97e43804a05d2a3d54d316432950433862fd8a951"},"schema_version":"1.0","source":{"id":"1411.6593","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6593","created_at":"2026-05-18T02:32:54Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6593v1","created_at":"2026-05-18T02:32:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6593","created_at":"2026-05-18T02:32:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZFPL6EFSSIJD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZFPL6EFSSIJDOTU6","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZFPL6EFS","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:a8f7fc6ad0beadd1a2f36fcf76117b2646bf56420b1df08631ab3a9dda7f0c02","target":"graph","created_at":"2026-05-18T02:32:54Z","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":"Recent advances in metareasoning for search has shown its usefulness in improving numerous search algorithms. This paper applies rational metareasoning to IDA* when several admissible heuristics are available. The obvious basic approach of taking the maximum of the heuristics is improved upon by lazy evaluation of the heuristics, resulting in a variant known as Lazy IDA*. We introduce a rational version of lazy IDA* that decides whether to compute the more expensive heuristics or to bypass it, based on a myopic expected regret estimate. Empirical evaluation in several domains supports the theo","authors_text":"Ariel Felner, David Tolpin, Oded Betzalel, Solomon Eyal Shimony","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-24T20:04:20Z","title":"Rational Deployment of Multiple Heuristics in IDA*"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6593","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:9f1861cf68cc9bf5e70ef92586f9bbedfc2f65bdac6c79f6902d8386780adcde","target":"record","created_at":"2026-05-18T02:32:54Z","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":"0b722d742e5abd847a2d578877f7a11b61ff9203d3c820f7a2fd78bbf290da99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-11-24T20:04:20Z","title_canon_sha256":"3fac53542ed655cee00121e97e43804a05d2a3d54d316432950433862fd8a951"},"schema_version":"1.0","source":{"id":"1411.6593","kind":"arxiv","version":1}},"canonical_sha256":"c95ebf10b29212374e9eac5d7bec69e020c159f1759bb556556850c1b3c5a8c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c95ebf10b29212374e9eac5d7bec69e020c159f1759bb556556850c1b3c5a8c2","first_computed_at":"2026-05-18T02:32:54.748619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:54.748619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lbYEDQ6l/sdDmHbpmjf/DtbG7CRRlMgTTeQXg7rDyeFzdvRSucHmUEcW8BT8IHRj5bk3RlFFOXPsjlxD+rEDCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:54.748996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6593","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f1861cf68cc9bf5e70ef92586f9bbedfc2f65bdac6c79f6902d8386780adcde","sha256:a8f7fc6ad0beadd1a2f36fcf76117b2646bf56420b1df08631ab3a9dda7f0c02"],"state_sha256":"55c3a432b4e11fccd7d59a514a0b86d6ee747454ba0030a358a6a79615d3d2c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x9bUxECetoqnzfhEp7yTvV6ezp7NHq09lLZl16uiOaO7bsTtJmdSc189UGQiwAJP0I5CAeaOV9AAOk4400N0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:46:42.854383Z","bundle_sha256":"6887e857fb678e8815b62c1fd7382f18ec36e2ce47e471fd611fdd260a110839"}}