{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NE2JA2ERVKMWMPMW4A6G2EE37V","short_pith_number":"pith:NE2JA2ER","canonical_record":{"source":{"id":"1706.03254","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-10T17:05:46Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0a9eafce7b200297867f4695785c09556a9d676a9d2b040b000f4b3d23182390","abstract_canon_sha256":"c67214a21bcbd7245906f62938555976ea91793eb220881076f06e4b2687c05a"},"schema_version":"1.0"},"canonical_sha256":"6934906891aa99663d96e03c6d109bfd79df04b354ec34aefea339cb7e8b5b85","source":{"kind":"arxiv","id":"1706.03254","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03254","created_at":"2026-05-18T00:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03254v2","created_at":"2026-05-18T00:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03254","created_at":"2026-05-18T00:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"NE2JA2ERVKMW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NE2JA2ERVKMWMPMW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NE2JA2ER","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NE2JA2ERVKMWMPMW4A6G2EE37V","target":"record","payload":{"canonical_record":{"source":{"id":"1706.03254","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-10T17:05:46Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0a9eafce7b200297867f4695785c09556a9d676a9d2b040b000f4b3d23182390","abstract_canon_sha256":"c67214a21bcbd7245906f62938555976ea91793eb220881076f06e4b2687c05a"},"schema_version":"1.0"},"canonical_sha256":"6934906891aa99663d96e03c6d109bfd79df04b354ec34aefea339cb7e8b5b85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:54.818895Z","signature_b64":"NCSpNk7C7T5q9JNYJjiKrjq62ubBFDcQBQ8xB6euRbs/z0psCWJFSHHLGfNkWcYeXD3lRodWtuBQt9Y9Bf97Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6934906891aa99663d96e03c6d109bfd79df04b354ec34aefea339cb7e8b5b85","last_reissued_at":"2026-05-18T00:30:54.818195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:54.818195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.03254","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-18T00:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"09Q+GpRPv6kcChspmawkPMfnQVc8Ka+SBr1QuTIc3VOQ9kG2a2jloDj8J8A4WpxZp1FpP8OFqO3rudHxxwaFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:48:42.940015Z"},"content_sha256":"eb92c020ebefb775afec655f74cd4f1aede0158a3d6876ec287aa1157d5e4536","schema_version":"1.0","event_id":"sha256:eb92c020ebefb775afec655f74cd4f1aede0158a3d6876ec287aa1157d5e4536"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NE2JA2ERVKMWMPMW4A6G2EE37V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Hash-Based Work Distribution Methods for Parallel Best-First Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.AI","authors_text":"Alex Fukunaga, Yuu Jinnai","submitted_at":"2017-06-10T17:05:46Z","abstract_excerpt":"Parallel best-first search algorithms such as Hash Distributed A* (HDA*) distribute work among the processes using a global hash function. We analyze the search and communication overheads of state-of-the-art hash-based parallel best-first search algorithms, and show that although Zobrist hashing, the standard hash function used by HDA*, achieves good load balance for many domains, it incurs significant communication overhead since almost all generated nodes are transferred to a different processor than their parents. We propose Abstract Zobrist hashing, a new work distribution method for para"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03254","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-18T00:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dw3YoyOWvel3QZNQmTD5t4/PgE57IPfCUjQzhxmVpyukOO9b3JNaI3B4eqmgiKD64cT2SqK+s2z/WfI3fEv9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:48:42.940416Z"},"content_sha256":"83749487601302fe98d080da8297bd333b94626f5f171c4764605bea95067072","schema_version":"1.0","event_id":"sha256:83749487601302fe98d080da8297bd333b94626f5f171c4764605bea95067072"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NE2JA2ERVKMWMPMW4A6G2EE37V/bundle.json","state_url":"https://pith.science/pith/NE2JA2ERVKMWMPMW4A6G2EE37V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NE2JA2ERVKMWMPMW4A6G2EE37V/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-05T17:48:42Z","links":{"resolver":"https://pith.science/pith/NE2JA2ERVKMWMPMW4A6G2EE37V","bundle":"https://pith.science/pith/NE2JA2ERVKMWMPMW4A6G2EE37V/bundle.json","state":"https://pith.science/pith/NE2JA2ERVKMWMPMW4A6G2EE37V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NE2JA2ERVKMWMPMW4A6G2EE37V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NE2JA2ERVKMWMPMW4A6G2EE37V","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":"c67214a21bcbd7245906f62938555976ea91793eb220881076f06e4b2687c05a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-10T17:05:46Z","title_canon_sha256":"0a9eafce7b200297867f4695785c09556a9d676a9d2b040b000f4b3d23182390"},"schema_version":"1.0","source":{"id":"1706.03254","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03254","created_at":"2026-05-18T00:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03254v2","created_at":"2026-05-18T00:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03254","created_at":"2026-05-18T00:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"NE2JA2ERVKMW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NE2JA2ERVKMWMPMW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NE2JA2ER","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:83749487601302fe98d080da8297bd333b94626f5f171c4764605bea95067072","target":"graph","created_at":"2026-05-18T00:30:54Z","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":"Parallel best-first search algorithms such as Hash Distributed A* (HDA*) distribute work among the processes using a global hash function. We analyze the search and communication overheads of state-of-the-art hash-based parallel best-first search algorithms, and show that although Zobrist hashing, the standard hash function used by HDA*, achieves good load balance for many domains, it incurs significant communication overhead since almost all generated nodes are transferred to a different processor than their parents. We propose Abstract Zobrist hashing, a new work distribution method for para","authors_text":"Alex Fukunaga, Yuu Jinnai","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-10T17:05:46Z","title":"On Hash-Based Work Distribution Methods for Parallel Best-First Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03254","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:eb92c020ebefb775afec655f74cd4f1aede0158a3d6876ec287aa1157d5e4536","target":"record","created_at":"2026-05-18T00:30:54Z","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":"c67214a21bcbd7245906f62938555976ea91793eb220881076f06e4b2687c05a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-10T17:05:46Z","title_canon_sha256":"0a9eafce7b200297867f4695785c09556a9d676a9d2b040b000f4b3d23182390"},"schema_version":"1.0","source":{"id":"1706.03254","kind":"arxiv","version":2}},"canonical_sha256":"6934906891aa99663d96e03c6d109bfd79df04b354ec34aefea339cb7e8b5b85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6934906891aa99663d96e03c6d109bfd79df04b354ec34aefea339cb7e8b5b85","first_computed_at":"2026-05-18T00:30:54.818195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:54.818195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NCSpNk7C7T5q9JNYJjiKrjq62ubBFDcQBQ8xB6euRbs/z0psCWJFSHHLGfNkWcYeXD3lRodWtuBQt9Y9Bf97Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:54.818895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03254","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb92c020ebefb775afec655f74cd4f1aede0158a3d6876ec287aa1157d5e4536","sha256:83749487601302fe98d080da8297bd333b94626f5f171c4764605bea95067072"],"state_sha256":"d6ab558133115ef484ea7f2fc0da91e6a73972c650854811a723c2e4d7cd8f8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qZKjlcrNmykYDnXP2fyyXDkkXc9Z1EJ6t8wN6PS5aAImIEfW5JLEEAUB6t7rOZtpcsDlHYXwJDlQ3U9rGm+NBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T17:48:42.942785Z","bundle_sha256":"13f5ce36ea1f085a02fd1c2e007fb36016fdc093b8a57f530421a28bbd804eca"}}