{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:32WBQ4ZZ2W6T6ZB327SBIWGBPL","short_pith_number":"pith:32WBQ4ZZ","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"},"canonical_sha256":"deac187339d5bd3f643bd7e41458c17adb77afd3bb004e7144522e4183a66bbc","source":{"kind":"arxiv","id":"2009.02584","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.02584","created_at":"2026-07-05T02:07:30Z"},{"alias_kind":"arxiv_version","alias_value":"2009.02584v3","created_at":"2026-07-05T02:07:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.02584","created_at":"2026-07-05T02:07:30Z"},{"alias_kind":"pith_short_12","alias_value":"32WBQ4ZZ2W6T","created_at":"2026-07-05T02:07:30Z"},{"alias_kind":"pith_short_16","alias_value":"32WBQ4ZZ2W6T6ZB3","created_at":"2026-07-05T02:07:30Z"},{"alias_kind":"pith_short_8","alias_value":"32WBQ4ZZ","created_at":"2026-07-05T02:07:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:32WBQ4ZZ2W6T6ZB327SBIWGBPL","target":"record","payload":{"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"},"canonical_sha256":"deac187339d5bd3f643bd7e41458c17adb77afd3bb004e7144522e4183a66bbc","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"},"source_kind":"arxiv","source_id":"2009.02584","source_version":3,"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-07-05T02:07:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WeKVpnjojddxDnK4JAyKpvc1qaT/rbHTUR2ct2RRFKgX1tdGZzIK0AUzJ6y8lYLtJFR7yL9QmDx8sfE7I2I5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T16:37:55.211508Z"},"content_sha256":"7bfaaeffce9c3cba02aea766cd04a743893aae4c95a5ae716005a0a9e667ced5","schema_version":"1.0","event_id":"sha256:7bfaaeffce9c3cba02aea766cd04a743893aae4c95a5ae716005a0a9e667ced5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:32WBQ4ZZ2W6T6ZB327SBIWGBPL","target":"graph","payload":{"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"},"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-07-05T02:07:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASxs6tghU+9t/vJpg8oYaNfTva3e4dXOs5Nlr/MlFhiG2tC350Fi2M3N5CUsft4w+HME4EWMkc+u820Am8rXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T16:37:55.212043Z"},"content_sha256":"18af0eb7e8fbc00557745d64057eb052ccacb07fc54e35fd0e9bceeaa58f02e7","schema_version":"1.0","event_id":"sha256:18af0eb7e8fbc00557745d64057eb052ccacb07fc54e35fd0e9bceeaa58f02e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32WBQ4ZZ2W6T6ZB327SBIWGBPL/bundle.json","state_url":"https://pith.science/pith/32WBQ4ZZ2W6T6ZB327SBIWGBPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32WBQ4ZZ2W6T6ZB327SBIWGBPL/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-08-15T16:37:55Z","links":{"resolver":"https://pith.science/pith/32WBQ4ZZ2W6T6ZB327SBIWGBPL","bundle":"https://pith.science/pith/32WBQ4ZZ2W6T6ZB327SBIWGBPL/bundle.json","state":"https://pith.science/pith/32WBQ4ZZ2W6T6ZB327SBIWGBPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32WBQ4ZZ2W6T6ZB327SBIWGBPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:32WBQ4ZZ2W6T6ZB327SBIWGBPL","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":"0734b1041efd5363c462952a20a2cc1ec35851acae38e4e95bd46dde21defae0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-09-05T19:11:13Z","title_canon_sha256":"02e2fe2de075df2d02511b9d88de359504b8f7c8bcebf6cc0020a987d5b6b881"},"schema_version":"1.0","source":{"id":"2009.02584","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.02584","created_at":"2026-07-05T02:07:30Z"},{"alias_kind":"arxiv_version","alias_value":"2009.02584v3","created_at":"2026-07-05T02:07:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.02584","created_at":"2026-07-05T02:07:30Z"},{"alias_kind":"pith_short_12","alias_value":"32WBQ4ZZ2W6T","created_at":"2026-07-05T02:07:30Z"},{"alias_kind":"pith_short_16","alias_value":"32WBQ4ZZ2W6T6ZB3","created_at":"2026-07-05T02:07:30Z"},{"alias_kind":"pith_short_8","alias_value":"32WBQ4ZZ","created_at":"2026-07-05T02:07:30Z"}],"graph_snapshots":[{"event_id":"sha256:18af0eb7e8fbc00557745d64057eb052ccacb07fc54e35fd0e9bceeaa58f02e7","target":"graph","created_at":"2026-07-05T02:07:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2009.02584/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-09-05T19:11:13Z","title":"Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.02584","kind":"arxiv","version":3},"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:7bfaaeffce9c3cba02aea766cd04a743893aae4c95a5ae716005a0a9e667ced5","target":"record","created_at":"2026-07-05T02:07:30Z","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":"0734b1041efd5363c462952a20a2cc1ec35851acae38e4e95bd46dde21defae0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-09-05T19:11:13Z","title_canon_sha256":"02e2fe2de075df2d02511b9d88de359504b8f7c8bcebf6cc0020a987d5b6b881"},"schema_version":"1.0","source":{"id":"2009.02584","kind":"arxiv","version":3}},"canonical_sha256":"deac187339d5bd3f643bd7e41458c17adb77afd3bb004e7144522e4183a66bbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"deac187339d5bd3f643bd7e41458c17adb77afd3bb004e7144522e4183a66bbc","first_computed_at":"2026-07-05T02:07:30.675454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:07:30.675454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fxRReJkJH4/c7t4p46NtrvBiuipvRBe+sJDuLoyVTEaMFQj5ERmfIjBVR4S+/BnU9z59NsEw/tRsBRkWtLLcDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:07:30.675908Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.02584","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bfaaeffce9c3cba02aea766cd04a743893aae4c95a5ae716005a0a9e667ced5","sha256:18af0eb7e8fbc00557745d64057eb052ccacb07fc54e35fd0e9bceeaa58f02e7"],"state_sha256":"f7dfac5797ec09e0ef09a80d03761cd8312b826f36ebe8862f6e6a7f8fff81f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fS5RXnTktUPL3P8DEe9xX+fVGogXcINzPxxL0zpkEyh+dHAgHRt7QBoLo+D9R3ARP1c9/wni3g55CN5+zhogCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T16:37:55.217299Z","bundle_sha256":"49e4425acb9664f7a64dffa1ec7691daf32ea658995b8a2a25971f7e154fb6af"}}