{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FTNMUOAVNDHZPISTCDJ4PNDVHA","short_pith_number":"pith:FTNMUOAV","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"},"canonical_sha256":"2cdaca381568cf97a25310d3c7b475380ab7b4a864170de7f75a801713d83f1a","source":{"kind":"arxiv","id":"1905.11512","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11512","created_at":"2026-05-17T23:44:53Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11512v1","created_at":"2026-05-17T23:44:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11512","created_at":"2026-05-17T23:44:53Z"},{"alias_kind":"pith_short_12","alias_value":"FTNMUOAVNDHZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FTNMUOAVNDHZPIST","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FTNMUOAV","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FTNMUOAVNDHZPISTCDJ4PNDVHA","target":"record","payload":{"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"},"canonical_sha256":"2cdaca381568cf97a25310d3c7b475380ab7b4a864170de7f75a801713d83f1a","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"},"source_kind":"arxiv","source_id":"1905.11512","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lv4eg6mdOoGSHd25PS1WQPrfrPHvEs5pSXKKAUGBxiyODlRXrx2CzPhW+L7b8mWcGSgCh36bXh0yKqFwaCpYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:19:40.068975Z"},"content_sha256":"23b44bd25c498aed32875742790b3a68932d5dc10750d11c30ccaeba1dda826f","schema_version":"1.0","event_id":"sha256:23b44bd25c498aed32875742790b3a68932d5dc10750d11c30ccaeba1dda826f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FTNMUOAVNDHZPISTCDJ4PNDVHA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g7ahBA3GVeN8tpubqSVpY6I7LXlVwKTYe0hh7IVou//PnxxWtP9t57tWyll6jlGetD55cWiIeji/VOY1eb4yBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:19:40.069350Z"},"content_sha256":"9f1f20c4fa26c43fb1a50c75449efd0a6119a33f9a1cb004823dc4f461fadff4","schema_version":"1.0","event_id":"sha256:9f1f20c4fa26c43fb1a50c75449efd0a6119a33f9a1cb004823dc4f461fadff4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FTNMUOAVNDHZPISTCDJ4PNDVHA/bundle.json","state_url":"https://pith.science/pith/FTNMUOAVNDHZPISTCDJ4PNDVHA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FTNMUOAVNDHZPISTCDJ4PNDVHA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T13:19:40Z","links":{"resolver":"https://pith.science/pith/FTNMUOAVNDHZPISTCDJ4PNDVHA","bundle":"https://pith.science/pith/FTNMUOAVNDHZPISTCDJ4PNDVHA/bundle.json","state":"https://pith.science/pith/FTNMUOAVNDHZPISTCDJ4PNDVHA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FTNMUOAVNDHZPISTCDJ4PNDVHA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FTNMUOAVNDHZPISTCDJ4PNDVHA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"58b9a1237ab784522b25d813b760f21a17a936ba15f705628e7816252b80ee61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-27T21:23:18Z","title_canon_sha256":"5966cabd0a6418665e527e42aa8e7877687099182e022e5edcf40aa8b9e62ef3"},"schema_version":"1.0","source":{"id":"1905.11512","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11512","created_at":"2026-05-17T23:44:53Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11512v1","created_at":"2026-05-17T23:44:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11512","created_at":"2026-05-17T23:44:53Z"},{"alias_kind":"pith_short_12","alias_value":"FTNMUOAVNDHZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FTNMUOAVNDHZPIST","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FTNMUOAV","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:9f1f20c4fa26c43fb1a50c75449efd0a6119a33f9a1cb004823dc4f461fadff4","target":"graph","created_at":"2026-05-17T23:44:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Julia Chuzhoy, Sanjeev Khanna","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-27T21:23:18Z","title":"A New Algorithm for Decremental Single-Source Shortest Paths with Applications to Vertex-Capacitated Flow and Cut Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11512","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:23b44bd25c498aed32875742790b3a68932d5dc10750d11c30ccaeba1dda826f","target":"record","created_at":"2026-05-17T23:44:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"58b9a1237ab784522b25d813b760f21a17a936ba15f705628e7816252b80ee61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-27T21:23:18Z","title_canon_sha256":"5966cabd0a6418665e527e42aa8e7877687099182e022e5edcf40aa8b9e62ef3"},"schema_version":"1.0","source":{"id":"1905.11512","kind":"arxiv","version":1}},"canonical_sha256":"2cdaca381568cf97a25310d3c7b475380ab7b4a864170de7f75a801713d83f1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cdaca381568cf97a25310d3c7b475380ab7b4a864170de7f75a801713d83f1a","first_computed_at":"2026-05-17T23:44:53.190958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:53.190958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y2VCKdvpdYSAw74r8xWREIh3mG8FQCmdzwpr1718T2q8YQw3lDt3IbVj7ZTNgD99j2G8q/PgGXcQf+8Lu32NCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:53.191531Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11512","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23b44bd25c498aed32875742790b3a68932d5dc10750d11c30ccaeba1dda826f","sha256:9f1f20c4fa26c43fb1a50c75449efd0a6119a33f9a1cb004823dc4f461fadff4"],"state_sha256":"03613e73a7b5658c95db75424e26a050cdb72d7d71abe3c0ff6529f4870541c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HM7vSYMdYiBjnGoUbqryw1hMew4U15BQo//rVSRmPeCFKyApGjRBcVW6gHCEvvrKhE3KsVGrpQTkxYRbNVdJAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:19:40.071249Z","bundle_sha256":"583ddfffce51f614d284bf6baa9a0c3648d76dbadd857efdad8fe9c209d05f84"}}