{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6P56IZHH33ADLXMBU4DUQYUVO7","short_pith_number":"pith:6P56IZHH","schema_version":"1.0","canonical_sha256":"f3fbe464e7dec035dd81a70748629577c01a5c86eb4a31f7585e56ec1cfed9ea","source":{"kind":"arxiv","id":"1903.01756","version":1},"attestation_state":"computed","paper":{"title":"Semi-dynamic shortest-path tree algorithms for directed graphs with arbitrary weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sanjiang Li, Yongming Li","submitted_at":"2019-03-05T10:23:07Z","abstract_excerpt":"Given a directed graph $G$ with arbitrary real-valued weights, the single source shortest-path problem (SSSP) asks for, given a source $s$ in $G$, finding a shortest path from $s$ to each vertex $v$ in $G$. A classical SSSP algorithm detects a negative cycle of $G$ or constructs a shortest-path tree (SPT) rooted at $s$ in $O(mn)$ time, where $m,n$ are the numbers of edges and vertices in $G$ respectively. In many practical applications, new constraints come from time to time and we need to update the SPT frequently. Given an SPT $T$ of $G$, suppose the weight on a certain edge is modified. 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":"1903.01756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-05T10:23:07Z","cross_cats_sorted":[],"title_canon_sha256":"901a39004b4c23e9f1e557bef9de453cca9fb1a2a893ff247e3ecb66d41dc512","abstract_canon_sha256":"7eccdfaab7eb0286fca10979b971e55dad5ffbc917e7b3663ab7ec12a6ec7c01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:59.848412Z","signature_b64":"mox25C1Kck+s1sdMMKz19HUIZrRdiJvP7s7x1sGVuCfMstB3kvjd/BZ043JjWzzaDR+uk99lNFTSwYr0n8tLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3fbe464e7dec035dd81a70748629577c01a5c86eb4a31f7585e56ec1cfed9ea","last_reissued_at":"2026-05-17T23:51:59.847941Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:59.847941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-dynamic shortest-path tree algorithms for directed graphs with arbitrary weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sanjiang Li, Yongming Li","submitted_at":"2019-03-05T10:23:07Z","abstract_excerpt":"Given a directed graph $G$ with arbitrary real-valued weights, the single source shortest-path problem (SSSP) asks for, given a source $s$ in $G$, finding a shortest path from $s$ to each vertex $v$ in $G$. A classical SSSP algorithm detects a negative cycle of $G$ or constructs a shortest-path tree (SPT) rooted at $s$ in $O(mn)$ time, where $m,n$ are the numbers of edges and vertices in $G$ respectively. In many practical applications, new constraints come from time to time and we need to update the SPT frequently. Given an SPT $T$ of $G$, suppose the weight on a certain edge is modified. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01756","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":"1903.01756","created_at":"2026-05-17T23:51:59.848008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01756v1","created_at":"2026-05-17T23:51:59.848008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01756","created_at":"2026-05-17T23:51:59.848008+00:00"},{"alias_kind":"pith_short_12","alias_value":"6P56IZHH33AD","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"6P56IZHH33ADLXMB","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"6P56IZHH","created_at":"2026-05-18T12:33:10.108867+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/6P56IZHH33ADLXMBU4DUQYUVO7","json":"https://pith.science/pith/6P56IZHH33ADLXMBU4DUQYUVO7.json","graph_json":"https://pith.science/api/pith-number/6P56IZHH33ADLXMBU4DUQYUVO7/graph.json","events_json":"https://pith.science/api/pith-number/6P56IZHH33ADLXMBU4DUQYUVO7/events.json","paper":"https://pith.science/paper/6P56IZHH"},"agent_actions":{"view_html":"https://pith.science/pith/6P56IZHH33ADLXMBU4DUQYUVO7","download_json":"https://pith.science/pith/6P56IZHH33ADLXMBU4DUQYUVO7.json","view_paper":"https://pith.science/paper/6P56IZHH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01756&json=true","fetch_graph":"https://pith.science/api/pith-number/6P56IZHH33ADLXMBU4DUQYUVO7/graph.json","fetch_events":"https://pith.science/api/pith-number/6P56IZHH33ADLXMBU4DUQYUVO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6P56IZHH33ADLXMBU4DUQYUVO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6P56IZHH33ADLXMBU4DUQYUVO7/action/storage_attestation","attest_author":"https://pith.science/pith/6P56IZHH33ADLXMBU4DUQYUVO7/action/author_attestation","sign_citation":"https://pith.science/pith/6P56IZHH33ADLXMBU4DUQYUVO7/action/citation_signature","submit_replication":"https://pith.science/pith/6P56IZHH33ADLXMBU4DUQYUVO7/action/replication_record"}},"created_at":"2026-05-17T23:51:59.848008+00:00","updated_at":"2026-05-17T23:51:59.848008+00:00"}