{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QUC7G7FENXTPDFLPOYWLD7UBHF","short_pith_number":"pith:QUC7G7FE","canonical_record":{"source":{"id":"1703.03868","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-10T23:19:50Z","cross_cats_sorted":[],"title_canon_sha256":"a9677528af6d2601ace075c4d301d0ce9c14c03688af89a0b68a500b0be8dc25","abstract_canon_sha256":"57e1c84c6dcbb957a56bfb6ace215d77d9c68705a9b938472ee86011e2c50dc0"},"schema_version":"1.0"},"canonical_sha256":"8505f37ca46de6f1956f762cb1fe813945015fdb049f884d437e8435033f12aa","source":{"kind":"arxiv","id":"1703.03868","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03868","created_at":"2026-05-18T00:43:53Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03868v2","created_at":"2026-05-18T00:43:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03868","created_at":"2026-05-18T00:43:53Z"},{"alias_kind":"pith_short_12","alias_value":"QUC7G7FENXTP","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QUC7G7FENXTPDFLP","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QUC7G7FE","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QUC7G7FENXTPDFLPOYWLD7UBHF","target":"record","payload":{"canonical_record":{"source":{"id":"1703.03868","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-10T23:19:50Z","cross_cats_sorted":[],"title_canon_sha256":"a9677528af6d2601ace075c4d301d0ce9c14c03688af89a0b68a500b0be8dc25","abstract_canon_sha256":"57e1c84c6dcbb957a56bfb6ace215d77d9c68705a9b938472ee86011e2c50dc0"},"schema_version":"1.0"},"canonical_sha256":"8505f37ca46de6f1956f762cb1fe813945015fdb049f884d437e8435033f12aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:53.704604Z","signature_b64":"TApOJDBdVyXCxJ1o+sb3frkoKgpjSPlnP+8ku3aLO8Lk75Gqzx+wY5rxaziYPMQslx1IbpIRnHPVt9iCUTJsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8505f37ca46de6f1956f762cb1fe813945015fdb049f884d437e8435033f12aa","last_reissued_at":"2026-05-18T00:43:53.703874Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:53.703874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.03868","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:43:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ercAYyQHbRtnsibtUYKyNPCW1+imLgF51mGftHyB8E8Sl4DQkvGUJ/sLy0F3qOwZzVLxyAgoKG76KtDaFXkpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:52:01.280199Z"},"content_sha256":"4da707c5bc2d2cc9bb88ff54f347d122998d64aa65f31b90e342305b3027738f","schema_version":"1.0","event_id":"sha256:4da707c5bc2d2cc9bb88ff54f347d122998d64aa65f31b90e342305b3027738f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QUC7G7FENXTPDFLPOYWLD7UBHF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jingwei Chen, Nathan R. Sturtevant, Robert C. Holte, Sandra Zilles","submitted_at":"2017-03-10T23:19:50Z","abstract_excerpt":"It is well-known that any admissible unidirectional heuristic search algorithm must expand all states whose $f$-value is smaller than the optimal solution cost when using a consistent heuristic. Such states are called \"surely expanded\" (s.e.). A recent study characterized s.e. pairs of states for bidirectional search with consistent heuristics: if a pair of states is s.e. then at least one of the two states must be expanded. This paper derives a lower bound, VC, on the minimum number of expansions required to cover all s.e. pairs, and present a new admissible front-to-end bidirectional heurist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03868","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:43:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4/4WGbL4DwARIwE68LEbsdOMJD9OKV2WRlOhLReQ4uo3wdU8sIaBjbEHQp/Y8TAzUSxPvCl3xSqTpea/Co4vBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:52:01.280573Z"},"content_sha256":"b8fadc2f3fe819e4b8f121a7a490d72a2448fa4c520f6a823afbc1023bf3451b","schema_version":"1.0","event_id":"sha256:b8fadc2f3fe819e4b8f121a7a490d72a2448fa4c520f6a823afbc1023bf3451b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUC7G7FENXTPDFLPOYWLD7UBHF/bundle.json","state_url":"https://pith.science/pith/QUC7G7FENXTPDFLPOYWLD7UBHF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUC7G7FENXTPDFLPOYWLD7UBHF/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-05-30T23:52:01Z","links":{"resolver":"https://pith.science/pith/QUC7G7FENXTPDFLPOYWLD7UBHF","bundle":"https://pith.science/pith/QUC7G7FENXTPDFLPOYWLD7UBHF/bundle.json","state":"https://pith.science/pith/QUC7G7FENXTPDFLPOYWLD7UBHF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUC7G7FENXTPDFLPOYWLD7UBHF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QUC7G7FENXTPDFLPOYWLD7UBHF","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":"57e1c84c6dcbb957a56bfb6ace215d77d9c68705a9b938472ee86011e2c50dc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-10T23:19:50Z","title_canon_sha256":"a9677528af6d2601ace075c4d301d0ce9c14c03688af89a0b68a500b0be8dc25"},"schema_version":"1.0","source":{"id":"1703.03868","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03868","created_at":"2026-05-18T00:43:53Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03868v2","created_at":"2026-05-18T00:43:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03868","created_at":"2026-05-18T00:43:53Z"},{"alias_kind":"pith_short_12","alias_value":"QUC7G7FENXTP","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QUC7G7FENXTPDFLP","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QUC7G7FE","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:b8fadc2f3fe819e4b8f121a7a490d72a2448fa4c520f6a823afbc1023bf3451b","target":"graph","created_at":"2026-05-18T00:43: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":"It is well-known that any admissible unidirectional heuristic search algorithm must expand all states whose $f$-value is smaller than the optimal solution cost when using a consistent heuristic. Such states are called \"surely expanded\" (s.e.). A recent study characterized s.e. pairs of states for bidirectional search with consistent heuristics: if a pair of states is s.e. then at least one of the two states must be expanded. This paper derives a lower bound, VC, on the minimum number of expansions required to cover all s.e. pairs, and present a new admissible front-to-end bidirectional heurist","authors_text":"Jingwei Chen, Nathan R. Sturtevant, Robert C. Holte, Sandra Zilles","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-10T23:19:50Z","title":"Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03868","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:4da707c5bc2d2cc9bb88ff54f347d122998d64aa65f31b90e342305b3027738f","target":"record","created_at":"2026-05-18T00:43: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":"57e1c84c6dcbb957a56bfb6ace215d77d9c68705a9b938472ee86011e2c50dc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-03-10T23:19:50Z","title_canon_sha256":"a9677528af6d2601ace075c4d301d0ce9c14c03688af89a0b68a500b0be8dc25"},"schema_version":"1.0","source":{"id":"1703.03868","kind":"arxiv","version":2}},"canonical_sha256":"8505f37ca46de6f1956f762cb1fe813945015fdb049f884d437e8435033f12aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8505f37ca46de6f1956f762cb1fe813945015fdb049f884d437e8435033f12aa","first_computed_at":"2026-05-18T00:43:53.703874Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:53.703874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TApOJDBdVyXCxJ1o+sb3frkoKgpjSPlnP+8ku3aLO8Lk75Gqzx+wY5rxaziYPMQslx1IbpIRnHPVt9iCUTJsCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:53.704604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.03868","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4da707c5bc2d2cc9bb88ff54f347d122998d64aa65f31b90e342305b3027738f","sha256:b8fadc2f3fe819e4b8f121a7a490d72a2448fa4c520f6a823afbc1023bf3451b"],"state_sha256":"697dcfe6d2cd9b7b3321f7ae058148bd839b993ad82185159b39ed54c68760b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o9PKWDhEMBhnarvBvxhQt8HwC9sh3tuNQW+l0LtX7Gsw88PqNh9OpWsJOfF0YFfo35Pwfv5Hqq0Ws3te6UavBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:52:01.282783Z","bundle_sha256":"a1a27f83f382eaf855e59863ff1bbac4e770125e307306102ba229b82a24c4ac"}}