{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LT2VN4KLV7AMTUTJH6XJTTBGXZ","short_pith_number":"pith:LT2VN4KL","schema_version":"1.0","canonical_sha256":"5cf556f14bafc0c9d2693fae99cc26be53aac22976875961f21122bc4ff843d4","source":{"kind":"arxiv","id":"1401.3493","version":1},"attestation_state":"computed","paper":{"title":"Predicting the Performance of IDA* using Conditional Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ariel Felner, Neil Burch, Robert C. Holte, Uzi Zahavi","submitted_at":"2014-01-15T05:41:44Z","abstract_excerpt":"Korf, Reid, and Edelkamp introduced a formula to predict the number of nodes IDA* will expand on a single iteration for a given consistent heuristic, and experimentally demonstrated that it could make very accurate predictions. In this paper we show that, in addition to requiring the heuristic to be consistent, their formulas predictions are accurate only at levels of the brute-force search tree where the heuristic values obey the unconditional distribution that they defined and then used in their formula. We then propose a new formula that works well without these requirements, i.e., it can  "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1401.3493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:41:44Z","cross_cats_sorted":[],"title_canon_sha256":"79ef508db6a552581419bafac505c08252ec785e12c53a512692902ae50d4eaa","abstract_canon_sha256":"71d6b01f6fb66b99c08e1e74b2516d1689c428755a85b4368158829df000a98b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:08.640204Z","signature_b64":"J742Urx0jQA0YhLH5ojJkm08/HPQQSLjauO7c2atmweIRto/TGKppFavcrlJaJTUFAGLsA+MLp56+4UwWBO/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cf556f14bafc0c9d2693fae99cc26be53aac22976875961f21122bc4ff843d4","last_reissued_at":"2026-05-18T03:02:08.639556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:08.639556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predicting the Performance of IDA* using Conditional Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ariel Felner, Neil Burch, Robert C. Holte, Uzi Zahavi","submitted_at":"2014-01-15T05:41:44Z","abstract_excerpt":"Korf, Reid, and Edelkamp introduced a formula to predict the number of nodes IDA* will expand on a single iteration for a given consistent heuristic, and experimentally demonstrated that it could make very accurate predictions. In this paper we show that, in addition to requiring the heuristic to be consistent, their formulas predictions are accurate only at levels of the brute-force search tree where the heuristic values obey the unconditional distribution that they defined and then used in their formula. We then propose a new formula that works well without these requirements, i.e., it can  "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3493","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.3493","created_at":"2026-05-18T03:02:08.639656+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3493v1","created_at":"2026-05-18T03:02:08.639656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3493","created_at":"2026-05-18T03:02:08.639656+00:00"},{"alias_kind":"pith_short_12","alias_value":"LT2VN4KLV7AM","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LT2VN4KLV7AMTUTJ","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LT2VN4KL","created_at":"2026-05-18T12:28:38.356838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LT2VN4KLV7AMTUTJH6XJTTBGXZ","json":"https://pith.science/pith/LT2VN4KLV7AMTUTJH6XJTTBGXZ.json","graph_json":"https://pith.science/api/pith-number/LT2VN4KLV7AMTUTJH6XJTTBGXZ/graph.json","events_json":"https://pith.science/api/pith-number/LT2VN4KLV7AMTUTJH6XJTTBGXZ/events.json","paper":"https://pith.science/paper/LT2VN4KL"},"agent_actions":{"view_html":"https://pith.science/pith/LT2VN4KLV7AMTUTJH6XJTTBGXZ","download_json":"https://pith.science/pith/LT2VN4KLV7AMTUTJH6XJTTBGXZ.json","view_paper":"https://pith.science/paper/LT2VN4KL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3493&json=true","fetch_graph":"https://pith.science/api/pith-number/LT2VN4KLV7AMTUTJH6XJTTBGXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/LT2VN4KLV7AMTUTJH6XJTTBGXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LT2VN4KLV7AMTUTJH6XJTTBGXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LT2VN4KLV7AMTUTJH6XJTTBGXZ/action/storage_attestation","attest_author":"https://pith.science/pith/LT2VN4KLV7AMTUTJH6XJTTBGXZ/action/author_attestation","sign_citation":"https://pith.science/pith/LT2VN4KLV7AMTUTJH6XJTTBGXZ/action/citation_signature","submit_replication":"https://pith.science/pith/LT2VN4KLV7AMTUTJH6XJTTBGXZ/action/replication_record"}},"created_at":"2026-05-18T03:02:08.639656+00:00","updated_at":"2026-05-18T03:02:08.639656+00:00"}