{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FTNMUOAVNDHZPISTCDJ4PNDVHA","short_pith_number":"pith:FTNMUOAV","schema_version":"1.0","canonical_sha256":"2cdaca381568cf97a25310d3c7b475380ab7b4a864170de7f75a801713d83f1a","source":{"kind":"arxiv","id":"1905.11512","version":1},"attestation_state":"computed","paper":{"title":"A New Algorithm for Decremental Single-Source Shortest Paths with Applications to Vertex-Capacitated Flow and Cut Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Julia Chuzhoy, Sanjeev Khanna","submitted_at":"2019-05-27T21:23:18Z","abstract_excerpt":"We study the vertex-decremental Single-Source Shortest Paths (SSSP) problem: given an undirected graph $G=(V,E)$ with lengths $\\ell(e)\\geq 1$ on its edges and a source vertex $s$, we need to support (approximate) shortest-path queries in $G$, as $G$ undergoes vertex deletions. In a shortest-path query, given a vertex $v$, we need to return a path connecting $s$ to $v$, whose length is at most $(1+\\epsilon)$ times the length of the shortest such path, where $\\epsilon$ is a given accuracy parameter. The problem has many applications, for example to flow and cut problems in vertex-capacitated gra"},"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":"1905.11512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-27T21:23:18Z","cross_cats_sorted":[],"title_canon_sha256":"5966cabd0a6418665e527e42aa8e7877687099182e022e5edcf40aa8b9e62ef3","abstract_canon_sha256":"58b9a1237ab784522b25d813b760f21a17a936ba15f705628e7816252b80ee61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:53.191531Z","signature_b64":"Y2VCKdvpdYSAw74r8xWREIh3mG8FQCmdzwpr1718T2q8YQw3lDt3IbVj7ZTNgD99j2G8q/PgGXcQf+8Lu32NCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cdaca381568cf97a25310d3c7b475380ab7b4a864170de7f75a801713d83f1a","last_reissued_at":"2026-05-17T23:44:53.190958Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:53.190958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Algorithm for Decremental Single-Source Shortest Paths with Applications to Vertex-Capacitated Flow and Cut Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Julia Chuzhoy, Sanjeev Khanna","submitted_at":"2019-05-27T21:23:18Z","abstract_excerpt":"We study the vertex-decremental Single-Source Shortest Paths (SSSP) problem: given an undirected graph $G=(V,E)$ with lengths $\\ell(e)\\geq 1$ on its edges and a source vertex $s$, we need to support (approximate) shortest-path queries in $G$, as $G$ undergoes vertex deletions. In a shortest-path query, given a vertex $v$, we need to return a path connecting $s$ to $v$, whose length is at most $(1+\\epsilon)$ times the length of the shortest such path, where $\\epsilon$ is a given accuracy parameter. The problem has many applications, for example to flow and cut problems in vertex-capacitated gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11512","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":"1905.11512","created_at":"2026-05-17T23:44:53.191056+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.11512v1","created_at":"2026-05-17T23:44:53.191056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11512","created_at":"2026-05-17T23:44:53.191056+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTNMUOAVNDHZ","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTNMUOAVNDHZPIST","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTNMUOAV","created_at":"2026-05-18T12:33:15.570797+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/FTNMUOAVNDHZPISTCDJ4PNDVHA","json":"https://pith.science/pith/FTNMUOAVNDHZPISTCDJ4PNDVHA.json","graph_json":"https://pith.science/api/pith-number/FTNMUOAVNDHZPISTCDJ4PNDVHA/graph.json","events_json":"https://pith.science/api/pith-number/FTNMUOAVNDHZPISTCDJ4PNDVHA/events.json","paper":"https://pith.science/paper/FTNMUOAV"},"agent_actions":{"view_html":"https://pith.science/pith/FTNMUOAVNDHZPISTCDJ4PNDVHA","download_json":"https://pith.science/pith/FTNMUOAVNDHZPISTCDJ4PNDVHA.json","view_paper":"https://pith.science/paper/FTNMUOAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.11512&json=true","fetch_graph":"https://pith.science/api/pith-number/FTNMUOAVNDHZPISTCDJ4PNDVHA/graph.json","fetch_events":"https://pith.science/api/pith-number/FTNMUOAVNDHZPISTCDJ4PNDVHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTNMUOAVNDHZPISTCDJ4PNDVHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTNMUOAVNDHZPISTCDJ4PNDVHA/action/storage_attestation","attest_author":"https://pith.science/pith/FTNMUOAVNDHZPISTCDJ4PNDVHA/action/author_attestation","sign_citation":"https://pith.science/pith/FTNMUOAVNDHZPISTCDJ4PNDVHA/action/citation_signature","submit_replication":"https://pith.science/pith/FTNMUOAVNDHZPISTCDJ4PNDVHA/action/replication_record"}},"created_at":"2026-05-17T23:44:53.191056+00:00","updated_at":"2026-05-17T23:44:53.191056+00:00"}