{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OOMM6QP4PPR3GBZU2JWSONBE3W","short_pith_number":"pith:OOMM6QP4","schema_version":"1.0","canonical_sha256":"7398cf41fc7be3b30734d26d273424dd903e7f15dfcbc278b5fe3925cdf12a94","source":{"kind":"arxiv","id":"1907.02266","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.02266","created_at":"2026-05-17T23:41:29.192353+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02266v1","created_at":"2026-05-17T23:41:29.192353+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02266","created_at":"2026-05-17T23:41:29.192353+00:00"},{"alias_kind":"pith_short_12","alias_value":"OOMM6QP4PPR3","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OOMM6QP4PPR3GBZU","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OOMM6QP4","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OOMM6QP4PPR3GBZU2JWSONBE3W","json":"https://pith.science/pith/OOMM6QP4PPR3GBZU2JWSONBE3W.json","graph_json":"https://pith.science/api/pith-number/OOMM6QP4PPR3GBZU2JWSONBE3W/graph.json","events_json":"https://pith.science/api/pith-number/OOMM6QP4PPR3GBZU2JWSONBE3W/events.json","paper":"https://pith.science/paper/OOMM6QP4"},"agent_actions":{"view_html":"https://pith.science/pith/OOMM6QP4PPR3GBZU2JWSONBE3W","download_json":"https://pith.science/pith/OOMM6QP4PPR3GBZU2JWSONBE3W.json","view_paper":"https://pith.science/paper/OOMM6QP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02266&json=true","fetch_graph":"https://pith.science/api/pith-number/OOMM6QP4PPR3GBZU2JWSONBE3W/graph.json","fetch_events":"https://pith.science/api/pith-number/OOMM6QP4PPR3GBZU2JWSONBE3W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OOMM6QP4PPR3GBZU2JWSONBE3W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OOMM6QP4PPR3GBZU2JWSONBE3W/action/storage_attestation","attest_author":"https://pith.science/pith/OOMM6QP4PPR3GBZU2JWSONBE3W/action/author_attestation","sign_citation":"https://pith.science/pith/OOMM6QP4PPR3GBZU2JWSONBE3W/action/citation_signature","submit_replication":"https://pith.science/pith/OOMM6QP4PPR3GBZU2JWSONBE3W/action/replication_record"}},"created_at":"2026-05-17T23:41:29.192353+00:00","updated_at":"2026-05-17T23:41:29.192353+00:00"}