{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OOMM6QP4PPR3GBZU2JWSONBE3W","short_pith_number":"pith:OOMM6QP4","canonical_record":{"source":{"id":"1907.02266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-04T08:22:03Z","cross_cats_sorted":[],"title_canon_sha256":"f62d9c4fcacd42d202ad275dd596c780ec4aff852734ed51650d9498a3077209","abstract_canon_sha256":"5de4954a6ba1767d3b3d2fd5ffb20ceef60d84f1fa5690a58e7de90ac214648a"},"schema_version":"1.0"},"canonical_sha256":"7398cf41fc7be3b30734d26d273424dd903e7f15dfcbc278b5fe3925cdf12a94","source":{"kind":"arxiv","id":"1907.02266","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02266","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02266v1","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02266","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"OOMM6QP4PPR3","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OOMM6QP4PPR3GBZU","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OOMM6QP4","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OOMM6QP4PPR3GBZU2JWSONBE3W","target":"record","payload":{"canonical_record":{"source":{"id":"1907.02266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-04T08:22:03Z","cross_cats_sorted":[],"title_canon_sha256":"f62d9c4fcacd42d202ad275dd596c780ec4aff852734ed51650d9498a3077209","abstract_canon_sha256":"5de4954a6ba1767d3b3d2fd5ffb20ceef60d84f1fa5690a58e7de90ac214648a"},"schema_version":"1.0"},"canonical_sha256":"7398cf41fc7be3b30734d26d273424dd903e7f15dfcbc278b5fe3925cdf12a94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:29.192867Z","signature_b64":"zDBrLrSKXhWHghkA8eVJyoTrkrqH8XXpB4z8XNZMOSgMvgW19PLr/zMlLGkFtxq0XswbhXppwkrmEv1hhs68AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7398cf41fc7be3b30734d26d273424dd903e7f15dfcbc278b5fe3925cdf12a94","last_reissued_at":"2026-05-17T23:41:29.192206Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:29.192206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.02266","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:41:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zi37tja5DAk98fiOGqifj04wA+KfZbblK4dgziARtsY9f5yVK3mcdgd6C382mgEDT+uXRradB+5NuT4xuf+hBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:15:46.185982Z"},"content_sha256":"413580e7c699f0b2ff66ab3c5e9b2b06950e87107afbdd6f18a4fad31565a987","schema_version":"1.0","event_id":"sha256:413580e7c699f0b2ff66ab3c5e9b2b06950e87107afbdd6f18a4fad31565a987"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OOMM6QP4PPR3GBZU2JWSONBE3W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Karczmarz, Jakub {\\L}\\k{a}cki","submitted_at":"2019-07-04T08:22:03Z","abstract_excerpt":"We give new partially-dynamic algorithms for the all-pairs shortest paths problem in weighted directed graphs. Most importantly, we give a new deterministic incremental algorithm for the problem that handles updates in $\\widetilde{O}(mn^{4/3}\\log{W}/\\epsilon)$ total time (where the edge weights are from $[1,W]$) and explicitly maintains a $(1+\\epsilon)$-approximate distance matrix. For a fixed $\\epsilon>0$, this is the first deterministic partially dynamic algorithm for all-pairs shortest paths in directed graphs, whose update time is $o(n^2)$ regardless of the number of edges. Furthermore, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02266","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:41:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vE68oFdQlaW2QMmvQIYXzCR199UVCyslLVpiWtNRlzk2IcYuau70KWYKhDdA3JSnnd6Tuk2LYK2WY7J8Rd30CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:15:46.186656Z"},"content_sha256":"469a2bd50fe4ab0ca7ec1afacc57dffe48a3d99305b717276daa2c644bec3d02","schema_version":"1.0","event_id":"sha256:469a2bd50fe4ab0ca7ec1afacc57dffe48a3d99305b717276daa2c644bec3d02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OOMM6QP4PPR3GBZU2JWSONBE3W/bundle.json","state_url":"https://pith.science/pith/OOMM6QP4PPR3GBZU2JWSONBE3W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OOMM6QP4PPR3GBZU2JWSONBE3W/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-28T00:15:46Z","links":{"resolver":"https://pith.science/pith/OOMM6QP4PPR3GBZU2JWSONBE3W","bundle":"https://pith.science/pith/OOMM6QP4PPR3GBZU2JWSONBE3W/bundle.json","state":"https://pith.science/pith/OOMM6QP4PPR3GBZU2JWSONBE3W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OOMM6QP4PPR3GBZU2JWSONBE3W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OOMM6QP4PPR3GBZU2JWSONBE3W","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":"5de4954a6ba1767d3b3d2fd5ffb20ceef60d84f1fa5690a58e7de90ac214648a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-04T08:22:03Z","title_canon_sha256":"f62d9c4fcacd42d202ad275dd596c780ec4aff852734ed51650d9498a3077209"},"schema_version":"1.0","source":{"id":"1907.02266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02266","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02266v1","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02266","created_at":"2026-05-17T23:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"OOMM6QP4PPR3","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OOMM6QP4PPR3GBZU","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OOMM6QP4","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:469a2bd50fe4ab0ca7ec1afacc57dffe48a3d99305b717276daa2c644bec3d02","target":"graph","created_at":"2026-05-17T23:41:29Z","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 give new partially-dynamic algorithms for the all-pairs shortest paths problem in weighted directed graphs. Most importantly, we give a new deterministic incremental algorithm for the problem that handles updates in $\\widetilde{O}(mn^{4/3}\\log{W}/\\epsilon)$ total time (where the edge weights are from $[1,W]$) and explicitly maintains a $(1+\\epsilon)$-approximate distance matrix. For a fixed $\\epsilon>0$, this is the first deterministic partially dynamic algorithm for all-pairs shortest paths in directed graphs, whose update time is $o(n^2)$ regardless of the number of edges. Furthermore, we","authors_text":"Adam Karczmarz, Jakub {\\L}\\k{a}cki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-04T08:22:03Z","title":"Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02266","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:413580e7c699f0b2ff66ab3c5e9b2b06950e87107afbdd6f18a4fad31565a987","target":"record","created_at":"2026-05-17T23:41:29Z","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":"5de4954a6ba1767d3b3d2fd5ffb20ceef60d84f1fa5690a58e7de90ac214648a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-04T08:22:03Z","title_canon_sha256":"f62d9c4fcacd42d202ad275dd596c780ec4aff852734ed51650d9498a3077209"},"schema_version":"1.0","source":{"id":"1907.02266","kind":"arxiv","version":1}},"canonical_sha256":"7398cf41fc7be3b30734d26d273424dd903e7f15dfcbc278b5fe3925cdf12a94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7398cf41fc7be3b30734d26d273424dd903e7f15dfcbc278b5fe3925cdf12a94","first_computed_at":"2026-05-17T23:41:29.192206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:29.192206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zDBrLrSKXhWHghkA8eVJyoTrkrqH8XXpB4z8XNZMOSgMvgW19PLr/zMlLGkFtxq0XswbhXppwkrmEv1hhs68AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:29.192867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:413580e7c699f0b2ff66ab3c5e9b2b06950e87107afbdd6f18a4fad31565a987","sha256:469a2bd50fe4ab0ca7ec1afacc57dffe48a3d99305b717276daa2c644bec3d02"],"state_sha256":"36c1b0cea51861981abd7ae9e1aeb92ae2927f18d0eb01f9030ee1bdfb9bc66b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tX37Oa974jUEtqJkbusjO5fnn04O0Fzc3LedNv4adZ5ZexvGgxku5dnyAhNVfnyA6N9psJgGZHTXaHPcb5QWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:15:46.190000Z","bundle_sha256":"5eb498f42c871785129479e61e8c7716b033fca9850fd42f91443e5c41c2406d"}}