{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MIWHP3T7KGTIFYCRLKGUXCTW57","short_pith_number":"pith:MIWHP3T7","canonical_record":{"source":{"id":"1903.12085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-28T16:06:55Z","cross_cats_sorted":[],"title_canon_sha256":"f535c8ed43ba642b7d9c14927217738fe516d8c97bb68710c359c2effd04fd5b","abstract_canon_sha256":"78d51f6e0378600b88890a3732869a0b420e3311bb6b3a67482cad99ec659782"},"schema_version":"1.0"},"canonical_sha256":"622c77ee7f51a682e0515a8d4b8a76eff5b6a36ee5a4e5460846620a5198fa30","source":{"kind":"arxiv","id":"1903.12085","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12085","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12085v2","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12085","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"MIWHP3T7KGTI","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MIWHP3T7KGTIFYCR","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MIWHP3T7","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MIWHP3T7KGTIFYCRLKGUXCTW57","target":"record","payload":{"canonical_record":{"source":{"id":"1903.12085","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-28T16:06:55Z","cross_cats_sorted":[],"title_canon_sha256":"f535c8ed43ba642b7d9c14927217738fe516d8c97bb68710c359c2effd04fd5b","abstract_canon_sha256":"78d51f6e0378600b88890a3732869a0b420e3311bb6b3a67482cad99ec659782"},"schema_version":"1.0"},"canonical_sha256":"622c77ee7f51a682e0515a8d4b8a76eff5b6a36ee5a4e5460846620a5198fa30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:45.650577Z","signature_b64":"9NMAgj4xFz1maW5uH1v8JYjZ7Ba/4iX6VYGIc8GglOOABS+rkO5eopwAs2dtqQSSRodEhVxRWSZYdbAAtujZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"622c77ee7f51a682e0515a8d4b8a76eff5b6a36ee5a4e5460846620a5198fa30","last_reissued_at":"2026-05-17T23:46:45.650173Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:45.650173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.12085","source_version":2,"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:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ap9htIdDtuoq4QLcM8769SFGAWsaqgFFTW4WJ9ild0VftYGGg9iqR0M9Gc11dYt7ZRlZ5IvNkrq1W3cYReYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:55:32.493506Z"},"content_sha256":"a7d9abcbebe2e818ac2c2768c64d86e44544bc5262e4c22baf09664d62953f8b","schema_version":"1.0","event_id":"sha256:a7d9abcbebe2e818ac2c2768c64d86e44544bc5262e4c22baf09664d62953f8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MIWHP3T7KGTIFYCRLKGUXCTW57","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"More Parallelism in Dijkstra's Single-Source Shortest Path Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jesper Larsson Tr\\\"aff, Michael Kainer","submitted_at":"2019-03-28T16:06:55Z","abstract_excerpt":"Dijkstra's algorithm for the Single-Source Shortest Path (SSSP) problem is notoriously hard to parallelize in $o(n)$ depth, $n$ being the number of vertices in the input graph, without increasing the required parallel work unreasonably. Crauser et al.\\ (1998) presented observations that allow to identify more than a single vertex at a time as correct and correspondingly more edges to be relaxed simultaneously. Their algorithm runs in parallel phases, and for certain random graphs they showed that the number of phases is $O(n^{1/3})$ with high probability. A work-efficient CRCW PRAM with this d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12085","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"},"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:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E3jyEvi6PPx4Vu5N+oq0uvTcg9PFEqdrcFxnxqxbGGmbcq9dmOgrUOU0WmDZkkGtyEdS0217vhz+P4y/KMa7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:55:32.493849Z"},"content_sha256":"2275b453b733a45d531e97d95a7ba59d4eb016f7e47d32125f2866eca7937557","schema_version":"1.0","event_id":"sha256:2275b453b733a45d531e97d95a7ba59d4eb016f7e47d32125f2866eca7937557"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MIWHP3T7KGTIFYCRLKGUXCTW57/bundle.json","state_url":"https://pith.science/pith/MIWHP3T7KGTIFYCRLKGUXCTW57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MIWHP3T7KGTIFYCRLKGUXCTW57/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-24T08:55:32Z","links":{"resolver":"https://pith.science/pith/MIWHP3T7KGTIFYCRLKGUXCTW57","bundle":"https://pith.science/pith/MIWHP3T7KGTIFYCRLKGUXCTW57/bundle.json","state":"https://pith.science/pith/MIWHP3T7KGTIFYCRLKGUXCTW57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MIWHP3T7KGTIFYCRLKGUXCTW57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MIWHP3T7KGTIFYCRLKGUXCTW57","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":"78d51f6e0378600b88890a3732869a0b420e3311bb6b3a67482cad99ec659782","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-28T16:06:55Z","title_canon_sha256":"f535c8ed43ba642b7d9c14927217738fe516d8c97bb68710c359c2effd04fd5b"},"schema_version":"1.0","source":{"id":"1903.12085","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12085","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12085v2","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12085","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"MIWHP3T7KGTI","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MIWHP3T7KGTIFYCR","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MIWHP3T7","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:2275b453b733a45d531e97d95a7ba59d4eb016f7e47d32125f2866eca7937557","target":"graph","created_at":"2026-05-17T23:46:45Z","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":"Dijkstra's algorithm for the Single-Source Shortest Path (SSSP) problem is notoriously hard to parallelize in $o(n)$ depth, $n$ being the number of vertices in the input graph, without increasing the required parallel work unreasonably. Crauser et al.\\ (1998) presented observations that allow to identify more than a single vertex at a time as correct and correspondingly more edges to be relaxed simultaneously. Their algorithm runs in parallel phases, and for certain random graphs they showed that the number of phases is $O(n^{1/3})$ with high probability. A work-efficient CRCW PRAM with this d","authors_text":"Jesper Larsson Tr\\\"aff, Michael Kainer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-28T16:06:55Z","title":"More Parallelism in Dijkstra's Single-Source Shortest Path Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12085","kind":"arxiv","version":2},"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:a7d9abcbebe2e818ac2c2768c64d86e44544bc5262e4c22baf09664d62953f8b","target":"record","created_at":"2026-05-17T23:46:45Z","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":"78d51f6e0378600b88890a3732869a0b420e3311bb6b3a67482cad99ec659782","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-03-28T16:06:55Z","title_canon_sha256":"f535c8ed43ba642b7d9c14927217738fe516d8c97bb68710c359c2effd04fd5b"},"schema_version":"1.0","source":{"id":"1903.12085","kind":"arxiv","version":2}},"canonical_sha256":"622c77ee7f51a682e0515a8d4b8a76eff5b6a36ee5a4e5460846620a5198fa30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"622c77ee7f51a682e0515a8d4b8a76eff5b6a36ee5a4e5460846620a5198fa30","first_computed_at":"2026-05-17T23:46:45.650173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:45.650173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9NMAgj4xFz1maW5uH1v8JYjZ7Ba/4iX6VYGIc8GglOOABS+rkO5eopwAs2dtqQSSRodEhVxRWSZYdbAAtujZCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:45.650577Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.12085","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7d9abcbebe2e818ac2c2768c64d86e44544bc5262e4c22baf09664d62953f8b","sha256:2275b453b733a45d531e97d95a7ba59d4eb016f7e47d32125f2866eca7937557"],"state_sha256":"ca1e043c9aed57aa824f4314c908d9411e67ff338712fcc66651b8b0ecb3c748"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VpnwyyCg2p5Ooulxat41J9eZe/gz/inL2uNJ9E+OAfGJxERb4xoVPKnU1HD1dqbLOfQrKPNq4Foj7R+eKYd/Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T08:55:32.495781Z","bundle_sha256":"277de8c29be945d2a9410a3b24d4adb17cdb7151816bb8341cb18ffb6cefe4d7"}}