{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LZDHSWF2SMMLFYUGOFFCE4DJTS","short_pith_number":"pith:LZDHSWF2","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"},"canonical_sha256":"5e467958ba9318b2e286714a2270699c9ce54b0b9931a231d71991a627cb3537","source":{"kind":"arxiv","id":"1708.05296","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05296","created_at":"2026-05-18T00:37:53Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05296v1","created_at":"2026-05-18T00:37:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05296","created_at":"2026-05-18T00:37:53Z"},{"alias_kind":"pith_short_12","alias_value":"LZDHSWF2SMML","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LZDHSWF2SMMLFYUG","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LZDHSWF2","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LZDHSWF2SMMLFYUGOFFCE4DJTS","target":"record","payload":{"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"},"canonical_sha256":"5e467958ba9318b2e286714a2270699c9ce54b0b9931a231d71991a627cb3537","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"},"source_kind":"arxiv","source_id":"1708.05296","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-18T00:37:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9q1exxbapSizJa1Jkd8gVixTZcksVKt/m4+b4ampX4slk996xSISNJXrCY/+w6K3/pnldlHEeUdZPzLWwbJvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:25:11.933948Z"},"content_sha256":"e41bb7028c2f3e7954103ddfb3f302f22e6e2a705301b0e7b723139e88dcbac2","schema_version":"1.0","event_id":"sha256:e41bb7028c2f3e7954103ddfb3f302f22e6e2a705301b0e7b723139e88dcbac2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LZDHSWF2SMMLFYUGOFFCE4DJTS","target":"graph","payload":{"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"},"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-18T00:37:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOK4vS64Or+1o7bCzOrdJcwa0XzlcgzP0h1kWH9qNwr32t8u4bMyaeSRg5vUwKuNedx9SWwqiL2w6KBFmtDVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:25:11.934597Z"},"content_sha256":"e7ffab55412954dabce069155282d027a05afe223fac6673c4f96a19687c8b9d","schema_version":"1.0","event_id":"sha256:e7ffab55412954dabce069155282d027a05afe223fac6673c4f96a19687c8b9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZDHSWF2SMMLFYUGOFFCE4DJTS/bundle.json","state_url":"https://pith.science/pith/LZDHSWF2SMMLFYUGOFFCE4DJTS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZDHSWF2SMMLFYUGOFFCE4DJTS/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-06-05T08:25:11Z","links":{"resolver":"https://pith.science/pith/LZDHSWF2SMMLFYUGOFFCE4DJTS","bundle":"https://pith.science/pith/LZDHSWF2SMMLFYUGOFFCE4DJTS/bundle.json","state":"https://pith.science/pith/LZDHSWF2SMMLFYUGOFFCE4DJTS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZDHSWF2SMMLFYUGOFFCE4DJTS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LZDHSWF2SMMLFYUGOFFCE4DJTS","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":"10d1ab744782862bb5d3a08b9ee099a885ce4fde8f7ee12637bda723fe2695e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-16T01:45:40Z","title_canon_sha256":"b79deb486fab55f1184aac7dd756578116693242ed27e93fb174b95b5e616347"},"schema_version":"1.0","source":{"id":"1708.05296","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05296","created_at":"2026-05-18T00:37:53Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05296v1","created_at":"2026-05-18T00:37:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05296","created_at":"2026-05-18T00:37:53Z"},{"alias_kind":"pith_short_12","alias_value":"LZDHSWF2SMML","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LZDHSWF2SMMLFYUG","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LZDHSWF2","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:e7ffab55412954dabce069155282d027a05afe223fac6673c4f96a19687c8b9d","target":"graph","created_at":"2026-05-18T00:37:53Z","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":"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*.","authors_text":"Adi Botea, Akihiro Kishimoto, Alex Fukunaga, Yuu Jinnai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-16T01:45:40Z","title":"A Survey of Parallel A*"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05296","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:e41bb7028c2f3e7954103ddfb3f302f22e6e2a705301b0e7b723139e88dcbac2","target":"record","created_at":"2026-05-18T00:37:53Z","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":"10d1ab744782862bb5d3a08b9ee099a885ce4fde8f7ee12637bda723fe2695e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-16T01:45:40Z","title_canon_sha256":"b79deb486fab55f1184aac7dd756578116693242ed27e93fb174b95b5e616347"},"schema_version":"1.0","source":{"id":"1708.05296","kind":"arxiv","version":1}},"canonical_sha256":"5e467958ba9318b2e286714a2270699c9ce54b0b9931a231d71991a627cb3537","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e467958ba9318b2e286714a2270699c9ce54b0b9931a231d71991a627cb3537","first_computed_at":"2026-05-18T00:37:53.332031Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:53.332031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rCeDbuO/w/c6v/tsd3tKB9fX+W3z1dcTBNVlrQBB0Da7aO4x8OvXmDIxIP0cihjtlUXfag5r2g2f6BkHGmJhBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:53.332434Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05296","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e41bb7028c2f3e7954103ddfb3f302f22e6e2a705301b0e7b723139e88dcbac2","sha256:e7ffab55412954dabce069155282d027a05afe223fac6673c4f96a19687c8b9d"],"state_sha256":"b88502ca239ccca09dfdc886b61e0a14059089b2d5e50a3642d1e1259b1a2af1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IpcuVvAWWwTcnfvBHPspP2vcJOQv+FdFby25qCcEycRYny6i797r2Fk4dWUEa5L0hpmNxue2TG5Po+b2LbZZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:25:11.937059Z","bundle_sha256":"f75ed8294381585a69cd6f2befeb09c68f8170829a77c29d499494e94c8edf46"}}