{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NYJZPI3HXIAWJ47MLZHE6OYU37","short_pith_number":"pith:NYJZPI3H","schema_version":"1.0","canonical_sha256":"6e1397a367ba0164f3ec5e4e4f3b14dfdf61f189916b906e83bc804ef5292bd3","source":{"kind":"arxiv","id":"1301.6708","version":1},"attestation_state":"computed","paper":{"title":"Mini-Bucket Heuristics for Improved Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Kalev Kask, Rina Dechter","submitted_at":"2013-01-23T15:58:54Z","abstract_excerpt":"The paper is a second in a series of two papers evaluating the power of a new scheme that generates search heuristics mechanically. The heuristics are extracted from an approximation scheme called mini-bucket elimination that was recently introduced. The first paper introduced the idea and evaluated it within Branch-and-Bound search. In the current paper the idea is further extended and evaluated within Best-First search. The resulting algorithms are compared on coding and medical diagnosis problems, using varying strength of the mini-bucket heuristics.\n Our results demonstrate an effective se"},"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":"1301.6708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-23T15:58:54Z","cross_cats_sorted":[],"title_canon_sha256":"37751d9b731c9232105029291aa7e548f804ca2886a94dd991cda1c41f52c15a","abstract_canon_sha256":"c2971ff2a0e650df520d2390e2af92f485f0ff8974ec0d8041fd7a30f0a49f62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:12.832598Z","signature_b64":"qL3F76mge/DftSlyaBleZluqbbt9rvoyMWVheyFi1Zl9JT6G1AXq/IEd7ZcSc/8HgMJwIPO/lvPOokXqAiAWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e1397a367ba0164f3ec5e4e4f3b14dfdf61f189916b906e83bc804ef5292bd3","last_reissued_at":"2026-05-18T03:35:12.832005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:12.832005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mini-Bucket Heuristics for Improved Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Kalev Kask, Rina Dechter","submitted_at":"2013-01-23T15:58:54Z","abstract_excerpt":"The paper is a second in a series of two papers evaluating the power of a new scheme that generates search heuristics mechanically. The heuristics are extracted from an approximation scheme called mini-bucket elimination that was recently introduced. The first paper introduced the idea and evaluated it within Branch-and-Bound search. In the current paper the idea is further extended and evaluated within Best-First search. The resulting algorithms are compared on coding and medical diagnosis problems, using varying strength of the mini-bucket heuristics.\n Our results demonstrate an effective se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6708","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":"1301.6708","created_at":"2026-05-18T03:35:12.832106+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6708v1","created_at":"2026-05-18T03:35:12.832106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6708","created_at":"2026-05-18T03:35:12.832106+00:00"},{"alias_kind":"pith_short_12","alias_value":"NYJZPI3HXIAW","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NYJZPI3HXIAWJ47M","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NYJZPI3H","created_at":"2026-05-18T12:27:52.871228+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/NYJZPI3HXIAWJ47MLZHE6OYU37","json":"https://pith.science/pith/NYJZPI3HXIAWJ47MLZHE6OYU37.json","graph_json":"https://pith.science/api/pith-number/NYJZPI3HXIAWJ47MLZHE6OYU37/graph.json","events_json":"https://pith.science/api/pith-number/NYJZPI3HXIAWJ47MLZHE6OYU37/events.json","paper":"https://pith.science/paper/NYJZPI3H"},"agent_actions":{"view_html":"https://pith.science/pith/NYJZPI3HXIAWJ47MLZHE6OYU37","download_json":"https://pith.science/pith/NYJZPI3HXIAWJ47MLZHE6OYU37.json","view_paper":"https://pith.science/paper/NYJZPI3H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6708&json=true","fetch_graph":"https://pith.science/api/pith-number/NYJZPI3HXIAWJ47MLZHE6OYU37/graph.json","fetch_events":"https://pith.science/api/pith-number/NYJZPI3HXIAWJ47MLZHE6OYU37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NYJZPI3HXIAWJ47MLZHE6OYU37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NYJZPI3HXIAWJ47MLZHE6OYU37/action/storage_attestation","attest_author":"https://pith.science/pith/NYJZPI3HXIAWJ47MLZHE6OYU37/action/author_attestation","sign_citation":"https://pith.science/pith/NYJZPI3HXIAWJ47MLZHE6OYU37/action/citation_signature","submit_replication":"https://pith.science/pith/NYJZPI3HXIAWJ47MLZHE6OYU37/action/replication_record"}},"created_at":"2026-05-18T03:35:12.832106+00:00","updated_at":"2026-05-18T03:35:12.832106+00:00"}