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