{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2FNCYPWKRKSIFN2NU2BP5QK7ST","short_pith_number":"pith:2FNCYPWK","canonical_record":{"source":{"id":"1504.07056","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-04-27T12:33:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4e426b85fe2bdbc92a437624721947f5dcc4d94a4f9e5f2c131c7d41fedc31dc","abstract_canon_sha256":"fe6b50a9c5c4ebbbc079da4f00d36196e62f52ba9e517d09f2f3e8c6d9260665"},"schema_version":"1.0"},"canonical_sha256":"d15a2c3eca8aa482b74da682fec15f94dbb878a61411be4800fe9365c0a3359a","source":{"kind":"arxiv","id":"1504.07056","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07056","created_at":"2026-05-18T00:05:24Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07056v5","created_at":"2026-05-18T00:05:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07056","created_at":"2026-05-18T00:05:24Z"},{"alias_kind":"pith_short_12","alias_value":"2FNCYPWKRKSI","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2FNCYPWKRKSIFN2N","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2FNCYPWK","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2FNCYPWKRKSIFN2NU2BP5QK7ST","target":"record","payload":{"canonical_record":{"source":{"id":"1504.07056","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-04-27T12:33:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4e426b85fe2bdbc92a437624721947f5dcc4d94a4f9e5f2c131c7d41fedc31dc","abstract_canon_sha256":"fe6b50a9c5c4ebbbc079da4f00d36196e62f52ba9e517d09f2f3e8c6d9260665"},"schema_version":"1.0"},"canonical_sha256":"d15a2c3eca8aa482b74da682fec15f94dbb878a61411be4800fe9365c0a3359a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:24.347019Z","signature_b64":"jOCrubXWzUbveGEseCemcm/8dpJv9n2v3digcv80ydOzz+tBHqvwIHAa+i+lJkBl1n+B5d1fKngqZ7vYeUJMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d15a2c3eca8aa482b74da682fec15f94dbb878a61411be4800fe9365c0a3359a","last_reissued_at":"2026-05-18T00:05:24.346585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:24.346585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.07056","source_version":5,"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:05:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t94WqeyDWWaNsE4wP9IwmAyWHEGKvXQiTgm4kbjYn7CmOAOBYfnBcTXdJ4/lhyOPtGpl5j/FtZ5DL6FycVFIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:29:02.474398Z"},"content_sha256":"0b1a88851f951b342c4d573c06357aa082e546efe198f36e2d93f1f3ee19d3e2","schema_version":"1.0","event_id":"sha256:0b1a88851f951b342c4d573c06357aa082e546efe198f36e2d93f1f3ee19d3e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2FNCYPWKRKSIFN2NU2BP5QK7ST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Danupon Nanongkai, Monika Henzinger, Sebastian Krinninger","submitted_at":"2015-04-27T12:33:50Z","abstract_excerpt":"We present a deterministic $(1+o(1))$-approximation $(n^{1/2+o(1)}+D^{1+o(1)})$-time algorithm for solving the single-source shortest paths problem on distributed weighted networks (the CONGEST model); here $n$ is the number of nodes in the network and $D$ is its (hop) diameter. This is the first non-trivial deterministic algorithm for this problem. It also improves (i) the running time of the randomized $(1+o(1))$-approximation $\\tilde O(n^{1/2}D^{1/4}+D)$-time algorithm of Nanongkai [STOC 2014] by a factor of as large as $n^{1/8}$, and (ii) the $O(\\epsilon^{-1}\\log \\epsilon^{-1})$-approximat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07056","kind":"arxiv","version":5},"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:05:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LlDvKA+8rM1et7s8n0CKg9S3jupoxCVuefUoxcKTy63Ty4AFlU+zF2YOw/Zs+OL8HlSi+Fb5SgS0pgSXvv94Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:29:02.475034Z"},"content_sha256":"d335b9972b1c96931f6bbc143109cd45f1f27e5b56f1b64edb0ff7e02f5317fc","schema_version":"1.0","event_id":"sha256:d335b9972b1c96931f6bbc143109cd45f1f27e5b56f1b64edb0ff7e02f5317fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2FNCYPWKRKSIFN2NU2BP5QK7ST/bundle.json","state_url":"https://pith.science/pith/2FNCYPWKRKSIFN2NU2BP5QK7ST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2FNCYPWKRKSIFN2NU2BP5QK7ST/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-27T10:29:02Z","links":{"resolver":"https://pith.science/pith/2FNCYPWKRKSIFN2NU2BP5QK7ST","bundle":"https://pith.science/pith/2FNCYPWKRKSIFN2NU2BP5QK7ST/bundle.json","state":"https://pith.science/pith/2FNCYPWKRKSIFN2NU2BP5QK7ST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2FNCYPWKRKSIFN2NU2BP5QK7ST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2FNCYPWKRKSIFN2NU2BP5QK7ST","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":"fe6b50a9c5c4ebbbc079da4f00d36196e62f52ba9e517d09f2f3e8c6d9260665","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-04-27T12:33:50Z","title_canon_sha256":"4e426b85fe2bdbc92a437624721947f5dcc4d94a4f9e5f2c131c7d41fedc31dc"},"schema_version":"1.0","source":{"id":"1504.07056","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07056","created_at":"2026-05-18T00:05:24Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07056v5","created_at":"2026-05-18T00:05:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07056","created_at":"2026-05-18T00:05:24Z"},{"alias_kind":"pith_short_12","alias_value":"2FNCYPWKRKSI","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2FNCYPWKRKSIFN2N","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2FNCYPWK","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:d335b9972b1c96931f6bbc143109cd45f1f27e5b56f1b64edb0ff7e02f5317fc","target":"graph","created_at":"2026-05-18T00:05:24Z","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 present a deterministic $(1+o(1))$-approximation $(n^{1/2+o(1)}+D^{1+o(1)})$-time algorithm for solving the single-source shortest paths problem on distributed weighted networks (the CONGEST model); here $n$ is the number of nodes in the network and $D$ is its (hop) diameter. This is the first non-trivial deterministic algorithm for this problem. It also improves (i) the running time of the randomized $(1+o(1))$-approximation $\\tilde O(n^{1/2}D^{1/4}+D)$-time algorithm of Nanongkai [STOC 2014] by a factor of as large as $n^{1/8}$, and (ii) the $O(\\epsilon^{-1}\\log \\epsilon^{-1})$-approximat","authors_text":"Danupon Nanongkai, Monika Henzinger, Sebastian Krinninger","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-04-27T12:33:50Z","title":"A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07056","kind":"arxiv","version":5},"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:0b1a88851f951b342c4d573c06357aa082e546efe198f36e2d93f1f3ee19d3e2","target":"record","created_at":"2026-05-18T00:05:24Z","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":"fe6b50a9c5c4ebbbc079da4f00d36196e62f52ba9e517d09f2f3e8c6d9260665","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-04-27T12:33:50Z","title_canon_sha256":"4e426b85fe2bdbc92a437624721947f5dcc4d94a4f9e5f2c131c7d41fedc31dc"},"schema_version":"1.0","source":{"id":"1504.07056","kind":"arxiv","version":5}},"canonical_sha256":"d15a2c3eca8aa482b74da682fec15f94dbb878a61411be4800fe9365c0a3359a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d15a2c3eca8aa482b74da682fec15f94dbb878a61411be4800fe9365c0a3359a","first_computed_at":"2026-05-18T00:05:24.346585Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:24.346585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jOCrubXWzUbveGEseCemcm/8dpJv9n2v3digcv80ydOzz+tBHqvwIHAa+i+lJkBl1n+B5d1fKngqZ7vYeUJMCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:24.347019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.07056","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b1a88851f951b342c4d573c06357aa082e546efe198f36e2d93f1f3ee19d3e2","sha256:d335b9972b1c96931f6bbc143109cd45f1f27e5b56f1b64edb0ff7e02f5317fc"],"state_sha256":"5d3b39bd64141baf50e011422551e3462676df672aef583418d73883fc6747a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0tb1pYkNp7WLd+3ev59mBzGm58dqQ6sF2eiTSQvwvLufx/j3PXJzZ5JBH6voMmjuX9MvIrUNsYZACJ80q6GVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:29:02.478282Z","bundle_sha256":"83d6175cc4acbb3f8b99cd72ae9cb02f3e58d2affe112df7eaf0be25c634296b"}}