{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TSAT6FEASWQ6GFVUCAMEHLZRKJ","short_pith_number":"pith:TSAT6FEA","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"},"canonical_sha256":"9c813f148095a1e316b4101843af315247e9eb173a791b3a676871350664a1d5","source":{"kind":"arxiv","id":"1504.08360","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08360","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08360v3","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08360","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"pith_short_12","alias_value":"TSAT6FEASWQ6","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TSAT6FEASWQ6GFVU","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TSAT6FEA","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TSAT6FEASWQ6GFVUCAMEHLZRKJ","target":"record","payload":{"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"},"canonical_sha256":"9c813f148095a1e316b4101843af315247e9eb173a791b3a676871350664a1d5","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"},"source_kind":"arxiv","source_id":"1504.08360","source_version":3,"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-18T02:07:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pp1dZyiqBGlTCzoO6y+SaW5wdsG8hNnjq/UrTlg+xhgWY0v7BIVqhVSOo1A4x33KE1QAkglEorKSRTlLCpnLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:45:41.673741Z"},"content_sha256":"83768e4220ac468cae6e96f4ba7ea687c2159fe05d791cba77eb795699b23f21","schema_version":"1.0","event_id":"sha256:83768e4220ac468cae6e96f4ba7ea687c2159fe05d791cba77eb795699b23f21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TSAT6FEASWQ6GFVUCAMEHLZRKJ","target":"graph","payload":{"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"},"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-18T02:07:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+SOMyzQ9RkmOXLUOaZ87HXe+W4eQEZNqeJQ5Q5V/0R1V4YwtD7mvfzQklYrH7ccooU86DS50QOJrfqxPCSQAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:45:41.674169Z"},"content_sha256":"607791233a171f89880a09a0e36e13ca344102f6c0b5639209ed1c4b2d91953d","schema_version":"1.0","event_id":"sha256:607791233a171f89880a09a0e36e13ca344102f6c0b5639209ed1c4b2d91953d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TSAT6FEASWQ6GFVUCAMEHLZRKJ/bundle.json","state_url":"https://pith.science/pith/TSAT6FEASWQ6GFVUCAMEHLZRKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TSAT6FEASWQ6GFVUCAMEHLZRKJ/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-30T08:45:41Z","links":{"resolver":"https://pith.science/pith/TSAT6FEASWQ6GFVUCAMEHLZRKJ","bundle":"https://pith.science/pith/TSAT6FEASWQ6GFVUCAMEHLZRKJ/bundle.json","state":"https://pith.science/pith/TSAT6FEASWQ6GFVUCAMEHLZRKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TSAT6FEASWQ6GFVUCAMEHLZRKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TSAT6FEASWQ6GFVUCAMEHLZRKJ","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":"913ca337078ab9270f67798d5894d1a11be6f51d4eb4183573f53fe299719591","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-30T19:42:19Z","title_canon_sha256":"6625a2170bf13e748aa33391604c5b948278bf68c2224fa81d866f791078ffac"},"schema_version":"1.0","source":{"id":"1504.08360","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08360","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08360v3","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08360","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"pith_short_12","alias_value":"TSAT6FEASWQ6","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TSAT6FEASWQ6GFVU","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TSAT6FEA","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:607791233a171f89880a09a0e36e13ca344102f6c0b5639209ed1c4b2d91953d","target":"graph","created_at":"2026-05-18T02:07:26Z","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":"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","authors_text":"Manoj Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-30T19:42:19Z","title":"Simple and Faster algorithm for Reachability in a Decremental Directed Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08360","kind":"arxiv","version":3},"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:83768e4220ac468cae6e96f4ba7ea687c2159fe05d791cba77eb795699b23f21","target":"record","created_at":"2026-05-18T02:07:26Z","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":"913ca337078ab9270f67798d5894d1a11be6f51d4eb4183573f53fe299719591","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-30T19:42:19Z","title_canon_sha256":"6625a2170bf13e748aa33391604c5b948278bf68c2224fa81d866f791078ffac"},"schema_version":"1.0","source":{"id":"1504.08360","kind":"arxiv","version":3}},"canonical_sha256":"9c813f148095a1e316b4101843af315247e9eb173a791b3a676871350664a1d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c813f148095a1e316b4101843af315247e9eb173a791b3a676871350664a1d5","first_computed_at":"2026-05-18T02:07:26.225850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:07:26.225850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4ML8KiWZJ2JCpPjQNhP5L0yoSW5c9jKwrkSCjiAJXZsJ0R+RV2GYiLt709ixupfe0oOYMAkyvpgipnQuCQdYDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:07:26.226273Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.08360","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83768e4220ac468cae6e96f4ba7ea687c2159fe05d791cba77eb795699b23f21","sha256:607791233a171f89880a09a0e36e13ca344102f6c0b5639209ed1c4b2d91953d"],"state_sha256":"656d8d2e179a68f110ad3c775efaa9875a9ebc2efd9ed80e1a315f6ab24d8d63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fh8CZy/o3vtlrKnhKfKhsuyunVMGV2rf6M56KAGYJLWqlOlPZK3HfYFqo6Yp+4ocrfsblpYWXxkiAKrQQRNRCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:45:41.677055Z","bundle_sha256":"e653ee2c48c76bc399ef76cbd018b24a271be71339439e30fc4a2e4b8c9b5a13"}}