{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TE7FTBXH3ZWVXC3T23NSXQZZAR","short_pith_number":"pith:TE7FTBXH","schema_version":"1.0","canonical_sha256":"993e5986e7de6d5b8b73d6db2bc3390469aa4d862ee4a442c22105588df00b08","source":{"kind":"arxiv","id":"1903.00436","version":2},"attestation_state":"computed","paper":{"title":"Bounded Dijkstra (BD): Search Space Reduction for Expediting Shortest Path Subroutines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NI","authors_text":"Amaury Van Bemten, Carmen Mas Machuca, Jochen W. Guck, Wolfgang Kellerer","submitted_at":"2019-03-01T17:52:51Z","abstract_excerpt":"The shortest path (SP) and shortest paths tree (SPT) problems arise both as direct applications and as subroutines of overlay algorithms solving more complex problems such as the constrained shortest path (CSP) or the constrained minimum Steiner tree (CMST) problems. Often, such algorithms do not use the result of an SP subroutine if its total cost is greater than a given bound. For example, for delay-constrained problems, paths resulting from a least-delay SP run and whose delay is greater than the delay constraint of the original problem are not used by the overlay algorithm to construct its"},"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":"1903.00436","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-03-01T17:52:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c1f95f21212045bcd0e23e92c426c894ba02c51fcfffd64b7ef35e4d846cdaa9","abstract_canon_sha256":"ab7fc3a7407695165cf44105b66c12fe6be9f8f04587094db1206a61a55cedde"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:55.637217Z","signature_b64":"y+DLO2jcNUCZJl2uoBpo62rwctUZzeONDdO7OZwulANHaTRt90hpLNlHdJqaOkXDhZHwuzpEFWG2j7nPYOogAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"993e5986e7de6d5b8b73d6db2bc3390469aa4d862ee4a442c22105588df00b08","last_reissued_at":"2026-05-17T23:51:55.636762Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:55.636762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded Dijkstra (BD): Search Space Reduction for Expediting Shortest Path Subroutines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NI","authors_text":"Amaury Van Bemten, Carmen Mas Machuca, Jochen W. Guck, Wolfgang Kellerer","submitted_at":"2019-03-01T17:52:51Z","abstract_excerpt":"The shortest path (SP) and shortest paths tree (SPT) problems arise both as direct applications and as subroutines of overlay algorithms solving more complex problems such as the constrained shortest path (CSP) or the constrained minimum Steiner tree (CMST) problems. Often, such algorithms do not use the result of an SP subroutine if its total cost is greater than a given bound. For example, for delay-constrained problems, paths resulting from a least-delay SP run and whose delay is greater than the delay constraint of the original problem are not used by the overlay algorithm to construct its"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00436","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":"1903.00436","created_at":"2026-05-17T23:51:55.636835+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.00436v2","created_at":"2026-05-17T23:51:55.636835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00436","created_at":"2026-05-17T23:51:55.636835+00:00"},{"alias_kind":"pith_short_12","alias_value":"TE7FTBXH3ZWV","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"TE7FTBXH3ZWVXC3T","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"TE7FTBXH","created_at":"2026-05-18T12:33:27.125529+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/TE7FTBXH3ZWVXC3T23NSXQZZAR","json":"https://pith.science/pith/TE7FTBXH3ZWVXC3T23NSXQZZAR.json","graph_json":"https://pith.science/api/pith-number/TE7FTBXH3ZWVXC3T23NSXQZZAR/graph.json","events_json":"https://pith.science/api/pith-number/TE7FTBXH3ZWVXC3T23NSXQZZAR/events.json","paper":"https://pith.science/paper/TE7FTBXH"},"agent_actions":{"view_html":"https://pith.science/pith/TE7FTBXH3ZWVXC3T23NSXQZZAR","download_json":"https://pith.science/pith/TE7FTBXH3ZWVXC3T23NSXQZZAR.json","view_paper":"https://pith.science/paper/TE7FTBXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.00436&json=true","fetch_graph":"https://pith.science/api/pith-number/TE7FTBXH3ZWVXC3T23NSXQZZAR/graph.json","fetch_events":"https://pith.science/api/pith-number/TE7FTBXH3ZWVXC3T23NSXQZZAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TE7FTBXH3ZWVXC3T23NSXQZZAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TE7FTBXH3ZWVXC3T23NSXQZZAR/action/storage_attestation","attest_author":"https://pith.science/pith/TE7FTBXH3ZWVXC3T23NSXQZZAR/action/author_attestation","sign_citation":"https://pith.science/pith/TE7FTBXH3ZWVXC3T23NSXQZZAR/action/citation_signature","submit_replication":"https://pith.science/pith/TE7FTBXH3ZWVXC3T23NSXQZZAR/action/replication_record"}},"created_at":"2026-05-17T23:51:55.636835+00:00","updated_at":"2026-05-17T23:51:55.636835+00:00"}