{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XJ4RFYCQGDUJG5KG7KQ5I3SCKO","short_pith_number":"pith:XJ4RFYCQ","canonical_record":{"source":{"id":"1401.3861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:04:02Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2def3f7e892ec0c4ddc3b50399ac458ff34277013c5501e8e181f0ecc41ae234","abstract_canon_sha256":"cda40c6637e81e1374b2bd3d2b91560ee857a2a0d02384a98309df1a7c5b0c7b"},"schema_version":"1.0"},"canonical_sha256":"ba7912e05030e8937546faa1d46e425387df2e582d828438447a2fd1572ee26a","source":{"kind":"arxiv","id":"1401.3861","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3861","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3861v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3861","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"XJ4RFYCQGDUJ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XJ4RFYCQGDUJG5KG","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XJ4RFYCQ","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XJ4RFYCQGDUJG5KG7KQ5I3SCKO","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:04:02Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2def3f7e892ec0c4ddc3b50399ac458ff34277013c5501e8e181f0ecc41ae234","abstract_canon_sha256":"cda40c6637e81e1374b2bd3d2b91560ee857a2a0d02384a98309df1a7c5b0c7b"},"schema_version":"1.0"},"canonical_sha256":"ba7912e05030e8937546faa1d46e425387df2e582d828438447a2fd1572ee26a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.487273Z","signature_b64":"CCGvcz7KhsR8PSoxSfsMIUbWj79D9tFKzC9UszUC9vliJyp6qvrRWEUp6ulw1SvtXyAmXlZI9JnDV2JmwuNZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba7912e05030e8937546faa1d46e425387df2e582d828438447a2fd1572ee26a","last_reissued_at":"2026-05-18T03:02:06.486420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:06.486420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3861","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-18T03:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BEAciUfzFZ7VMB3blMzOrT6XW1HVstP+CiLVGoMZp7Ay7uaqOKzqBaZsZ9Pk4ItAJlyo7gybD2/ZKiZops8RBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:04:26.065896Z"},"content_sha256":"1a7f0b843f6263ca85267685e4731392f740285a1ceb604f330afbd1fa504ae9","schema_version":"1.0","event_id":"sha256:1a7f0b843f6263ca85267685e4731392f740285a1ceb604f330afbd1fa504ae9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XJ4RFYCQGDUJG5KG7KQ5I3SCKO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Best-First Heuristic Search for Multicore Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.AI","authors_text":"Ethan Burns, Rong Zhou, Sofia Lemons, Wheeler Ruml","submitted_at":"2014-01-16T05:04:02Z","abstract_excerpt":"To harness modern multicore processors, it is imperative to develop parallel versions of fundamental algorithms. In this paper, we compare different approaches to parallel best-first search in a shared-memory setting. We present a new method, PBNF, that uses abstraction to partition the state space and to detect duplicate states without requiring frequent locking. PBNF allows speculative expansions when necessary to keep threads busy. We identify and fix potential livelock conditions in our approach, proving its correctness using temporal logic. Our approach is general, allowing it to extend e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3861","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-18T03:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L4pgF0v6T8kPVSBYRODrF2gtTiCfHFTT7varITATb3HRIFn/OyvUjuPvWVoZD2ATK7lw11CZZP64qRUuKEV5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:04:26.066238Z"},"content_sha256":"36273384523d13dfe1de7e7c3a201871fde7b1e29268bacd5b0e2ee00ab99264","schema_version":"1.0","event_id":"sha256:36273384523d13dfe1de7e7c3a201871fde7b1e29268bacd5b0e2ee00ab99264"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XJ4RFYCQGDUJG5KG7KQ5I3SCKO/bundle.json","state_url":"https://pith.science/pith/XJ4RFYCQGDUJG5KG7KQ5I3SCKO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XJ4RFYCQGDUJG5KG7KQ5I3SCKO/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-08T10:04:26Z","links":{"resolver":"https://pith.science/pith/XJ4RFYCQGDUJG5KG7KQ5I3SCKO","bundle":"https://pith.science/pith/XJ4RFYCQGDUJG5KG7KQ5I3SCKO/bundle.json","state":"https://pith.science/pith/XJ4RFYCQGDUJG5KG7KQ5I3SCKO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XJ4RFYCQGDUJG5KG7KQ5I3SCKO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XJ4RFYCQGDUJG5KG7KQ5I3SCKO","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":"cda40c6637e81e1374b2bd3d2b91560ee857a2a0d02384a98309df1a7c5b0c7b","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:04:02Z","title_canon_sha256":"2def3f7e892ec0c4ddc3b50399ac458ff34277013c5501e8e181f0ecc41ae234"},"schema_version":"1.0","source":{"id":"1401.3861","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3861","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3861v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3861","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"XJ4RFYCQGDUJ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XJ4RFYCQGDUJG5KG","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XJ4RFYCQ","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:36273384523d13dfe1de7e7c3a201871fde7b1e29268bacd5b0e2ee00ab99264","target":"graph","created_at":"2026-05-18T03:02:06Z","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":"To harness modern multicore processors, it is imperative to develop parallel versions of fundamental algorithms. In this paper, we compare different approaches to parallel best-first search in a shared-memory setting. We present a new method, PBNF, that uses abstraction to partition the state space and to detect duplicate states without requiring frequent locking. PBNF allows speculative expansions when necessary to keep threads busy. We identify and fix potential livelock conditions in our approach, proving its correctness using temporal logic. Our approach is general, allowing it to extend e","authors_text":"Ethan Burns, Rong Zhou, Sofia Lemons, Wheeler Ruml","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:04:02Z","title":"Best-First Heuristic Search for Multicore Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3861","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:1a7f0b843f6263ca85267685e4731392f740285a1ceb604f330afbd1fa504ae9","target":"record","created_at":"2026-05-18T03:02:06Z","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":"cda40c6637e81e1374b2bd3d2b91560ee857a2a0d02384a98309df1a7c5b0c7b","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:04:02Z","title_canon_sha256":"2def3f7e892ec0c4ddc3b50399ac458ff34277013c5501e8e181f0ecc41ae234"},"schema_version":"1.0","source":{"id":"1401.3861","kind":"arxiv","version":1}},"canonical_sha256":"ba7912e05030e8937546faa1d46e425387df2e582d828438447a2fd1572ee26a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba7912e05030e8937546faa1d46e425387df2e582d828438447a2fd1572ee26a","first_computed_at":"2026-05-18T03:02:06.486420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:06.486420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CCGvcz7KhsR8PSoxSfsMIUbWj79D9tFKzC9UszUC9vliJyp6qvrRWEUp6ulw1SvtXyAmXlZI9JnDV2JmwuNZCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:06.487273Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3861","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a7f0b843f6263ca85267685e4731392f740285a1ceb604f330afbd1fa504ae9","sha256:36273384523d13dfe1de7e7c3a201871fde7b1e29268bacd5b0e2ee00ab99264"],"state_sha256":"3aa000acad0ad52c82434de55e228196bc9eeedbe07b9192bcb8fd27c1da44b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CZr+So2FHtn5K8uShVQVNawS7pPhFmVMEKSg4gdIl7yiiZ7MyfJ7h4bOeCENkOgi2sydSz3Yz8wwlZvd6eCZDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T10:04:26.068110Z","bundle_sha256":"48160a9996c5278b3f7fcf5baf153fbc96e6af0b50e910caa442f0573475342f"}}