{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FJXRN3RDKDZUEXXWHWBFC2O2CE","short_pith_number":"pith:FJXRN3RD","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"},"canonical_sha256":"2a6f16ee2350f3425ef63d825169da1125aebc9d6887c9e52eae3a69d4073537","source":{"kind":"arxiv","id":"1201.3204","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3204","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3204v2","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3204","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"FJXRN3RDKDZU","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FJXRN3RDKDZUEXXW","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FJXRN3RD","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FJXRN3RDKDZUEXXWHWBFC2O2CE","target":"record","payload":{"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"},"canonical_sha256":"2a6f16ee2350f3425ef63d825169da1125aebc9d6887c9e52eae3a69d4073537","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"},"source_kind":"arxiv","source_id":"1201.3204","source_version":2,"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-18T02:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kcyJvQyRG/WKyVoXlgPpWCcv7M7kmv7PSfyVQnrJ2IEhzNyR6nt8CiSsKouw0iFKzl3879FgZgh/BAa3p0m+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:40:29.511629Z"},"content_sha256":"74306c149c9b398780f44c3ef54331f3b3acdee460f553f6f0752d26d503a97d","schema_version":"1.0","event_id":"sha256:74306c149c9b398780f44c3ef54331f3b3acdee460f553f6f0752d26d503a97d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FJXRN3RDKDZUEXXWHWBFC2O2CE","target":"graph","payload":{"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"},"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-18T02:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19FxQi7ndU3jmJf9urwTs6DZq42sUG4kx1/ldtX35HQyCoCipduvmv2lMQQGwszx90DENLCWf7siohCSCIAwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:40:29.512342Z"},"content_sha256":"7d434e9aa01780b7e14764a21c38777da78f1ba94ee5d8f187c2c38c89788967","schema_version":"1.0","event_id":"sha256:7d434e9aa01780b7e14764a21c38777da78f1ba94ee5d8f187c2c38c89788967"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJXRN3RDKDZUEXXWHWBFC2O2CE/bundle.json","state_url":"https://pith.science/pith/FJXRN3RDKDZUEXXWHWBFC2O2CE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJXRN3RDKDZUEXXWHWBFC2O2CE/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-08T17:40:29Z","links":{"resolver":"https://pith.science/pith/FJXRN3RDKDZUEXXWHWBFC2O2CE","bundle":"https://pith.science/pith/FJXRN3RDKDZUEXXWHWBFC2O2CE/bundle.json","state":"https://pith.science/pith/FJXRN3RDKDZUEXXWHWBFC2O2CE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJXRN3RDKDZUEXXWHWBFC2O2CE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FJXRN3RDKDZUEXXWHWBFC2O2CE","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":"8c732a52dde5a56519d5dddda45f83f52158159721e3ea9266e9265bf781b6f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-01-16T10:31:47Z","title_canon_sha256":"4627adaaf981e2d90c3285668cf17f71ae45e2eeaca2d5988f32b6d5c4b95ac7"},"schema_version":"1.0","source":{"id":"1201.3204","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3204","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3204v2","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3204","created_at":"2026-05-18T02:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"FJXRN3RDKDZU","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FJXRN3RDKDZUEXXW","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FJXRN3RD","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:7d434e9aa01780b7e14764a21c38777da78f1ba94ee5d8f187c2c38c89788967","target":"graph","created_at":"2026-05-18T02:21:18Z","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":"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","authors_text":"Adi Botea, Akihiro Kishimoto, Alex Fukunaga","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-01-16T10:31:47Z","title":"Evaluation of a Simple, Scalable, Parallel Best-First Search Strategy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3204","kind":"arxiv","version":2},"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:74306c149c9b398780f44c3ef54331f3b3acdee460f553f6f0752d26d503a97d","target":"record","created_at":"2026-05-18T02:21:18Z","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":"8c732a52dde5a56519d5dddda45f83f52158159721e3ea9266e9265bf781b6f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-01-16T10:31:47Z","title_canon_sha256":"4627adaaf981e2d90c3285668cf17f71ae45e2eeaca2d5988f32b6d5c4b95ac7"},"schema_version":"1.0","source":{"id":"1201.3204","kind":"arxiv","version":2}},"canonical_sha256":"2a6f16ee2350f3425ef63d825169da1125aebc9d6887c9e52eae3a69d4073537","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a6f16ee2350f3425ef63d825169da1125aebc9d6887c9e52eae3a69d4073537","first_computed_at":"2026-05-18T02:21:18.439844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:18.439844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ngi9m7wisXKeW8moJJlbb+E63ZcWjATGi2AftG5fCMTMDrIP/n71xQPVsIUJDdGA7jNuPdcLdWOM0nyzC0GqCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:18.440459Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.3204","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74306c149c9b398780f44c3ef54331f3b3acdee460f553f6f0752d26d503a97d","sha256:7d434e9aa01780b7e14764a21c38777da78f1ba94ee5d8f187c2c38c89788967"],"state_sha256":"7e9ba16e3595527c94a7413f835250b65b6a8520813d7ba1681447de2f32bc0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pS11+hP6QdDHEG7bEb/oHnaHmLks2Uv7CaRkTYT2DP5S3q0FzLKKHTN2HG9d3O46MrzSaVZhl+v2LxG7FhniBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:40:29.516057Z","bundle_sha256":"b65f8e12130fe49c18ed6a23ef289f0c42393f02755e89f1a08f14c39835a555"}}