{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FI25KY27SZP67IZWPMA5ZBKQ5E","short_pith_number":"pith:FI25KY27","schema_version":"1.0","canonical_sha256":"2a35d5635f965fefa3367b01dc8550e9331ea541d500215521f1b62e5135104c","source":{"kind":"arxiv","id":"2606.05956","version":1},"attestation_state":"computed","paper":{"title":"Bidirectional Search for Longest Paths: Case for Front-to-Front Heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ariel Felner, Shahaf S. Shperberg, Solomon Eyal Shimony, Tzur Shubi","submitted_at":"2026-06-04T09:53:18Z","abstract_excerpt":"Bidirectional heuristic search can potentially reduce search effort for problems amenable to backward search. Therein, it is well-known that front-to-front heuristics can reduce the number of node expansions, but their overhead is so high that overall runtime almost always increases. We propose BiXDFBnB, a bidirectional depth-first branch-and-bound algorithm that adapts the Single-Frontier Bidirectional Search (SFBDS) framework - originally developed for shortest-path (MIN) problems - to the Generalized Longest Simple Path (GLSP) setting. Because SFBDS inherently operates on paired states, fro"},"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":"2606.05956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-04T09:53:18Z","cross_cats_sorted":[],"title_canon_sha256":"a8ef478454f815c2537efd86ae3a81100ef69c32596dd33d9b063f9ffe73fe17","abstract_canon_sha256":"221a426fd09875f4be47f8809d455ae9a6b78822197fa445169f3ad1e42886ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:15:28.749697Z","signature_b64":"PohjY8ERvRab+ErjzQV3ZnFvlWdDMidLpn9xQIEZ7+K682c9Q7FujI/d3qkBsWU79KyvqpR33M02CgqB++zNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a35d5635f965fefa3367b01dc8550e9331ea541d500215521f1b62e5135104c","last_reissued_at":"2026-06-05T01:15:28.749291Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:15:28.749291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bidirectional Search for Longest Paths: Case for Front-to-Front Heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ariel Felner, Shahaf S. Shperberg, Solomon Eyal Shimony, Tzur Shubi","submitted_at":"2026-06-04T09:53:18Z","abstract_excerpt":"Bidirectional heuristic search can potentially reduce search effort for problems amenable to backward search. Therein, it is well-known that front-to-front heuristics can reduce the number of node expansions, but their overhead is so high that overall runtime almost always increases. We propose BiXDFBnB, a bidirectional depth-first branch-and-bound algorithm that adapts the Single-Frontier Bidirectional Search (SFBDS) framework - originally developed for shortest-path (MIN) problems - to the Generalized Longest Simple Path (GLSP) setting. Because SFBDS inherently operates on paired states, fro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05956","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.05956/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.05956","created_at":"2026-06-05T01:15:28.749357+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.05956v1","created_at":"2026-06-05T01:15:28.749357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05956","created_at":"2026-06-05T01:15:28.749357+00:00"},{"alias_kind":"pith_short_12","alias_value":"FI25KY27SZP6","created_at":"2026-06-05T01:15:28.749357+00:00"},{"alias_kind":"pith_short_16","alias_value":"FI25KY27SZP67IZW","created_at":"2026-06-05T01:15:28.749357+00:00"},{"alias_kind":"pith_short_8","alias_value":"FI25KY27","created_at":"2026-06-05T01:15:28.749357+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/FI25KY27SZP67IZWPMA5ZBKQ5E","json":"https://pith.science/pith/FI25KY27SZP67IZWPMA5ZBKQ5E.json","graph_json":"https://pith.science/api/pith-number/FI25KY27SZP67IZWPMA5ZBKQ5E/graph.json","events_json":"https://pith.science/api/pith-number/FI25KY27SZP67IZWPMA5ZBKQ5E/events.json","paper":"https://pith.science/paper/FI25KY27"},"agent_actions":{"view_html":"https://pith.science/pith/FI25KY27SZP67IZWPMA5ZBKQ5E","download_json":"https://pith.science/pith/FI25KY27SZP67IZWPMA5ZBKQ5E.json","view_paper":"https://pith.science/paper/FI25KY27","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.05956&json=true","fetch_graph":"https://pith.science/api/pith-number/FI25KY27SZP67IZWPMA5ZBKQ5E/graph.json","fetch_events":"https://pith.science/api/pith-number/FI25KY27SZP67IZWPMA5ZBKQ5E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FI25KY27SZP67IZWPMA5ZBKQ5E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FI25KY27SZP67IZWPMA5ZBKQ5E/action/storage_attestation","attest_author":"https://pith.science/pith/FI25KY27SZP67IZWPMA5ZBKQ5E/action/author_attestation","sign_citation":"https://pith.science/pith/FI25KY27SZP67IZWPMA5ZBKQ5E/action/citation_signature","submit_replication":"https://pith.science/pith/FI25KY27SZP67IZWPMA5ZBKQ5E/action/replication_record"}},"created_at":"2026-06-05T01:15:28.749357+00:00","updated_at":"2026-06-05T01:15:28.749357+00:00"}