{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LKM3JBBHAP4ELW7ZRV2SRTN3LR","short_pith_number":"pith:LKM3JBBH","canonical_record":{"source":{"id":"1212.6055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-25T14:18:45Z","cross_cats_sorted":[],"title_canon_sha256":"aedfec13a901b725836adb88f35b678882c1dcb625b5e853d6b42f80a5994982","abstract_canon_sha256":"94135f23cfb9bbbfdda9c95eac9b8ead517386e57d5aafbb4543b23a8796f784"},"schema_version":"1.0"},"canonical_sha256":"5a99b4842703f845dbf98d7528cdbb5c5dbaa2903bfa79ba3e04580e96aa12b5","source":{"kind":"arxiv","id":"1212.6055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6055","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6055v1","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6055","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"LKM3JBBHAP4E","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LKM3JBBHAP4ELW7Z","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LKM3JBBH","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LKM3JBBHAP4ELW7ZRV2SRTN3LR","target":"record","payload":{"canonical_record":{"source":{"id":"1212.6055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-25T14:18:45Z","cross_cats_sorted":[],"title_canon_sha256":"aedfec13a901b725836adb88f35b678882c1dcb625b5e853d6b42f80a5994982","abstract_canon_sha256":"94135f23cfb9bbbfdda9c95eac9b8ead517386e57d5aafbb4543b23a8796f784"},"schema_version":"1.0"},"canonical_sha256":"5a99b4842703f845dbf98d7528cdbb5c5dbaa2903bfa79ba3e04580e96aa12b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:42.941870Z","signature_b64":"ELTyqjfqL9jg0vUyCZLdaxgCphrjOVNsngqBl/EGFs0XT4vjvtlS0pazkGW9uWHR0e8mQf/fBip/7Vn0l635AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a99b4842703f845dbf98d7528cdbb5c5dbaa2903bfa79ba3e04580e96aa12b5","last_reissued_at":"2026-05-18T03:37:42.941425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:42.941425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.6055","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-18T03:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5UOKBUqgK01WpgeSNchHjFBTT/Mf2L/JeyT7o8kbminPwb0TlHQCHIbr3E2fYcuHbOGEz8tDbb58l1aXrTfyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T13:59:58.039418Z"},"content_sha256":"7564286d1872465ebedad626ef9f87f6d48ae8653f0a364e838d3966357646b4","schema_version":"1.0","event_id":"sha256:7564286d1872465ebedad626ef9f87f6d48ae8653f0a364e838d3966357646b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LKM3JBBHAP4ELW7ZRV2SRTN3LR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On The Optimization of Dijkstras Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ayman Abdallah, Chibli Joumaa, Seifedine Kadry","submitted_at":"2012-12-25T14:18:45Z","abstract_excerpt":"In this paper, we propose some amendment on Dijkstras algorithm in order to optimize it by reducing the number of iterations. The main idea is to solve the problem where more than one node satisfies the condition of the second step in the traditional Dijkstras algorithm. After application of the proposed modifications, the maximum number of iterations of Dijkstras algorithm is less than the number of the graphs nodes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6055","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-18T03:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/5IcEQhiuPR4e8yjyJrJovmwIcCxQ+MvOMzGEXJkxPXBJBJwMy0JMWGCabtDAwt/uvy94qFWK6bbSTx6KQHOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T13:59:58.039754Z"},"content_sha256":"dd874ff5a381a8363345a9ca45c588620f6665b4f9d4c21f0457a60f9fe9ae4c","schema_version":"1.0","event_id":"sha256:dd874ff5a381a8363345a9ca45c588620f6665b4f9d4c21f0457a60f9fe9ae4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LKM3JBBHAP4ELW7ZRV2SRTN3LR/bundle.json","state_url":"https://pith.science/pith/LKM3JBBHAP4ELW7ZRV2SRTN3LR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LKM3JBBHAP4ELW7ZRV2SRTN3LR/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-30T13:59:58Z","links":{"resolver":"https://pith.science/pith/LKM3JBBHAP4ELW7ZRV2SRTN3LR","bundle":"https://pith.science/pith/LKM3JBBHAP4ELW7ZRV2SRTN3LR/bundle.json","state":"https://pith.science/pith/LKM3JBBHAP4ELW7ZRV2SRTN3LR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LKM3JBBHAP4ELW7ZRV2SRTN3LR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LKM3JBBHAP4ELW7ZRV2SRTN3LR","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":"94135f23cfb9bbbfdda9c95eac9b8ead517386e57d5aafbb4543b23a8796f784","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-25T14:18:45Z","title_canon_sha256":"aedfec13a901b725836adb88f35b678882c1dcb625b5e853d6b42f80a5994982"},"schema_version":"1.0","source":{"id":"1212.6055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6055","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6055v1","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6055","created_at":"2026-05-18T03:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"LKM3JBBHAP4E","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LKM3JBBHAP4ELW7Z","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LKM3JBBH","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:dd874ff5a381a8363345a9ca45c588620f6665b4f9d4c21f0457a60f9fe9ae4c","target":"graph","created_at":"2026-05-18T03:37:42Z","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":"In this paper, we propose some amendment on Dijkstras algorithm in order to optimize it by reducing the number of iterations. The main idea is to solve the problem where more than one node satisfies the condition of the second step in the traditional Dijkstras algorithm. After application of the proposed modifications, the maximum number of iterations of Dijkstras algorithm is less than the number of the graphs nodes.","authors_text":"Ayman Abdallah, Chibli Joumaa, Seifedine Kadry","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-25T14:18:45Z","title":"On The Optimization of Dijkstras Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6055","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:7564286d1872465ebedad626ef9f87f6d48ae8653f0a364e838d3966357646b4","target":"record","created_at":"2026-05-18T03:37:42Z","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":"94135f23cfb9bbbfdda9c95eac9b8ead517386e57d5aafbb4543b23a8796f784","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-25T14:18:45Z","title_canon_sha256":"aedfec13a901b725836adb88f35b678882c1dcb625b5e853d6b42f80a5994982"},"schema_version":"1.0","source":{"id":"1212.6055","kind":"arxiv","version":1}},"canonical_sha256":"5a99b4842703f845dbf98d7528cdbb5c5dbaa2903bfa79ba3e04580e96aa12b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a99b4842703f845dbf98d7528cdbb5c5dbaa2903bfa79ba3e04580e96aa12b5","first_computed_at":"2026-05-18T03:37:42.941425Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:42.941425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ELTyqjfqL9jg0vUyCZLdaxgCphrjOVNsngqBl/EGFs0XT4vjvtlS0pazkGW9uWHR0e8mQf/fBip/7Vn0l635AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:42.941870Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7564286d1872465ebedad626ef9f87f6d48ae8653f0a364e838d3966357646b4","sha256:dd874ff5a381a8363345a9ca45c588620f6665b4f9d4c21f0457a60f9fe9ae4c"],"state_sha256":"7dac4d25ac28a9be0165f9e0b5347230fd438e0e2045d2bcf1495e68b90dc0a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RBRpmiNawlTbuL99FNrOQPcvBUMdXrgkoI4El8q5df5EKOHSCuYowLJ2MrCZocBr02Fx+ubXNVrycvFCQBGbDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T13:59:58.041611Z","bundle_sha256":"8ce22a354d63f049e5520b5fbe136359a386bba85e28355bcf2eab786e952783"}}