{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:FI25KY27SZP67IZWPMA5ZBKQ5E","short_pith_number":"pith:FI25KY27","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"},"canonical_sha256":"2a35d5635f965fefa3367b01dc8550e9331ea541d500215521f1b62e5135104c","source":{"kind":"arxiv","id":"2606.05956","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.05956","created_at":"2026-06-05T01:15:28Z"},{"alias_kind":"arxiv_version","alias_value":"2606.05956v1","created_at":"2026-06-05T01:15:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05956","created_at":"2026-06-05T01:15:28Z"},{"alias_kind":"pith_short_12","alias_value":"FI25KY27SZP6","created_at":"2026-06-05T01:15:28Z"},{"alias_kind":"pith_short_16","alias_value":"FI25KY27SZP67IZW","created_at":"2026-06-05T01:15:28Z"},{"alias_kind":"pith_short_8","alias_value":"FI25KY27","created_at":"2026-06-05T01:15:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:FI25KY27SZP67IZWPMA5ZBKQ5E","target":"record","payload":{"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"},"canonical_sha256":"2a35d5635f965fefa3367b01dc8550e9331ea541d500215521f1b62e5135104c","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"},"source_kind":"arxiv","source_id":"2606.05956","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-06-05T01:15:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RsUoIjyBAbcl8KLL8dolaB2vIgk84aTUdheKD+2Gl6UHiBOwZLLZ+0GeWXbubw08eZjt52Funs7VgzBJxl4TCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:30:35.612961Z"},"content_sha256":"7c804b7aa52719eabbd9033062594db2de20a5ca7997bf66b338cff17e3e0130","schema_version":"1.0","event_id":"sha256:7c804b7aa52719eabbd9033062594db2de20a5ca7997bf66b338cff17e3e0130"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:FI25KY27SZP67IZWPMA5ZBKQ5E","target":"graph","payload":{"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"},"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-06-05T01:15:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NFY+F+0iFxVCSdPUudcj4DGPqpsi9Hki84FNoYK8LR8UmaKw4B8hD9AJxymGwa+UTqiCXdfx1rp9F55MEFZ0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:30:35.613571Z"},"content_sha256":"1dddc0a96a02a1c13e82f3923c26c769ac824c9dcd420233ea5e4676064d1d86","schema_version":"1.0","event_id":"sha256:1dddc0a96a02a1c13e82f3923c26c769ac824c9dcd420233ea5e4676064d1d86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FI25KY27SZP67IZWPMA5ZBKQ5E/bundle.json","state_url":"https://pith.science/pith/FI25KY27SZP67IZWPMA5ZBKQ5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FI25KY27SZP67IZWPMA5ZBKQ5E/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-05T20:30:35Z","links":{"resolver":"https://pith.science/pith/FI25KY27SZP67IZWPMA5ZBKQ5E","bundle":"https://pith.science/pith/FI25KY27SZP67IZWPMA5ZBKQ5E/bundle.json","state":"https://pith.science/pith/FI25KY27SZP67IZWPMA5ZBKQ5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FI25KY27SZP67IZWPMA5ZBKQ5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FI25KY27SZP67IZWPMA5ZBKQ5E","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":"221a426fd09875f4be47f8809d455ae9a6b78822197fa445169f3ad1e42886ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-04T09:53:18Z","title_canon_sha256":"a8ef478454f815c2537efd86ae3a81100ef69c32596dd33d9b063f9ffe73fe17"},"schema_version":"1.0","source":{"id":"2606.05956","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.05956","created_at":"2026-06-05T01:15:28Z"},{"alias_kind":"arxiv_version","alias_value":"2606.05956v1","created_at":"2026-06-05T01:15:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05956","created_at":"2026-06-05T01:15:28Z"},{"alias_kind":"pith_short_12","alias_value":"FI25KY27SZP6","created_at":"2026-06-05T01:15:28Z"},{"alias_kind":"pith_short_16","alias_value":"FI25KY27SZP67IZW","created_at":"2026-06-05T01:15:28Z"},{"alias_kind":"pith_short_8","alias_value":"FI25KY27","created_at":"2026-06-05T01:15:28Z"}],"graph_snapshots":[{"event_id":"sha256:1dddc0a96a02a1c13e82f3923c26c769ac824c9dcd420233ea5e4676064d1d86","target":"graph","created_at":"2026-06-05T01:15:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.05956/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ariel Felner, Shahaf S. Shperberg, Solomon Eyal Shimony, Tzur Shubi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-04T09:53:18Z","title":"Bidirectional Search for Longest Paths: Case for Front-to-Front Heuristics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05956","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:7c804b7aa52719eabbd9033062594db2de20a5ca7997bf66b338cff17e3e0130","target":"record","created_at":"2026-06-05T01:15:28Z","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":"221a426fd09875f4be47f8809d455ae9a6b78822197fa445169f3ad1e42886ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-04T09:53:18Z","title_canon_sha256":"a8ef478454f815c2537efd86ae3a81100ef69c32596dd33d9b063f9ffe73fe17"},"schema_version":"1.0","source":{"id":"2606.05956","kind":"arxiv","version":1}},"canonical_sha256":"2a35d5635f965fefa3367b01dc8550e9331ea541d500215521f1b62e5135104c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a35d5635f965fefa3367b01dc8550e9331ea541d500215521f1b62e5135104c","first_computed_at":"2026-06-05T01:15:28.749291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T01:15:28.749291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PohjY8ERvRab+ErjzQV3ZnFvlWdDMidLpn9xQIEZ7+K682c9Q7FujI/d3qkBsWU79KyvqpR33M02CgqB++zNCg==","signature_status":"signed_v1","signed_at":"2026-06-05T01:15:28.749697Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.05956","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c804b7aa52719eabbd9033062594db2de20a5ca7997bf66b338cff17e3e0130","sha256:1dddc0a96a02a1c13e82f3923c26c769ac824c9dcd420233ea5e4676064d1d86"],"state_sha256":"28fdcc644a3e7511af8bc5cc7f5e3099118503427925989d9d1fbe8420267893"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kwsy0NXe6DcINbMhHgthENWUm/U6KoxZspheshR3Ioc1M+hAIrkYhsEv9kV3aiVxMsuUDZRSd/0P2wc2sFRrCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:30:35.616976Z","bundle_sha256":"de6fd06590a7015e2275c0f130357dc81a0b77035f7c4716e9cc63837aa32054"}}