{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NH44ZKZUFILK63SNUMI2JST4RO","short_pith_number":"pith:NH44ZKZU","schema_version":"1.0","canonical_sha256":"69f9ccab342a16af6e4da311a4ca7c8ba32438c16088e47a8579c86e4004e9c3","source":{"kind":"arxiv","id":"2110.11712","version":1},"attestation_state":"computed","paper":{"title":"Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Maximilian Probst Gutenberg, Rasmus Kyng, Simon Meierhans","submitted_at":"2021-10-22T11:19:14Z","abstract_excerpt":"Given a directed, weighted graph $G=(V,E)$ undergoing edge insertions, the incremental single-source shortest paths (SSSP) problem asks for the maintenance of approximate distances from a dedicated source $s$ while optimizing the total time required to process the insertion sequence of $m$ edges.\n  Recently, Gutenberg, Williams and Wein [STOC'20] introduced a deterministic $\\tilde{O}(n^2)$ algorithm for this problem, achieving near linear time for very dense graphs. For sparse graphs, Chechik and Zhang [SODA'21] recently presented a deterministic $\\tilde{O}(m^{5/3})$ algorithm, and an adaptive"},"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":"2110.11712","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-10-22T11:19:14Z","cross_cats_sorted":[],"title_canon_sha256":"a2f8917fd092e4e3e4684f47c150508c65fc8640f5a409c9acc9f9f33ef1a62a","abstract_canon_sha256":"8a7b4f855cad47e2d87338afe8c4c88a4ec7b0823246a1b7ad2f2c0e08c81749"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:24:50.402447Z","signature_b64":"H9afAnHb1yAydy0nOdatSeKloaMvsF+/byPqrvBI3B8w71hkvi1CicKEMsKOV4Qi8zEvQd4ReTWxSvULyIahDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69f9ccab342a16af6e4da311a4ca7c8ba32438c16088e47a8579c86e4004e9c3","last_reissued_at":"2026-07-05T03:24:50.402039Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:24:50.402039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Maximilian Probst Gutenberg, Rasmus Kyng, Simon Meierhans","submitted_at":"2021-10-22T11:19:14Z","abstract_excerpt":"Given a directed, weighted graph $G=(V,E)$ undergoing edge insertions, the incremental single-source shortest paths (SSSP) problem asks for the maintenance of approximate distances from a dedicated source $s$ while optimizing the total time required to process the insertion sequence of $m$ edges.\n  Recently, Gutenberg, Williams and Wein [STOC'20] introduced a deterministic $\\tilde{O}(n^2)$ algorithm for this problem, achieving near linear time for very dense graphs. For sparse graphs, Chechik and Zhang [SODA'21] recently presented a deterministic $\\tilde{O}(m^{5/3})$ algorithm, and an adaptive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.11712","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/2110.11712/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":"2110.11712","created_at":"2026-07-05T03:24:50.402092+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.11712v1","created_at":"2026-07-05T03:24:50.402092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.11712","created_at":"2026-07-05T03:24:50.402092+00:00"},{"alias_kind":"pith_short_12","alias_value":"NH44ZKZUFILK","created_at":"2026-07-05T03:24:50.402092+00:00"},{"alias_kind":"pith_short_16","alias_value":"NH44ZKZUFILK63SN","created_at":"2026-07-05T03:24:50.402092+00:00"},{"alias_kind":"pith_short_8","alias_value":"NH44ZKZU","created_at":"2026-07-05T03:24:50.402092+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/NH44ZKZUFILK63SNUMI2JST4RO","json":"https://pith.science/pith/NH44ZKZUFILK63SNUMI2JST4RO.json","graph_json":"https://pith.science/api/pith-number/NH44ZKZUFILK63SNUMI2JST4RO/graph.json","events_json":"https://pith.science/api/pith-number/NH44ZKZUFILK63SNUMI2JST4RO/events.json","paper":"https://pith.science/paper/NH44ZKZU"},"agent_actions":{"view_html":"https://pith.science/pith/NH44ZKZUFILK63SNUMI2JST4RO","download_json":"https://pith.science/pith/NH44ZKZUFILK63SNUMI2JST4RO.json","view_paper":"https://pith.science/paper/NH44ZKZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.11712&json=true","fetch_graph":"https://pith.science/api/pith-number/NH44ZKZUFILK63SNUMI2JST4RO/graph.json","fetch_events":"https://pith.science/api/pith-number/NH44ZKZUFILK63SNUMI2JST4RO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NH44ZKZUFILK63SNUMI2JST4RO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NH44ZKZUFILK63SNUMI2JST4RO/action/storage_attestation","attest_author":"https://pith.science/pith/NH44ZKZUFILK63SNUMI2JST4RO/action/author_attestation","sign_citation":"https://pith.science/pith/NH44ZKZUFILK63SNUMI2JST4RO/action/citation_signature","submit_replication":"https://pith.science/pith/NH44ZKZUFILK63SNUMI2JST4RO/action/replication_record"}},"created_at":"2026-07-05T03:24:50.402092+00:00","updated_at":"2026-07-05T03:24:50.402092+00:00"}