{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YVSABPOBFDFTQQEM6UFT2ONCXA","short_pith_number":"pith:YVSABPOB","canonical_record":{"source":{"id":"1612.03856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-12T19:14:47Z","cross_cats_sorted":[],"title_canon_sha256":"110324da0e618f62ce092e53fed9ba30db6c84f9f69dc95873a207835a3490fb","abstract_canon_sha256":"e21ad232e70698b8a97c48878bb536f634c74db9c43da60cae39d8eb76b05ec6"},"schema_version":"1.0"},"canonical_sha256":"c56400bdc128cb38408cf50b3d39a2b8085e47cc5fce3aa42020d76af564673a","source":{"kind":"arxiv","id":"1612.03856","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03856","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03856v1","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03856","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"pith_short_12","alias_value":"YVSABPOBFDFT","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YVSABPOBFDFTQQEM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YVSABPOB","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YVSABPOBFDFTQQEM6UFT2ONCXA","target":"record","payload":{"canonical_record":{"source":{"id":"1612.03856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-12T19:14:47Z","cross_cats_sorted":[],"title_canon_sha256":"110324da0e618f62ce092e53fed9ba30db6c84f9f69dc95873a207835a3490fb","abstract_canon_sha256":"e21ad232e70698b8a97c48878bb536f634c74db9c43da60cae39d8eb76b05ec6"},"schema_version":"1.0"},"canonical_sha256":"c56400bdc128cb38408cf50b3d39a2b8085e47cc5fce3aa42020d76af564673a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:18.202050Z","signature_b64":"cxTKWWlUOlq05MWjWJXu0W0eM315ia+sOQMB6bR9BTHSDoziwF95ba9DSj6ihx+M8dWJilN4komVJptGnzWUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c56400bdc128cb38408cf50b3d39a2b8085e47cc5fce3aa42020d76af564673a","last_reissued_at":"2026-05-18T00:55:18.201581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:18.201581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.03856","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-18T00:55:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b1lnxpW/QmzyCyLZw7exW8jWA+biXG4cgClZSAVZnVFQXfMC1EG8VBNh8yF1aP024x02h+7iJ7mx4UHmfBAVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:46:13.835328Z"},"content_sha256":"30f99e7db9d1e2c975d3f9b47b90c9d3b9be19cb8f8184b7d94c2f6d82a92a67","schema_version":"1.0","event_id":"sha256:30f99e7db9d1e2c975d3f9b47b90c9d3b9be19cb8f8184b7d94c2f6d82a92a67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YVSABPOBFDFTQQEM6UFT2ONCXA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danupon Nanongkai, Monika Henzinger, Sebastian Krinninger","submitted_at":"2016-12-12T19:14:47Z","abstract_excerpt":"Recently we presented the first algorithm for maintaining the set of nodes reachable from a source node in a directed graph that is modified by edge deletions with $o(mn)$ total update time, where $m$ is the number of edges and $n$ is the number of nodes in the graph [Henzinger et al. STOC 2014]. The algorithm is a combination of several different algorithms, each for a different $m$ vs. $n$ trade-off. For the case of $m = \\Theta(n^{1.5})$ the running time is $O(n^{2.47})$, just barely below $mn = \\Theta(n^{2.5})$. In this paper we simplify the previous algorithm using new algorithmic ideas an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03856","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-18T00:55:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rYbtFfgHORihklGbn0nkbaRZa/YfSqJgsJW2jwmvEQzbUO6J2uzC0psz7hylDNYW4YiK3KnWyzl1teP8NY70Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:46:13.836060Z"},"content_sha256":"5d2174d392570a8f9a93b0d334e409055cdc19a387c7dfe26fbde13b5b91c6d1","schema_version":"1.0","event_id":"sha256:5d2174d392570a8f9a93b0d334e409055cdc19a387c7dfe26fbde13b5b91c6d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YVSABPOBFDFTQQEM6UFT2ONCXA/bundle.json","state_url":"https://pith.science/pith/YVSABPOBFDFTQQEM6UFT2ONCXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YVSABPOBFDFTQQEM6UFT2ONCXA/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-05-27T05:46:13Z","links":{"resolver":"https://pith.science/pith/YVSABPOBFDFTQQEM6UFT2ONCXA","bundle":"https://pith.science/pith/YVSABPOBFDFTQQEM6UFT2ONCXA/bundle.json","state":"https://pith.science/pith/YVSABPOBFDFTQQEM6UFT2ONCXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YVSABPOBFDFTQQEM6UFT2ONCXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YVSABPOBFDFTQQEM6UFT2ONCXA","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":"e21ad232e70698b8a97c48878bb536f634c74db9c43da60cae39d8eb76b05ec6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-12T19:14:47Z","title_canon_sha256":"110324da0e618f62ce092e53fed9ba30db6c84f9f69dc95873a207835a3490fb"},"schema_version":"1.0","source":{"id":"1612.03856","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03856","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03856v1","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03856","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"pith_short_12","alias_value":"YVSABPOBFDFT","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YVSABPOBFDFTQQEM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YVSABPOB","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:5d2174d392570a8f9a93b0d334e409055cdc19a387c7dfe26fbde13b5b91c6d1","target":"graph","created_at":"2026-05-18T00:55:18Z","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":"Recently we presented the first algorithm for maintaining the set of nodes reachable from a source node in a directed graph that is modified by edge deletions with $o(mn)$ total update time, where $m$ is the number of edges and $n$ is the number of nodes in the graph [Henzinger et al. STOC 2014]. The algorithm is a combination of several different algorithms, each for a different $m$ vs. $n$ trade-off. For the case of $m = \\Theta(n^{1.5})$ the running time is $O(n^{2.47})$, just barely below $mn = \\Theta(n^{2.5})$. In this paper we simplify the previous algorithm using new algorithmic ideas an","authors_text":"Danupon Nanongkai, Monika Henzinger, Sebastian Krinninger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-12T19:14:47Z","title":"Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03856","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:30f99e7db9d1e2c975d3f9b47b90c9d3b9be19cb8f8184b7d94c2f6d82a92a67","target":"record","created_at":"2026-05-18T00:55:18Z","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":"e21ad232e70698b8a97c48878bb536f634c74db9c43da60cae39d8eb76b05ec6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-12T19:14:47Z","title_canon_sha256":"110324da0e618f62ce092e53fed9ba30db6c84f9f69dc95873a207835a3490fb"},"schema_version":"1.0","source":{"id":"1612.03856","kind":"arxiv","version":1}},"canonical_sha256":"c56400bdc128cb38408cf50b3d39a2b8085e47cc5fce3aa42020d76af564673a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c56400bdc128cb38408cf50b3d39a2b8085e47cc5fce3aa42020d76af564673a","first_computed_at":"2026-05-18T00:55:18.201581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:18.201581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cxTKWWlUOlq05MWjWJXu0W0eM315ia+sOQMB6bR9BTHSDoziwF95ba9DSj6ihx+M8dWJilN4komVJptGnzWUBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:18.202050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.03856","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30f99e7db9d1e2c975d3f9b47b90c9d3b9be19cb8f8184b7d94c2f6d82a92a67","sha256:5d2174d392570a8f9a93b0d334e409055cdc19a387c7dfe26fbde13b5b91c6d1"],"state_sha256":"f2c8359b01563e93ac384865d7c3a0c578ec2100545a95c79091543c6963bce4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w8JvzQHBkGdECAo+fAlg8EoDnCAAabDrKNmSplCEfchTmaFRV1o+r+1+HhDyzNVct9Jlzp8Izv4CtB8Bmg7rDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:46:13.839679Z","bundle_sha256":"2bd5b9fc672b382779ff57420415da24c4a20bda26af73540676aab3291a820d"}}