{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:77PVCLH5OHHIXRX5YD5AIXV3SA","short_pith_number":"pith:77PVCLH5","schema_version":"1.0","canonical_sha256":"ffdf512cfd71ce8bc6fdc0fa045ebb902bfbff082e0ab096ae2a2c5cd2061c9a","source":{"kind":"arxiv","id":"1504.07959","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.07959","created_at":"2026-05-18T00:22:16.613727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07959v2","created_at":"2026-05-18T00:22:16.613727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07959","created_at":"2026-05-18T00:22:16.613727+00:00"},{"alias_kind":"pith_short_12","alias_value":"77PVCLH5OHHI","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"77PVCLH5OHHIXRX5","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"77PVCLH5","created_at":"2026-05-18T12:29:07.941421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/77PVCLH5OHHIXRX5YD5AIXV3SA","json":"https://pith.science/pith/77PVCLH5OHHIXRX5YD5AIXV3SA.json","graph_json":"https://pith.science/api/pith-number/77PVCLH5OHHIXRX5YD5AIXV3SA/graph.json","events_json":"https://pith.science/api/pith-number/77PVCLH5OHHIXRX5YD5AIXV3SA/events.json","paper":"https://pith.science/paper/77PVCLH5"},"agent_actions":{"view_html":"https://pith.science/pith/77PVCLH5OHHIXRX5YD5AIXV3SA","download_json":"https://pith.science/pith/77PVCLH5OHHIXRX5YD5AIXV3SA.json","view_paper":"https://pith.science/paper/77PVCLH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07959&json=true","fetch_graph":"https://pith.science/api/pith-number/77PVCLH5OHHIXRX5YD5AIXV3SA/graph.json","fetch_events":"https://pith.science/api/pith-number/77PVCLH5OHHIXRX5YD5AIXV3SA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77PVCLH5OHHIXRX5YD5AIXV3SA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77PVCLH5OHHIXRX5YD5AIXV3SA/action/storage_attestation","attest_author":"https://pith.science/pith/77PVCLH5OHHIXRX5YD5AIXV3SA/action/author_attestation","sign_citation":"https://pith.science/pith/77PVCLH5OHHIXRX5YD5AIXV3SA/action/citation_signature","submit_replication":"https://pith.science/pith/77PVCLH5OHHIXRX5YD5AIXV3SA/action/replication_record"}},"created_at":"2026-05-18T00:22:16.613727+00:00","updated_at":"2026-05-18T00:22:16.613727+00:00"}