{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DINRGULTEOE575AMMVPF4B2ESY","short_pith_number":"pith:DINRGULT","canonical_record":{"source":{"id":"1901.03615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-11T15:37:37Z","cross_cats_sorted":[],"title_canon_sha256":"a21765b320632b8ba00a60fc828b39fee54f7b9da94d79612f6e0e12c8c09819","abstract_canon_sha256":"88fd40737166ca8df0815b71fec9c608724fc10c9093607b85eec94e7c985645"},"schema_version":"1.0"},"canonical_sha256":"1a1b1351732389dff40c655e5e07449626d8dacbf4638bcd13651ab322f3d94f","source":{"kind":"arxiv","id":"1901.03615","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03615","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03615v2","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03615","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"pith_short_12","alias_value":"DINRGULTEOE5","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DINRGULTEOE575AM","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DINRGULT","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DINRGULTEOE575AMMVPF4B2ESY","target":"record","payload":{"canonical_record":{"source":{"id":"1901.03615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-11T15:37:37Z","cross_cats_sorted":[],"title_canon_sha256":"a21765b320632b8ba00a60fc828b39fee54f7b9da94d79612f6e0e12c8c09819","abstract_canon_sha256":"88fd40737166ca8df0815b71fec9c608724fc10c9093607b85eec94e7c985645"},"schema_version":"1.0"},"canonical_sha256":"1a1b1351732389dff40c655e5e07449626d8dacbf4638bcd13651ab322f3d94f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:19.173055Z","signature_b64":"B3HQpwJ8pRbp01M/vhHjhfZ/E01rxgNlybd1TB1VJMugU8BQTsrGQ+D3bo2QhXKDZsKIO2InCRmAMpHaPTohAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a1b1351732389dff40c655e5e07449626d8dacbf4638bcd13651ab322f3d94f","last_reissued_at":"2026-05-17T23:51:19.172623Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:19.172623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.03615","source_version":2,"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:51:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S+XB1b252iRx9xY5KqsIBQKeWfVu+K1aPOMiFus805FIq+yk18tCP4CivIq30IQ0eENw7N057z690bugLSLNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:54:05.816246Z"},"content_sha256":"f362e70635ffb82cc40989ee0570ce4ea5e4fa84b738893612e19877e4aad4a6","schema_version":"1.0","event_id":"sha256:f362e70635ffb82cc40989ee0570ce4ea5e4fa84b738893612e19877e4aad4a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DINRGULTEOE575AMMVPF4B2ESY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decremental Strongly-Connected Components and Single-Source Reachability in Near-Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Bernstein, Christian Wulff-Nilsen, Maximilian Probst","submitted_at":"2019-01-11T15:37:37Z","abstract_excerpt":"Computing the Strongly-Connected Components (SCCs) in a graph $G=(V,E)$ is known to take only $O(m + n)$ time using an algorithm by Tarjan from 1972[SICOMP 72] where $m = |E|$, $n=|V|$. For fully-dynamic graphs, conditional lower bounds provide evidence that the update time cannot be improved by polynomial factors over recomputing the SCCs from scratch after every update. Nevertheless, substantial progress has been made to find algorithms with fast update time for \\emph{decremental} graphs, i.e. graphs that undergo edge deletions.\n  In this paper, we present the first algorithm for general dec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03615","kind":"arxiv","version":2},"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:51:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QYDZ3qRoV0xmkWU5fWrBlbu849EljNSZIbX3suY5Idtf2XBSnBPyafxwZW3pmO3SU5DSdAhiY59vHNnhcYAdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:54:05.816852Z"},"content_sha256":"14289d07920dec4711366e7f26c4d52f59d3022f7f1d3539b0e7fa91714813cd","schema_version":"1.0","event_id":"sha256:14289d07920dec4711366e7f26c4d52f59d3022f7f1d3539b0e7fa91714813cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DINRGULTEOE575AMMVPF4B2ESY/bundle.json","state_url":"https://pith.science/pith/DINRGULTEOE575AMMVPF4B2ESY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DINRGULTEOE575AMMVPF4B2ESY/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-05T19:54:05Z","links":{"resolver":"https://pith.science/pith/DINRGULTEOE575AMMVPF4B2ESY","bundle":"https://pith.science/pith/DINRGULTEOE575AMMVPF4B2ESY/bundle.json","state":"https://pith.science/pith/DINRGULTEOE575AMMVPF4B2ESY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DINRGULTEOE575AMMVPF4B2ESY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DINRGULTEOE575AMMVPF4B2ESY","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":"88fd40737166ca8df0815b71fec9c608724fc10c9093607b85eec94e7c985645","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-11T15:37:37Z","title_canon_sha256":"a21765b320632b8ba00a60fc828b39fee54f7b9da94d79612f6e0e12c8c09819"},"schema_version":"1.0","source":{"id":"1901.03615","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03615","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03615v2","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03615","created_at":"2026-05-17T23:51:19Z"},{"alias_kind":"pith_short_12","alias_value":"DINRGULTEOE5","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DINRGULTEOE575AM","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DINRGULT","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:14289d07920dec4711366e7f26c4d52f59d3022f7f1d3539b0e7fa91714813cd","target":"graph","created_at":"2026-05-17T23:51:19Z","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":"Computing the Strongly-Connected Components (SCCs) in a graph $G=(V,E)$ is known to take only $O(m + n)$ time using an algorithm by Tarjan from 1972[SICOMP 72] where $m = |E|$, $n=|V|$. For fully-dynamic graphs, conditional lower bounds provide evidence that the update time cannot be improved by polynomial factors over recomputing the SCCs from scratch after every update. Nevertheless, substantial progress has been made to find algorithms with fast update time for \\emph{decremental} graphs, i.e. graphs that undergo edge deletions.\n  In this paper, we present the first algorithm for general dec","authors_text":"Aaron Bernstein, Christian Wulff-Nilsen, Maximilian Probst","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-11T15:37:37Z","title":"Decremental Strongly-Connected Components and Single-Source Reachability in Near-Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03615","kind":"arxiv","version":2},"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:f362e70635ffb82cc40989ee0570ce4ea5e4fa84b738893612e19877e4aad4a6","target":"record","created_at":"2026-05-17T23:51:19Z","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":"88fd40737166ca8df0815b71fec9c608724fc10c9093607b85eec94e7c985645","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-11T15:37:37Z","title_canon_sha256":"a21765b320632b8ba00a60fc828b39fee54f7b9da94d79612f6e0e12c8c09819"},"schema_version":"1.0","source":{"id":"1901.03615","kind":"arxiv","version":2}},"canonical_sha256":"1a1b1351732389dff40c655e5e07449626d8dacbf4638bcd13651ab322f3d94f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a1b1351732389dff40c655e5e07449626d8dacbf4638bcd13651ab322f3d94f","first_computed_at":"2026-05-17T23:51:19.172623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:19.172623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B3HQpwJ8pRbp01M/vhHjhfZ/E01rxgNlybd1TB1VJMugU8BQTsrGQ+D3bo2QhXKDZsKIO2InCRmAMpHaPTohAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:19.173055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03615","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f362e70635ffb82cc40989ee0570ce4ea5e4fa84b738893612e19877e4aad4a6","sha256:14289d07920dec4711366e7f26c4d52f59d3022f7f1d3539b0e7fa91714813cd"],"state_sha256":"c5b0a51a370d7747b9061d1690b3ef84f77f5f3621380be6048a3a018f3e6eac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ce5PeVP+b0bcQ2R8SvJ2607YyIAZw5cS5Zg1LTJkuagnsZoD8Ak2QOFzThSYHAdZHyco1g41U2c9/Cfz6qUbAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:54:05.821988Z","bundle_sha256":"6d78a1b75098d71b1519c61b2f760d636257b662c5262cbd03e346d768f7fac3"}}