{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LZDHSWF2SMMLFYUGOFFCE4DJTS","short_pith_number":"pith:LZDHSWF2","schema_version":"1.0","canonical_sha256":"5e467958ba9318b2e286714a2270699c9ce54b0b9931a231d71991a627cb3537","source":{"kind":"arxiv","id":"1708.05296","version":1},"attestation_state":"computed","paper":{"title":"A Survey of Parallel A*","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Adi Botea, Akihiro Kishimoto, Alex Fukunaga, Yuu Jinnai","submitted_at":"2017-08-16T01:45:40Z","abstract_excerpt":"A* is a best-first search algorithm for finding optimal-cost paths in graphs. A* benefits significantly from parallelism because in many applications, A* is limited by memory usage, so distributed memory implementations of A* that use all of the aggregate memory on the cluster enable problems that can not be solved by serial, single-machine implementations to be solved. We survey approaches to parallel A*, focusing on decentralized approaches to A* which partition the state space among processors. We also survey approaches to parallel, limited-memory variants of A* such as parallel IDA*."},"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":"1708.05296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-16T01:45:40Z","cross_cats_sorted":[],"title_canon_sha256":"b79deb486fab55f1184aac7dd756578116693242ed27e93fb174b95b5e616347","abstract_canon_sha256":"10d1ab744782862bb5d3a08b9ee099a885ce4fde8f7ee12637bda723fe2695e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:53.332434Z","signature_b64":"rCeDbuO/w/c6v/tsd3tKB9fX+W3z1dcTBNVlrQBB0Da7aO4x8OvXmDIxIP0cihjtlUXfag5r2g2f6BkHGmJhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e467958ba9318b2e286714a2270699c9ce54b0b9931a231d71991a627cb3537","last_reissued_at":"2026-05-18T00:37:53.332031Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:53.332031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Survey of Parallel A*","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Adi Botea, Akihiro Kishimoto, Alex Fukunaga, Yuu Jinnai","submitted_at":"2017-08-16T01:45:40Z","abstract_excerpt":"A* is a best-first search algorithm for finding optimal-cost paths in graphs. A* benefits significantly from parallelism because in many applications, A* is limited by memory usage, so distributed memory implementations of A* that use all of the aggregate memory on the cluster enable problems that can not be solved by serial, single-machine implementations to be solved. We survey approaches to parallel A*, focusing on decentralized approaches to A* which partition the state space among processors. We also survey approaches to parallel, limited-memory variants of A* such as parallel IDA*."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05296","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":"1708.05296","created_at":"2026-05-18T00:37:53.332088+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.05296v1","created_at":"2026-05-18T00:37:53.332088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05296","created_at":"2026-05-18T00:37:53.332088+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZDHSWF2SMML","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZDHSWF2SMMLFYUG","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZDHSWF2","created_at":"2026-05-18T12:31:28.150371+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/LZDHSWF2SMMLFYUGOFFCE4DJTS","json":"https://pith.science/pith/LZDHSWF2SMMLFYUGOFFCE4DJTS.json","graph_json":"https://pith.science/api/pith-number/LZDHSWF2SMMLFYUGOFFCE4DJTS/graph.json","events_json":"https://pith.science/api/pith-number/LZDHSWF2SMMLFYUGOFFCE4DJTS/events.json","paper":"https://pith.science/paper/LZDHSWF2"},"agent_actions":{"view_html":"https://pith.science/pith/LZDHSWF2SMMLFYUGOFFCE4DJTS","download_json":"https://pith.science/pith/LZDHSWF2SMMLFYUGOFFCE4DJTS.json","view_paper":"https://pith.science/paper/LZDHSWF2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.05296&json=true","fetch_graph":"https://pith.science/api/pith-number/LZDHSWF2SMMLFYUGOFFCE4DJTS/graph.json","fetch_events":"https://pith.science/api/pith-number/LZDHSWF2SMMLFYUGOFFCE4DJTS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZDHSWF2SMMLFYUGOFFCE4DJTS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZDHSWF2SMMLFYUGOFFCE4DJTS/action/storage_attestation","attest_author":"https://pith.science/pith/LZDHSWF2SMMLFYUGOFFCE4DJTS/action/author_attestation","sign_citation":"https://pith.science/pith/LZDHSWF2SMMLFYUGOFFCE4DJTS/action/citation_signature","submit_replication":"https://pith.science/pith/LZDHSWF2SMMLFYUGOFFCE4DJTS/action/replication_record"}},"created_at":"2026-05-18T00:37:53.332088+00:00","updated_at":"2026-05-18T00:37:53.332088+00:00"}