{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:77PVCLH5OHHIXRX5YD5AIXV3SA","short_pith_number":"pith:77PVCLH5","canonical_record":{"source":{"id":"1504.07959","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-29T18:46:55Z","cross_cats_sorted":[],"title_canon_sha256":"a6d43f4309b1e202e3a942a35ccb2d4c45e5dcb96fa0bf845ce5e1120f7ce616","abstract_canon_sha256":"5f1d7f5017ee1c309c530daeb67828e0cc7e676b4aed01986556607604575412"},"schema_version":"1.0"},"canonical_sha256":"ffdf512cfd71ce8bc6fdc0fa045ebb902bfbff082e0ab096ae2a2c5cd2061c9a","source":{"kind":"arxiv","id":"1504.07959","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07959","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07959v2","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07959","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"77PVCLH5OHHI","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"77PVCLH5OHHIXRX5","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"77PVCLH5","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:77PVCLH5OHHIXRX5YD5AIXV3SA","target":"record","payload":{"canonical_record":{"source":{"id":"1504.07959","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-29T18:46:55Z","cross_cats_sorted":[],"title_canon_sha256":"a6d43f4309b1e202e3a942a35ccb2d4c45e5dcb96fa0bf845ce5e1120f7ce616","abstract_canon_sha256":"5f1d7f5017ee1c309c530daeb67828e0cc7e676b4aed01986556607604575412"},"schema_version":"1.0"},"canonical_sha256":"ffdf512cfd71ce8bc6fdc0fa045ebb902bfbff082e0ab096ae2a2c5cd2061c9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:16.614273Z","signature_b64":"Z+an8MX9muSyoQ5OAop8yVtDodEfBfuq8rMbnGY1kyLLay/kz74YC5KKGvY9RXV7d6cQagA38aJJ+5SRFOx7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffdf512cfd71ce8bc6fdc0fa045ebb902bfbff082e0ab096ae2a2c5cd2061c9a","last_reissued_at":"2026-05-18T00:22:16.613624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:16.613624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.07959","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-18T00:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vlu6RNmVHHV7V6BHexQzGAB0ya+hDApe5JtOzDqrLjJQeLgrp/urGuYmE8j2pO1FSwNTmYQv12Ib9nfkU6wqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:36:33.339177Z"},"content_sha256":"32cace9c5ee0652e70997be602c891691d75c6a68956cb7f55632f30d3ce01ab","schema_version":"1.0","event_id":"sha256:32cace9c5ee0652e70997be602c891691d75c6a68956cb7f55632f30d3ce01ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:77PVCLH5OHHIXRX5YD5AIXV3SA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths 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":"2015-04-29T18:46:55Z","abstract_excerpt":"We consider dynamic algorithms for maintaining Single-Source Reachability (SSR) and approximate Single-Source Shortest Paths (SSSP) on $n$-node $m$-edge directed graphs under edge deletions (decremental algorithms). The previous fastest algorithm for SSR and SSSP goes back three decades to Even and Shiloach [JACM 1981]; it has $ O(1) $ query time and $ O (mn) $ total update time (i.e., linear amortized update time if all edges are deleted). This algorithm serves as a building block for several other dynamic algorithms. The question whether its total update time can be improved is a major, long"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07959","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-18T00:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iorofo5rErsCKBk/V7ipV28UzMNUrETy5N57Hlomi1wZJ0IAcxbOA9cqZhkaINct1ody6+fetiGup6f4n/tfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:36:33.339552Z"},"content_sha256":"dbcc33cc0b3a59f71700e31327b4c704dd04f7ad612deeaaf866d326167da3fe","schema_version":"1.0","event_id":"sha256:dbcc33cc0b3a59f71700e31327b4c704dd04f7ad612deeaaf866d326167da3fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/77PVCLH5OHHIXRX5YD5AIXV3SA/bundle.json","state_url":"https://pith.science/pith/77PVCLH5OHHIXRX5YD5AIXV3SA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/77PVCLH5OHHIXRX5YD5AIXV3SA/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:36:33Z","links":{"resolver":"https://pith.science/pith/77PVCLH5OHHIXRX5YD5AIXV3SA","bundle":"https://pith.science/pith/77PVCLH5OHHIXRX5YD5AIXV3SA/bundle.json","state":"https://pith.science/pith/77PVCLH5OHHIXRX5YD5AIXV3SA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/77PVCLH5OHHIXRX5YD5AIXV3SA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:77PVCLH5OHHIXRX5YD5AIXV3SA","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":"5f1d7f5017ee1c309c530daeb67828e0cc7e676b4aed01986556607604575412","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-29T18:46:55Z","title_canon_sha256":"a6d43f4309b1e202e3a942a35ccb2d4c45e5dcb96fa0bf845ce5e1120f7ce616"},"schema_version":"1.0","source":{"id":"1504.07959","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07959","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07959v2","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07959","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"77PVCLH5OHHI","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"77PVCLH5OHHIXRX5","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"77PVCLH5","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:dbcc33cc0b3a59f71700e31327b4c704dd04f7ad612deeaaf866d326167da3fe","target":"graph","created_at":"2026-05-18T00:22:16Z","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":"We consider dynamic algorithms for maintaining Single-Source Reachability (SSR) and approximate Single-Source Shortest Paths (SSSP) on $n$-node $m$-edge directed graphs under edge deletions (decremental algorithms). The previous fastest algorithm for SSR and SSSP goes back three decades to Even and Shiloach [JACM 1981]; it has $ O(1) $ query time and $ O (mn) $ total update time (i.e., linear amortized update time if all edges are deleted). This algorithm serves as a building block for several other dynamic algorithms. The question whether its total update time can be improved is a major, long","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":"2015-04-29T18:46:55Z","title":"Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07959","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:32cace9c5ee0652e70997be602c891691d75c6a68956cb7f55632f30d3ce01ab","target":"record","created_at":"2026-05-18T00:22:16Z","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":"5f1d7f5017ee1c309c530daeb67828e0cc7e676b4aed01986556607604575412","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-29T18:46:55Z","title_canon_sha256":"a6d43f4309b1e202e3a942a35ccb2d4c45e5dcb96fa0bf845ce5e1120f7ce616"},"schema_version":"1.0","source":{"id":"1504.07959","kind":"arxiv","version":2}},"canonical_sha256":"ffdf512cfd71ce8bc6fdc0fa045ebb902bfbff082e0ab096ae2a2c5cd2061c9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffdf512cfd71ce8bc6fdc0fa045ebb902bfbff082e0ab096ae2a2c5cd2061c9a","first_computed_at":"2026-05-18T00:22:16.613624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:16.613624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z+an8MX9muSyoQ5OAop8yVtDodEfBfuq8rMbnGY1kyLLay/kz74YC5KKGvY9RXV7d6cQagA38aJJ+5SRFOx7BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:16.614273Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.07959","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32cace9c5ee0652e70997be602c891691d75c6a68956cb7f55632f30d3ce01ab","sha256:dbcc33cc0b3a59f71700e31327b4c704dd04f7ad612deeaaf866d326167da3fe"],"state_sha256":"25c3246031a69559b73e41399230d1ad57c4b4b36c571e54d581eed458356f6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Mii6u59j80Ju+iVys9J4xdZDCTU3KgfB9ZC3+MdiOX2VVr220skPWhcGtD9sAXdbsojJ5pmGoeS2/ytkENRCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:36:33.343044Z","bundle_sha256":"a0a39f06971b8c821f20af24172d349e7f02c96dbded2d2daa82462ea815bfae"}}