{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NE2JA2ERVKMWMPMW4A6G2EE37V","short_pith_number":"pith:NE2JA2ER","schema_version":"1.0","canonical_sha256":"6934906891aa99663d96e03c6d109bfd79df04b354ec34aefea339cb7e8b5b85","source":{"kind":"arxiv","id":"1706.03254","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.03254","created_at":"2026-05-18T00:30:54.818311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03254v2","created_at":"2026-05-18T00:30:54.818311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03254","created_at":"2026-05-18T00:30:54.818311+00:00"},{"alias_kind":"pith_short_12","alias_value":"NE2JA2ERVKMW","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NE2JA2ERVKMWMPMW","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NE2JA2ER","created_at":"2026-05-18T12:31:31.346846+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/NE2JA2ERVKMWMPMW4A6G2EE37V","json":"https://pith.science/pith/NE2JA2ERVKMWMPMW4A6G2EE37V.json","graph_json":"https://pith.science/api/pith-number/NE2JA2ERVKMWMPMW4A6G2EE37V/graph.json","events_json":"https://pith.science/api/pith-number/NE2JA2ERVKMWMPMW4A6G2EE37V/events.json","paper":"https://pith.science/paper/NE2JA2ER"},"agent_actions":{"view_html":"https://pith.science/pith/NE2JA2ERVKMWMPMW4A6G2EE37V","download_json":"https://pith.science/pith/NE2JA2ERVKMWMPMW4A6G2EE37V.json","view_paper":"https://pith.science/paper/NE2JA2ER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03254&json=true","fetch_graph":"https://pith.science/api/pith-number/NE2JA2ERVKMWMPMW4A6G2EE37V/graph.json","fetch_events":"https://pith.science/api/pith-number/NE2JA2ERVKMWMPMW4A6G2EE37V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NE2JA2ERVKMWMPMW4A6G2EE37V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NE2JA2ERVKMWMPMW4A6G2EE37V/action/storage_attestation","attest_author":"https://pith.science/pith/NE2JA2ERVKMWMPMW4A6G2EE37V/action/author_attestation","sign_citation":"https://pith.science/pith/NE2JA2ERVKMWMPMW4A6G2EE37V/action/citation_signature","submit_replication":"https://pith.science/pith/NE2JA2ERVKMWMPMW4A6G2EE37V/action/replication_record"}},"created_at":"2026-05-18T00:30:54.818311+00:00","updated_at":"2026-05-18T00:30:54.818311+00:00"}