{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UALH4S7UB3O2ICDUJYPJVST6AW","short_pith_number":"pith:UALH4S7U","canonical_record":{"source":{"id":"1405.7619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-29T17:13:24Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"29a0150d577a6295cb9d0690c4093573c092bd8d7c900781e750e064726fbc0a","abstract_canon_sha256":"c0520ef8aa96467ed67f9f3b8e1700e9cf275fbfeeffa062fea8e1fd621eae45"},"schema_version":"1.0"},"canonical_sha256":"a0167e4bf40edda408744e1e9aca7e05bc12ec5f09327879010f84cb22785a94","source":{"kind":"arxiv","id":"1405.7619","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7619","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7619v1","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7619","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"pith_short_12","alias_value":"UALH4S7UB3O2","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UALH4S7UB3O2ICDU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UALH4S7U","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UALH4S7UB3O2ICDUJYPJVST6AW","target":"record","payload":{"canonical_record":{"source":{"id":"1405.7619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-29T17:13:24Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"29a0150d577a6295cb9d0690c4093573c092bd8d7c900781e750e064726fbc0a","abstract_canon_sha256":"c0520ef8aa96467ed67f9f3b8e1700e9cf275fbfeeffa062fea8e1fd621eae45"},"schema_version":"1.0"},"canonical_sha256":"a0167e4bf40edda408744e1e9aca7e05bc12ec5f09327879010f84cb22785a94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:50.861689Z","signature_b64":"0Es0dZ4u6Wb2p6U5EUcRjBbNUbPSXRKjseBVvWktrv7RHNtPozWNL5tnGlaRTAszepEB0Uoyog6w6FGRz/RnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0167e4bf40edda408744e1e9aca7e05bc12ec5f09327879010f84cb22785a94","last_reissued_at":"2026-05-18T02:50:50.861133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:50.861133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.7619","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-18T02:50:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9iM055zTYwS9IngG+HDhslRFnytoQikC7/xIb+RGsBVUH71uAlYFhCmtdOajJTno7TiCd/dgqctp2NT1BPEHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:07:04.691141Z"},"content_sha256":"8738db0478ae9c0f2cd6279bf9be095b5cda158135a04e7c60b1dd0dd7baf004","schema_version":"1.0","event_id":"sha256:8738db0478ae9c0f2cd6279bf9be095b5cda158135a04e7c60b1dd0dd7baf004"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UALH4S7UB3O2ICDUJYPJVST6AW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A forward-backward single-source shortest paths algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DS","authors_text":"David B. Wilson, Uri Zwick","submitted_at":"2014-05-29T17:13:24Z","abstract_excerpt":"We describe a new forward-backward variant of Dijkstra's and Spira's Single-Source Shortest Paths (SSSP) algorithms. While essentially all SSSP algorithm only scan edges forward, the new algorithm scans some edges backward. The new algorithm assumes that edges in the outgoing and incoming adjacency lists of the vertices appear in non-decreasing order of weight. (Spira's algorithm makes the same assumption about the outgoing adjacency lists, but does not use incoming adjacency lists.) The running time of the algorithm on a complete directed graph on $n$ vertices with independent exponential edg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7619","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-18T02:50:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7F4Os4WeOqq6lViMI4dfRzzFs6qfEXnwQg/kzgIxq7vlM93isKKHk1DVIVwR69wj4ocbSyv1eEiu43dNVU3QAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:07:04.691553Z"},"content_sha256":"70957d76679a285cdb48d196f8112f810420e620654efe8f0184cec993b79795","schema_version":"1.0","event_id":"sha256:70957d76679a285cdb48d196f8112f810420e620654efe8f0184cec993b79795"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UALH4S7UB3O2ICDUJYPJVST6AW/bundle.json","state_url":"https://pith.science/pith/UALH4S7UB3O2ICDUJYPJVST6AW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UALH4S7UB3O2ICDUJYPJVST6AW/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-25T22:07:04Z","links":{"resolver":"https://pith.science/pith/UALH4S7UB3O2ICDUJYPJVST6AW","bundle":"https://pith.science/pith/UALH4S7UB3O2ICDUJYPJVST6AW/bundle.json","state":"https://pith.science/pith/UALH4S7UB3O2ICDUJYPJVST6AW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UALH4S7UB3O2ICDUJYPJVST6AW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UALH4S7UB3O2ICDUJYPJVST6AW","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":"c0520ef8aa96467ed67f9f3b8e1700e9cf275fbfeeffa062fea8e1fd621eae45","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-29T17:13:24Z","title_canon_sha256":"29a0150d577a6295cb9d0690c4093573c092bd8d7c900781e750e064726fbc0a"},"schema_version":"1.0","source":{"id":"1405.7619","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7619","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7619v1","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7619","created_at":"2026-05-18T02:50:50Z"},{"alias_kind":"pith_short_12","alias_value":"UALH4S7UB3O2","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UALH4S7UB3O2ICDU","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UALH4S7U","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:70957d76679a285cdb48d196f8112f810420e620654efe8f0184cec993b79795","target":"graph","created_at":"2026-05-18T02:50:50Z","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":"We describe a new forward-backward variant of Dijkstra's and Spira's Single-Source Shortest Paths (SSSP) algorithms. While essentially all SSSP algorithm only scan edges forward, the new algorithm scans some edges backward. The new algorithm assumes that edges in the outgoing and incoming adjacency lists of the vertices appear in non-decreasing order of weight. (Spira's algorithm makes the same assumption about the outgoing adjacency lists, but does not use incoming adjacency lists.) The running time of the algorithm on a complete directed graph on $n$ vertices with independent exponential edg","authors_text":"David B. Wilson, Uri Zwick","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-29T17:13:24Z","title":"A forward-backward single-source shortest paths algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7619","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:8738db0478ae9c0f2cd6279bf9be095b5cda158135a04e7c60b1dd0dd7baf004","target":"record","created_at":"2026-05-18T02:50:50Z","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":"c0520ef8aa96467ed67f9f3b8e1700e9cf275fbfeeffa062fea8e1fd621eae45","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-29T17:13:24Z","title_canon_sha256":"29a0150d577a6295cb9d0690c4093573c092bd8d7c900781e750e064726fbc0a"},"schema_version":"1.0","source":{"id":"1405.7619","kind":"arxiv","version":1}},"canonical_sha256":"a0167e4bf40edda408744e1e9aca7e05bc12ec5f09327879010f84cb22785a94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0167e4bf40edda408744e1e9aca7e05bc12ec5f09327879010f84cb22785a94","first_computed_at":"2026-05-18T02:50:50.861133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:50.861133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Es0dZ4u6Wb2p6U5EUcRjBbNUbPSXRKjseBVvWktrv7RHNtPozWNL5tnGlaRTAszepEB0Uoyog6w6FGRz/RnCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:50.861689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.7619","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8738db0478ae9c0f2cd6279bf9be095b5cda158135a04e7c60b1dd0dd7baf004","sha256:70957d76679a285cdb48d196f8112f810420e620654efe8f0184cec993b79795"],"state_sha256":"b9455d9eb47022aab548f42dc5b8a55b3c97f596055cd739fa22e88572fda3b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t3j3mE11sqixGMq9LvpZtILMtq6VMG8nmN/4zFMIn76eXyxiTPgeP+CbWPAgRqtLmLjUvsXlQw+qWRTwCRLMAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:07:04.694958Z","bundle_sha256":"b00eaa3bfbdae2d8cb78d20d8396fd05326391fed02afc76a4fbdb648b4b61a0"}}