{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:IPMV5QKR5GW7UK6KDGGYOOLD37","short_pith_number":"pith:IPMV5QKR","schema_version":"1.0","canonical_sha256":"43d95ec151e9adfa2bca198d873963dfdefe9f9ec90de22424617a83211d31eb","source":{"kind":"arxiv","id":"2001.10751","version":1},"attestation_state":"computed","paper":{"title":"New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Maximilian Probst Gutenberg, Nicole Wein, Virginia Vassilevska Williams","submitted_at":"2020-01-29T10:36:30Z","abstract_excerpt":"In the dynamic Single-Source Shortest Paths (SSSP) problem, we are given a graph $G=(V,E)$ subject to edge insertions and deletions and a source vertex $s\\in V$, and the goal is to maintain the distance $d(s,t)$ for all $t\\in V$.\n  Fine-grained complexity has provided strong lower bounds for exact partially dynamic SSSP and approximate fully dynamic SSSP [ESA'04, FOCS'14, STOC'15]. Thus much focus has been directed towards finding efficient partially dynamic $(1+\\epsilon)$-approximate SSSP algorithms [STOC'14, ICALP'15, SODA'14, FOCS'14, STOC'16, SODA'17, ICALP'17, ICALP'19, STOC'19, SODA'20, "},"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":"2001.10751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-01-29T10:36:30Z","cross_cats_sorted":[],"title_canon_sha256":"9c661e8669b2d8b3ecd41da83cbf290c06caa1f37afd4fd3aed77175d4a6e72c","abstract_canon_sha256":"624f32e9e798d9c157b0beccd70f1191ea4703a2c4753099b52808300571af78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:37:11.878689Z","signature_b64":"zeABjquejmFHqdAWuG6xRb4II8FWc9A3uWgcbXzZ8/OD/2wCn+Qpl0Ep+pt2omtHz9M5KFA8WZwecOu9mt6UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43d95ec151e9adfa2bca198d873963dfdefe9f9ec90de22424617a83211d31eb","last_reissued_at":"2026-07-05T00:37:11.878193Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:37:11.878193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Maximilian Probst Gutenberg, Nicole Wein, Virginia Vassilevska Williams","submitted_at":"2020-01-29T10:36:30Z","abstract_excerpt":"In the dynamic Single-Source Shortest Paths (SSSP) problem, we are given a graph $G=(V,E)$ subject to edge insertions and deletions and a source vertex $s\\in V$, and the goal is to maintain the distance $d(s,t)$ for all $t\\in V$.\n  Fine-grained complexity has provided strong lower bounds for exact partially dynamic SSSP and approximate fully dynamic SSSP [ESA'04, FOCS'14, STOC'15]. Thus much focus has been directed towards finding efficient partially dynamic $(1+\\epsilon)$-approximate SSSP algorithms [STOC'14, ICALP'15, SODA'14, FOCS'14, STOC'16, SODA'17, ICALP'17, ICALP'19, STOC'19, SODA'20, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.10751","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.10751/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2001.10751","created_at":"2026-07-05T00:37:11.878261+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.10751v1","created_at":"2026-07-05T00:37:11.878261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.10751","created_at":"2026-07-05T00:37:11.878261+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPMV5QKR5GW7","created_at":"2026-07-05T00:37:11.878261+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPMV5QKR5GW7UK6K","created_at":"2026-07-05T00:37:11.878261+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPMV5QKR","created_at":"2026-07-05T00:37:11.878261+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/IPMV5QKR5GW7UK6KDGGYOOLD37","json":"https://pith.science/pith/IPMV5QKR5GW7UK6KDGGYOOLD37.json","graph_json":"https://pith.science/api/pith-number/IPMV5QKR5GW7UK6KDGGYOOLD37/graph.json","events_json":"https://pith.science/api/pith-number/IPMV5QKR5GW7UK6KDGGYOOLD37/events.json","paper":"https://pith.science/paper/IPMV5QKR"},"agent_actions":{"view_html":"https://pith.science/pith/IPMV5QKR5GW7UK6KDGGYOOLD37","download_json":"https://pith.science/pith/IPMV5QKR5GW7UK6KDGGYOOLD37.json","view_paper":"https://pith.science/paper/IPMV5QKR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.10751&json=true","fetch_graph":"https://pith.science/api/pith-number/IPMV5QKR5GW7UK6KDGGYOOLD37/graph.json","fetch_events":"https://pith.science/api/pith-number/IPMV5QKR5GW7UK6KDGGYOOLD37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPMV5QKR5GW7UK6KDGGYOOLD37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPMV5QKR5GW7UK6KDGGYOOLD37/action/storage_attestation","attest_author":"https://pith.science/pith/IPMV5QKR5GW7UK6KDGGYOOLD37/action/author_attestation","sign_citation":"https://pith.science/pith/IPMV5QKR5GW7UK6KDGGYOOLD37/action/citation_signature","submit_replication":"https://pith.science/pith/IPMV5QKR5GW7UK6KDGGYOOLD37/action/replication_record"}},"created_at":"2026-07-05T00:37:11.878261+00:00","updated_at":"2026-07-05T00:37:11.878261+00:00"}