{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2LG4MVSBLQ6VHEDFK4AHNFAN2Q","short_pith_number":"pith:2LG4MVSB","schema_version":"1.0","canonical_sha256":"d2cdc656415c3d539065570076940dd4141d69d883616fe402de8809c567663d","source":{"kind":"arxiv","id":"2001.10809","version":1},"attestation_state":"computed","paper":{"title":"Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Wulff-Nilsen, Maximilian Probst Gutenberg","submitted_at":"2020-01-29T13:22:22Z","abstract_excerpt":"In the decremental $(1+\\epsilon)$-approximate Single-Source Shortest Path (SSSP) problem, we are given a graph $G=(V,E)$ with $n = |V|, m = |E|$, undergoing edge deletions, and a distinguished source $s \\in V$, and we are asked to process edge deletions efficiently and answer queries for distance estimates $\\widetilde{\\mathbf{dist}}_G(s,v)$ for each $v \\in V$, at any stage, such that $\\mathbf{dist}_G(s,v) \\leq \\widetilde{\\mathbf{dist}}_G(s,v) \\leq (1+ \\epsilon)\\mathbf{dist}_G(s,v)$. In the decremental $(1+\\epsilon)$-approximate All-Pairs Shortest Path (APSP) problem, we are asked to answer que"},"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.10809","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-01-29T13:22:22Z","cross_cats_sorted":[],"title_canon_sha256":"6ecb7825bbd5bdfccbee3108ebf63b7c95fbeb177603e5e3c295ea32d42fc6eb","abstract_canon_sha256":"49852f8a4097829225c1557c94ab239d74762723c2f0a7b718f1e4702090c059"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:37:12.298257Z","signature_b64":"a7uKijFEU/z8fvPZyBf45yspIGcwBDl9yirNeTVePL2TEPP+WhgB+ClNfq7PAzsP+eRTYyz8W/iE7M3SBY9dAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2cdc656415c3d539065570076940dd4141d69d883616fe402de8809c567663d","last_reissued_at":"2026-07-05T00:37:12.297860Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:37:12.297860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Wulff-Nilsen, Maximilian Probst Gutenberg","submitted_at":"2020-01-29T13:22:22Z","abstract_excerpt":"In the decremental $(1+\\epsilon)$-approximate Single-Source Shortest Path (SSSP) problem, we are given a graph $G=(V,E)$ with $n = |V|, m = |E|$, undergoing edge deletions, and a distinguished source $s \\in V$, and we are asked to process edge deletions efficiently and answer queries for distance estimates $\\widetilde{\\mathbf{dist}}_G(s,v)$ for each $v \\in V$, at any stage, such that $\\mathbf{dist}_G(s,v) \\leq \\widetilde{\\mathbf{dist}}_G(s,v) \\leq (1+ \\epsilon)\\mathbf{dist}_G(s,v)$. In the decremental $(1+\\epsilon)$-approximate All-Pairs Shortest Path (APSP) problem, we are asked to answer que"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.10809","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.10809/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.10809","created_at":"2026-07-05T00:37:12.297916+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.10809v1","created_at":"2026-07-05T00:37:12.297916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.10809","created_at":"2026-07-05T00:37:12.297916+00:00"},{"alias_kind":"pith_short_12","alias_value":"2LG4MVSBLQ6V","created_at":"2026-07-05T00:37:12.297916+00:00"},{"alias_kind":"pith_short_16","alias_value":"2LG4MVSBLQ6VHEDF","created_at":"2026-07-05T00:37:12.297916+00:00"},{"alias_kind":"pith_short_8","alias_value":"2LG4MVSB","created_at":"2026-07-05T00:37:12.297916+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/2LG4MVSBLQ6VHEDFK4AHNFAN2Q","json":"https://pith.science/pith/2LG4MVSBLQ6VHEDFK4AHNFAN2Q.json","graph_json":"https://pith.science/api/pith-number/2LG4MVSBLQ6VHEDFK4AHNFAN2Q/graph.json","events_json":"https://pith.science/api/pith-number/2LG4MVSBLQ6VHEDFK4AHNFAN2Q/events.json","paper":"https://pith.science/paper/2LG4MVSB"},"agent_actions":{"view_html":"https://pith.science/pith/2LG4MVSBLQ6VHEDFK4AHNFAN2Q","download_json":"https://pith.science/pith/2LG4MVSBLQ6VHEDFK4AHNFAN2Q.json","view_paper":"https://pith.science/paper/2LG4MVSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.10809&json=true","fetch_graph":"https://pith.science/api/pith-number/2LG4MVSBLQ6VHEDFK4AHNFAN2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/2LG4MVSBLQ6VHEDFK4AHNFAN2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2LG4MVSBLQ6VHEDFK4AHNFAN2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2LG4MVSBLQ6VHEDFK4AHNFAN2Q/action/storage_attestation","attest_author":"https://pith.science/pith/2LG4MVSBLQ6VHEDFK4AHNFAN2Q/action/author_attestation","sign_citation":"https://pith.science/pith/2LG4MVSBLQ6VHEDFK4AHNFAN2Q/action/citation_signature","submit_replication":"https://pith.science/pith/2LG4MVSBLQ6VHEDFK4AHNFAN2Q/action/replication_record"}},"created_at":"2026-07-05T00:37:12.297916+00:00","updated_at":"2026-07-05T00:37:12.297916+00:00"}