{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AFCS72MXH7J44S56BD2Y47JNMF","short_pith_number":"pith:AFCS72MX","canonical_record":{"source":{"id":"1812.10499","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-12-26T19:00:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5925da78ddd752afb28b8d27a5a00f89fd04acc9ab3714402c27fc99465230f7","abstract_canon_sha256":"885007aeb99986d13fdc8e01bc03f9b5e6e42162f291b313086a77f2659688f3"},"schema_version":"1.0"},"canonical_sha256":"01452fe9973fd3ce4bbe08f58e7d2d6174cf405cbc703f2f34033365526d068f","source":{"kind":"arxiv","id":"1812.10499","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10499","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10499v1","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10499","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"pith_short_12","alias_value":"AFCS72MXH7J4","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AFCS72MXH7J44S56","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AFCS72MX","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AFCS72MXH7J44S56BD2Y47JNMF","target":"record","payload":{"canonical_record":{"source":{"id":"1812.10499","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-12-26T19:00:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5925da78ddd752afb28b8d27a5a00f89fd04acc9ab3714402c27fc99465230f7","abstract_canon_sha256":"885007aeb99986d13fdc8e01bc03f9b5e6e42162f291b313086a77f2659688f3"},"schema_version":"1.0"},"canonical_sha256":"01452fe9973fd3ce4bbe08f58e7d2d6174cf405cbc703f2f34033365526d068f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:20.942933Z","signature_b64":"yy8kC4Bw+g2obzztXhw1Q1i/0POQguqBuE+Y1ibNIHjPkxmPb104SV6qg7PzqnF+RIVFLIgIlNyxxoAm2gmVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01452fe9973fd3ce4bbe08f58e7d2d6174cf405cbc703f2f34033365526d068f","last_reissued_at":"2026-05-17T23:57:20.942335Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:20.942335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.10499","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-17T23:57:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xvvHvzx7zHMo6qXh4uOo+EJ0WApYnC4gp668mfISCvDeY/g0KopnLJPNB8pxx98/RJw1DdtuUXTR7wXEkhlsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:15:26.174490Z"},"content_sha256":"b061b908458aaec6ffe5c1a1367e0b1b8637aad6915cba8196c06931a7243dd6","schema_version":"1.0","event_id":"sha256:b061b908458aaec6ffe5c1a1367e0b1b8637aad6915cba8196c06931a7243dd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AFCS72MXH7J44S56BD2Y47JNMF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Removing Sequential Bottleneck of Dijkstra's Algorithm for the Shortest Path Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Vijay K. Garg","submitted_at":"2018-12-26T19:00:15Z","abstract_excerpt":"All traditional methods of computing shortest paths depend upon edge-relaxation where the cost of reaching a vertex from a source vertex is possibly decreased if that edge is used. We introduce a method which maintains lower bounds as well as upper bounds for reaching a vertex. This method enables one to find the optimal cost for multiple vertices in one iteration and thereby reduces the sequential bottleneck in Dijkstra's algorithm.\n  We present four algorithms in this paper --- $SP_1$, $SP_2$, $SP_3$ and $SP_4$. $SP_1$ and $SP_2$ reduce the number of heap operations in Dijkstra's algorithm. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10499","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-17T23:57:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zMraK+IEBAwNJpzHfeesabUOau6+qE6clytEOVt7PHDPswQuyr1l3kdXnN0L5y5BPitXMVJgWBvKgCEN2ELXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:15:26.175179Z"},"content_sha256":"a16f5a38d9a48a62d4d37e49b444ec6ccaa4a17857d16208d5fdfb0fee24a1dc","schema_version":"1.0","event_id":"sha256:a16f5a38d9a48a62d4d37e49b444ec6ccaa4a17857d16208d5fdfb0fee24a1dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AFCS72MXH7J44S56BD2Y47JNMF/bundle.json","state_url":"https://pith.science/pith/AFCS72MXH7J44S56BD2Y47JNMF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AFCS72MXH7J44S56BD2Y47JNMF/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-26T19:15:26Z","links":{"resolver":"https://pith.science/pith/AFCS72MXH7J44S56BD2Y47JNMF","bundle":"https://pith.science/pith/AFCS72MXH7J44S56BD2Y47JNMF/bundle.json","state":"https://pith.science/pith/AFCS72MXH7J44S56BD2Y47JNMF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AFCS72MXH7J44S56BD2Y47JNMF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AFCS72MXH7J44S56BD2Y47JNMF","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":"885007aeb99986d13fdc8e01bc03f9b5e6e42162f291b313086a77f2659688f3","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-12-26T19:00:15Z","title_canon_sha256":"5925da78ddd752afb28b8d27a5a00f89fd04acc9ab3714402c27fc99465230f7"},"schema_version":"1.0","source":{"id":"1812.10499","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10499","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10499v1","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10499","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"pith_short_12","alias_value":"AFCS72MXH7J4","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AFCS72MXH7J44S56","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AFCS72MX","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:a16f5a38d9a48a62d4d37e49b444ec6ccaa4a17857d16208d5fdfb0fee24a1dc","target":"graph","created_at":"2026-05-17T23:57:20Z","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":"All traditional methods of computing shortest paths depend upon edge-relaxation where the cost of reaching a vertex from a source vertex is possibly decreased if that edge is used. We introduce a method which maintains lower bounds as well as upper bounds for reaching a vertex. This method enables one to find the optimal cost for multiple vertices in one iteration and thereby reduces the sequential bottleneck in Dijkstra's algorithm.\n  We present four algorithms in this paper --- $SP_1$, $SP_2$, $SP_3$ and $SP_4$. $SP_1$ and $SP_2$ reduce the number of heap operations in Dijkstra's algorithm. ","authors_text":"Vijay K. Garg","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-12-26T19:00:15Z","title":"Removing Sequential Bottleneck of Dijkstra's Algorithm for the Shortest Path Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10499","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:b061b908458aaec6ffe5c1a1367e0b1b8637aad6915cba8196c06931a7243dd6","target":"record","created_at":"2026-05-17T23:57:20Z","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":"885007aeb99986d13fdc8e01bc03f9b5e6e42162f291b313086a77f2659688f3","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-12-26T19:00:15Z","title_canon_sha256":"5925da78ddd752afb28b8d27a5a00f89fd04acc9ab3714402c27fc99465230f7"},"schema_version":"1.0","source":{"id":"1812.10499","kind":"arxiv","version":1}},"canonical_sha256":"01452fe9973fd3ce4bbe08f58e7d2d6174cf405cbc703f2f34033365526d068f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01452fe9973fd3ce4bbe08f58e7d2d6174cf405cbc703f2f34033365526d068f","first_computed_at":"2026-05-17T23:57:20.942335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:20.942335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yy8kC4Bw+g2obzztXhw1Q1i/0POQguqBuE+Y1ibNIHjPkxmPb104SV6qg7PzqnF+RIVFLIgIlNyxxoAm2gmVCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:20.942933Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.10499","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b061b908458aaec6ffe5c1a1367e0b1b8637aad6915cba8196c06931a7243dd6","sha256:a16f5a38d9a48a62d4d37e49b444ec6ccaa4a17857d16208d5fdfb0fee24a1dc"],"state_sha256":"3fc7138863f0522837b140e198a5316394e29d289f77611b94380a1b8e11061d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"emlK8aPEYo+5I907QopK/gRJ96EwzoFlopb4YxgivwjiGx2dSvKX/wkJNuk4Bc3FqN3NkkHHOBiwHFJRLv/4BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:15:26.178797Z","bundle_sha256":"22d63d02957d85c8295a89eb97d15f0c1967f9ffffee6715569629328f1d1d7d"}}