{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:M364HUR67PK3YRNYO7NHAJCQOZ","short_pith_number":"pith:M364HUR6","canonical_record":{"source":{"id":"1705.02044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-04T23:11:11Z","cross_cats_sorted":[],"title_canon_sha256":"ebd869e8652c82d6a50dfad5e3b554ac046ea22f505cffe691d6331dbf1f4943","abstract_canon_sha256":"d7bd301de0cfb8dd8c54d1fd150e3d0ffd62e776aa2b5682824d53138b8f82fa"},"schema_version":"1.0"},"canonical_sha256":"66fdc3d23efbd5bc45b877da702450764eacd9b063c7cb39143d4f5e2a7b46c2","source":{"kind":"arxiv","id":"1705.02044","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02044","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02044v1","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02044","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"M364HUR67PK3","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M364HUR67PK3YRNY","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M364HUR6","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:M364HUR67PK3YRNYO7NHAJCQOZ","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-04T23:11:11Z","cross_cats_sorted":[],"title_canon_sha256":"ebd869e8652c82d6a50dfad5e3b554ac046ea22f505cffe691d6331dbf1f4943","abstract_canon_sha256":"d7bd301de0cfb8dd8c54d1fd150e3d0ffd62e776aa2b5682824d53138b8f82fa"},"schema_version":"1.0"},"canonical_sha256":"66fdc3d23efbd5bc45b877da702450764eacd9b063c7cb39143d4f5e2a7b46c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:00.756465Z","signature_b64":"Cw9maGvKfwrGGNFv72uXAw4Tfd671CLAW0LEuN+B8Zt1TzhVFKtURWE3It1I01G2jCk+qEDLDVkbenppBQVRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66fdc3d23efbd5bc45b877da702450764eacd9b063c7cb39143d4f5e2a7b46c2","last_reissued_at":"2026-05-18T00:45:00.755787Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:00.755787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02044","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-05-18T00:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ROPccCYazkEjTRcQj3msXe7VHDt3FRCg1YHKrympvuG59jLUhXF0JeVMK2JFdG9TtLlTk1bZiD4UF5oTPN75CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:30:31.591177Z"},"content_sha256":"d32017ba1116c08d7d8f06b78fc1a0d4972a5820b1c562c9b8fb8b3565314138","schema_version":"1.0","event_id":"sha256:d32017ba1116c08d7d8f06b78fc1a0d4972a5820b1c562c9b8fb8b3565314138"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:M364HUR67PK3YRNYO7NHAJCQOZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Survey of Shortest-Path Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amgad Madkour, Faizan Ur Rehman, Mohamed Abdur Rahman, Saleh Basalamah, Walid G. Aref","submitted_at":"2017-05-04T23:11:11Z","abstract_excerpt":"A shortest-path algorithm finds a path containing the minimal cost between two vertices in a graph. A plethora of shortest-path algorithms is studied in the literature that span across multiple disciplines. This paper presents a survey of shortest-path algorithms based on a taxonomy that is introduced in the paper. One dimension of this taxonomy is the various flavors of the shortest-path problem. There is no one general algorithm that is capable of solving all variants of the shortest-path problem due to the space and time complexities associated with each algorithm. Other important dimension"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02044","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":""},"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:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cFZL2YBo6giAQGKhwz/W8i29jP1AasOiNIZ8UJoU92zAIbYwZBeuN7tFaxVyx0le4IjW0eltbr1efxWG18PvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:30:31.591885Z"},"content_sha256":"1a2260b53b22bed3c051074cf74171817c43da075cfb39ae5a7d2db68c42909d","schema_version":"1.0","event_id":"sha256:1a2260b53b22bed3c051074cf74171817c43da075cfb39ae5a7d2db68c42909d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M364HUR67PK3YRNYO7NHAJCQOZ/bundle.json","state_url":"https://pith.science/pith/M364HUR67PK3YRNYO7NHAJCQOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M364HUR67PK3YRNYO7NHAJCQOZ/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-30T00:30:31Z","links":{"resolver":"https://pith.science/pith/M364HUR67PK3YRNYO7NHAJCQOZ","bundle":"https://pith.science/pith/M364HUR67PK3YRNYO7NHAJCQOZ/bundle.json","state":"https://pith.science/pith/M364HUR67PK3YRNYO7NHAJCQOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M364HUR67PK3YRNYO7NHAJCQOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:M364HUR67PK3YRNYO7NHAJCQOZ","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":"d7bd301de0cfb8dd8c54d1fd150e3d0ffd62e776aa2b5682824d53138b8f82fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-04T23:11:11Z","title_canon_sha256":"ebd869e8652c82d6a50dfad5e3b554ac046ea22f505cffe691d6331dbf1f4943"},"schema_version":"1.0","source":{"id":"1705.02044","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02044","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02044v1","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02044","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"M364HUR67PK3","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M364HUR67PK3YRNY","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M364HUR6","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:1a2260b53b22bed3c051074cf74171817c43da075cfb39ae5a7d2db68c42909d","target":"graph","created_at":"2026-05-18T00:45:00Z","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":"A shortest-path algorithm finds a path containing the minimal cost between two vertices in a graph. A plethora of shortest-path algorithms is studied in the literature that span across multiple disciplines. This paper presents a survey of shortest-path algorithms based on a taxonomy that is introduced in the paper. One dimension of this taxonomy is the various flavors of the shortest-path problem. There is no one general algorithm that is capable of solving all variants of the shortest-path problem due to the space and time complexities associated with each algorithm. Other important dimension","authors_text":"Amgad Madkour, Faizan Ur Rehman, Mohamed Abdur Rahman, Saleh Basalamah, Walid G. Aref","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-04T23:11:11Z","title":"A Survey of Shortest-Path Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02044","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:d32017ba1116c08d7d8f06b78fc1a0d4972a5820b1c562c9b8fb8b3565314138","target":"record","created_at":"2026-05-18T00:45:00Z","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":"d7bd301de0cfb8dd8c54d1fd150e3d0ffd62e776aa2b5682824d53138b8f82fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-04T23:11:11Z","title_canon_sha256":"ebd869e8652c82d6a50dfad5e3b554ac046ea22f505cffe691d6331dbf1f4943"},"schema_version":"1.0","source":{"id":"1705.02044","kind":"arxiv","version":1}},"canonical_sha256":"66fdc3d23efbd5bc45b877da702450764eacd9b063c7cb39143d4f5e2a7b46c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66fdc3d23efbd5bc45b877da702450764eacd9b063c7cb39143d4f5e2a7b46c2","first_computed_at":"2026-05-18T00:45:00.755787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:00.755787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cw9maGvKfwrGGNFv72uXAw4Tfd671CLAW0LEuN+B8Zt1TzhVFKtURWE3It1I01G2jCk+qEDLDVkbenppBQVRBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:00.756465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02044","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d32017ba1116c08d7d8f06b78fc1a0d4972a5820b1c562c9b8fb8b3565314138","sha256:1a2260b53b22bed3c051074cf74171817c43da075cfb39ae5a7d2db68c42909d"],"state_sha256":"6dc15f5bd101434c5cfc4730f686027c8befea58957cf0c52bf09f70bb064a95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vrC1EGHns4Mw7mDNBhqhdzO01yYaDGb4v0gW0N8BZ0A0zoBtdAILMnVS7fRXn1dBCtKeQ7eefj11E0VUDt1aCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:30:31.595725Z","bundle_sha256":"ec760d813252f555e9e9cad3ba0cfc259973bb26f1b8840365bebed20c13c5fc"}}