{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:32WBQ4ZZ2W6T6ZB327SBIWGBPL","short_pith_number":"pith:32WBQ4ZZ","schema_version":"1.0","canonical_sha256":"deac187339d5bd3f643bd7e41458c17adb77afd3bb004e7144522e4183a66bbc","source":{"kind":"arxiv","id":"2009.02584","version":3},"attestation_state":"computed","paper":{"title":"Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak","submitted_at":"2020-09-05T19:11:13Z","abstract_excerpt":"Let $G = (V,E,w)$ be a weighted, digraph subject to a sequence of adversarial edge deletions. In the decremental single-source reachability problem (SSR), we are given a fixed source $s$ and the goal is to maintain a data structure that can answer path-queries $s \\rightarrowtail v$ for any $v \\in V$. In the more general single-source shortest paths (SSSP) problem the goal is to return an approximate shortest path to $v$, and in the SCC problem the goal is to maintain strongly connected components of $G$ and to answer path queries within each component. All of these problems have been very acti"},"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":"2009.02584","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-09-05T19:11:13Z","cross_cats_sorted":[],"title_canon_sha256":"02e2fe2de075df2d02511b9d88de359504b8f7c8bcebf6cc0020a987d5b6b881","abstract_canon_sha256":"0734b1041efd5363c462952a20a2cc1ec35851acae38e4e95bd46dde21defae0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:07:30.675908Z","signature_b64":"fxRReJkJH4/c7t4p46NtrvBiuipvRBe+sJDuLoyVTEaMFQj5ERmfIjBVR4S+/BnU9z59NsEw/tRsBRkWtLLcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deac187339d5bd3f643bd7e41458c17adb77afd3bb004e7144522e4183a66bbc","last_reissued_at":"2026-07-05T02:07:30.675454Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:07:30.675454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak","submitted_at":"2020-09-05T19:11:13Z","abstract_excerpt":"Let $G = (V,E,w)$ be a weighted, digraph subject to a sequence of adversarial edge deletions. In the decremental single-source reachability problem (SSR), we are given a fixed source $s$ and the goal is to maintain a data structure that can answer path-queries $s \\rightarrowtail v$ for any $v \\in V$. In the more general single-source shortest paths (SSSP) problem the goal is to return an approximate shortest path to $v$, and in the SCC problem the goal is to maintain strongly connected components of $G$ and to answer path queries within each component. All of these problems have been very acti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.02584","kind":"arxiv","version":3},"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/2009.02584/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":"2009.02584","created_at":"2026-07-05T02:07:30.675523+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.02584v3","created_at":"2026-07-05T02:07:30.675523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.02584","created_at":"2026-07-05T02:07:30.675523+00:00"},{"alias_kind":"pith_short_12","alias_value":"32WBQ4ZZ2W6T","created_at":"2026-07-05T02:07:30.675523+00:00"},{"alias_kind":"pith_short_16","alias_value":"32WBQ4ZZ2W6T6ZB3","created_at":"2026-07-05T02:07:30.675523+00:00"},{"alias_kind":"pith_short_8","alias_value":"32WBQ4ZZ","created_at":"2026-07-05T02:07:30.675523+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02213","citing_title":"A New Method for Finding the Schulze Winner Set","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/32WBQ4ZZ2W6T6ZB327SBIWGBPL","json":"https://pith.science/pith/32WBQ4ZZ2W6T6ZB327SBIWGBPL.json","graph_json":"https://pith.science/api/pith-number/32WBQ4ZZ2W6T6ZB327SBIWGBPL/graph.json","events_json":"https://pith.science/api/pith-number/32WBQ4ZZ2W6T6ZB327SBIWGBPL/events.json","paper":"https://pith.science/paper/32WBQ4ZZ"},"agent_actions":{"view_html":"https://pith.science/pith/32WBQ4ZZ2W6T6ZB327SBIWGBPL","download_json":"https://pith.science/pith/32WBQ4ZZ2W6T6ZB327SBIWGBPL.json","view_paper":"https://pith.science/paper/32WBQ4ZZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.02584&json=true","fetch_graph":"https://pith.science/api/pith-number/32WBQ4ZZ2W6T6ZB327SBIWGBPL/graph.json","fetch_events":"https://pith.science/api/pith-number/32WBQ4ZZ2W6T6ZB327SBIWGBPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32WBQ4ZZ2W6T6ZB327SBIWGBPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32WBQ4ZZ2W6T6ZB327SBIWGBPL/action/storage_attestation","attest_author":"https://pith.science/pith/32WBQ4ZZ2W6T6ZB327SBIWGBPL/action/author_attestation","sign_citation":"https://pith.science/pith/32WBQ4ZZ2W6T6ZB327SBIWGBPL/action/citation_signature","submit_replication":"https://pith.science/pith/32WBQ4ZZ2W6T6ZB327SBIWGBPL/action/replication_record"}},"created_at":"2026-07-05T02:07:30.675523+00:00","updated_at":"2026-07-05T02:07:30.675523+00:00"}