{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TSAT6FEASWQ6GFVUCAMEHLZRKJ","short_pith_number":"pith:TSAT6FEA","schema_version":"1.0","canonical_sha256":"9c813f148095a1e316b4101843af315247e9eb173a791b3a676871350664a1d5","source":{"kind":"arxiv","id":"1504.08360","version":3},"attestation_state":"computed","paper":{"title":"Simple and Faster algorithm for Reachability in a Decremental Directed Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manoj Gupta","submitted_at":"2015-04-30T19:42:19Z","abstract_excerpt":"Consider the problem of maintaining source sink reachability($st$-Reachability), single source reachability(SSR) and strongly connected component(SCC) in an edge decremental directed graph. In particular, we design a randomized algorithm that maintains with high probability:\n  1) $st$-Reachability in $\\tilde{O}(mn^{4/5})$ total update time. 2) $st$-Reachability in a total update time of $\\tilde{O}(n^{8/3})$ in a dense graph. 3) SSR in a total update time of $\\tilde{O}(m n^{9/10})$. 4) SCC in a total update time of $\\tilde{O}(m n^{9/10})$. For all the above problems, we improve upon the previou"},"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.08360","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-30T19:42:19Z","cross_cats_sorted":[],"title_canon_sha256":"6625a2170bf13e748aa33391604c5b948278bf68c2224fa81d866f791078ffac","abstract_canon_sha256":"913ca337078ab9270f67798d5894d1a11be6f51d4eb4183573f53fe299719591"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:26.226273Z","signature_b64":"4ML8KiWZJ2JCpPjQNhP5L0yoSW5c9jKwrkSCjiAJXZsJ0R+RV2GYiLt709ixupfe0oOYMAkyvpgipnQuCQdYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c813f148095a1e316b4101843af315247e9eb173a791b3a676871350664a1d5","last_reissued_at":"2026-05-18T02:07:26.225850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:26.225850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple and Faster algorithm for Reachability in a Decremental Directed Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manoj Gupta","submitted_at":"2015-04-30T19:42:19Z","abstract_excerpt":"Consider the problem of maintaining source sink reachability($st$-Reachability), single source reachability(SSR) and strongly connected component(SCC) in an edge decremental directed graph. In particular, we design a randomized algorithm that maintains with high probability:\n  1) $st$-Reachability in $\\tilde{O}(mn^{4/5})$ total update time. 2) $st$-Reachability in a total update time of $\\tilde{O}(n^{8/3})$ in a dense graph. 3) SSR in a total update time of $\\tilde{O}(m n^{9/10})$. 4) SCC in a total update time of $\\tilde{O}(m n^{9/10})$. For all the above problems, we improve upon the previou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08360","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":""},"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.08360","created_at":"2026-05-18T02:07:26.225915+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.08360v3","created_at":"2026-05-18T02:07:26.225915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08360","created_at":"2026-05-18T02:07:26.225915+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSAT6FEASWQ6","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSAT6FEASWQ6GFVU","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSAT6FEA","created_at":"2026-05-18T12:29:42.218222+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/TSAT6FEASWQ6GFVUCAMEHLZRKJ","json":"https://pith.science/pith/TSAT6FEASWQ6GFVUCAMEHLZRKJ.json","graph_json":"https://pith.science/api/pith-number/TSAT6FEASWQ6GFVUCAMEHLZRKJ/graph.json","events_json":"https://pith.science/api/pith-number/TSAT6FEASWQ6GFVUCAMEHLZRKJ/events.json","paper":"https://pith.science/paper/TSAT6FEA"},"agent_actions":{"view_html":"https://pith.science/pith/TSAT6FEASWQ6GFVUCAMEHLZRKJ","download_json":"https://pith.science/pith/TSAT6FEASWQ6GFVUCAMEHLZRKJ.json","view_paper":"https://pith.science/paper/TSAT6FEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.08360&json=true","fetch_graph":"https://pith.science/api/pith-number/TSAT6FEASWQ6GFVUCAMEHLZRKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/TSAT6FEASWQ6GFVUCAMEHLZRKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSAT6FEASWQ6GFVUCAMEHLZRKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSAT6FEASWQ6GFVUCAMEHLZRKJ/action/storage_attestation","attest_author":"https://pith.science/pith/TSAT6FEASWQ6GFVUCAMEHLZRKJ/action/author_attestation","sign_citation":"https://pith.science/pith/TSAT6FEASWQ6GFVUCAMEHLZRKJ/action/citation_signature","submit_replication":"https://pith.science/pith/TSAT6FEASWQ6GFVUCAMEHLZRKJ/action/replication_record"}},"created_at":"2026-05-18T02:07:26.225915+00:00","updated_at":"2026-05-18T02:07:26.225915+00:00"}