{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FJXRN3RDKDZUEXXWHWBFC2O2CE","short_pith_number":"pith:FJXRN3RD","schema_version":"1.0","canonical_sha256":"2a6f16ee2350f3425ef63d825169da1125aebc9d6887c9e52eae3a69d4073537","source":{"kind":"arxiv","id":"1201.3204","version":2},"attestation_state":"computed","paper":{"title":"Evaluation of a Simple, Scalable, Parallel Best-First Search Strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Adi Botea, Akihiro Kishimoto, Alex Fukunaga","submitted_at":"2012-01-16T10:31:47Z","abstract_excerpt":"Large-scale, parallel clusters composed of commodity processors are increasingly available, enabling the use of vast processing capabilities and distributed RAM to solve hard search problems. We investigate Hash-Distributed A* (HDA*), a simple approach to parallel best-first search that asynchronously distributes and schedules work among processors based on a hash function of the search state. We use this approach to parallelize the A* algorithm in an optimal sequential version of the Fast Downward planner, as well as a 24-puzzle solver. The scaling behavior of HDA* is evaluated experimentally"},"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":"1201.3204","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-01-16T10:31:47Z","cross_cats_sorted":[],"title_canon_sha256":"4627adaaf981e2d90c3285668cf17f71ae45e2eeaca2d5988f32b6d5c4b95ac7","abstract_canon_sha256":"8c732a52dde5a56519d5dddda45f83f52158159721e3ea9266e9265bf781b6f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:18.440459Z","signature_b64":"ngi9m7wisXKeW8moJJlbb+E63ZcWjATGi2AftG5fCMTMDrIP/n71xQPVsIUJDdGA7jNuPdcLdWOM0nyzC0GqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a6f16ee2350f3425ef63d825169da1125aebc9d6887c9e52eae3a69d4073537","last_reissued_at":"2026-05-18T02:21:18.439844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:18.439844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evaluation of a Simple, Scalable, Parallel Best-First Search Strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Adi Botea, Akihiro Kishimoto, Alex Fukunaga","submitted_at":"2012-01-16T10:31:47Z","abstract_excerpt":"Large-scale, parallel clusters composed of commodity processors are increasingly available, enabling the use of vast processing capabilities and distributed RAM to solve hard search problems. We investigate Hash-Distributed A* (HDA*), a simple approach to parallel best-first search that asynchronously distributes and schedules work among processors based on a hash function of the search state. We use this approach to parallelize the A* algorithm in an optimal sequential version of the Fast Downward planner, as well as a 24-puzzle solver. The scaling behavior of HDA* is evaluated experimentally"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3204","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.3204","created_at":"2026-05-18T02:21:18.439925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.3204v2","created_at":"2026-05-18T02:21:18.439925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3204","created_at":"2026-05-18T02:21:18.439925+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJXRN3RDKDZU","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJXRN3RDKDZUEXXW","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJXRN3RD","created_at":"2026-05-18T12:27:06.952714+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/FJXRN3RDKDZUEXXWHWBFC2O2CE","json":"https://pith.science/pith/FJXRN3RDKDZUEXXWHWBFC2O2CE.json","graph_json":"https://pith.science/api/pith-number/FJXRN3RDKDZUEXXWHWBFC2O2CE/graph.json","events_json":"https://pith.science/api/pith-number/FJXRN3RDKDZUEXXWHWBFC2O2CE/events.json","paper":"https://pith.science/paper/FJXRN3RD"},"agent_actions":{"view_html":"https://pith.science/pith/FJXRN3RDKDZUEXXWHWBFC2O2CE","download_json":"https://pith.science/pith/FJXRN3RDKDZUEXXWHWBFC2O2CE.json","view_paper":"https://pith.science/paper/FJXRN3RD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.3204&json=true","fetch_graph":"https://pith.science/api/pith-number/FJXRN3RDKDZUEXXWHWBFC2O2CE/graph.json","fetch_events":"https://pith.science/api/pith-number/FJXRN3RDKDZUEXXWHWBFC2O2CE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJXRN3RDKDZUEXXWHWBFC2O2CE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJXRN3RDKDZUEXXWHWBFC2O2CE/action/storage_attestation","attest_author":"https://pith.science/pith/FJXRN3RDKDZUEXXWHWBFC2O2CE/action/author_attestation","sign_citation":"https://pith.science/pith/FJXRN3RDKDZUEXXWHWBFC2O2CE/action/citation_signature","submit_replication":"https://pith.science/pith/FJXRN3RDKDZUEXXWHWBFC2O2CE/action/replication_record"}},"created_at":"2026-05-18T02:21:18.439925+00:00","updated_at":"2026-05-18T02:21:18.439925+00:00"}