{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SXIAK6CXWENYHTKNFOHCMRME7G","short_pith_number":"pith:SXIAK6CX","canonical_record":{"source":{"id":"1904.08150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-17T09:22:20Z","cross_cats_sorted":[],"title_canon_sha256":"73b67ee48219054a3b716e28731bfedd5618d25cf7bf9404e19b74aa155c85f9","abstract_canon_sha256":"f00cd84edb5983bc041d4dc9b0de49fcde003d84935156d508e84b79e7607c88"},"schema_version":"1.0"},"canonical_sha256":"95d0057857b11b83cd4d2b8e264584f98ab288fa9aa24cd733f83233cdcc31cb","source":{"kind":"arxiv","id":"1904.08150","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08150","created_at":"2026-05-17T23:48:18Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08150v1","created_at":"2026-05-17T23:48:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08150","created_at":"2026-05-17T23:48:18Z"},{"alias_kind":"pith_short_12","alias_value":"SXIAK6CXWENY","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SXIAK6CXWENYHTKN","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SXIAK6CX","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SXIAK6CXWENYHTKNFOHCMRME7G","target":"record","payload":{"canonical_record":{"source":{"id":"1904.08150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-17T09:22:20Z","cross_cats_sorted":[],"title_canon_sha256":"73b67ee48219054a3b716e28731bfedd5618d25cf7bf9404e19b74aa155c85f9","abstract_canon_sha256":"f00cd84edb5983bc041d4dc9b0de49fcde003d84935156d508e84b79e7607c88"},"schema_version":"1.0"},"canonical_sha256":"95d0057857b11b83cd4d2b8e264584f98ab288fa9aa24cd733f83233cdcc31cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:18.616165Z","signature_b64":"HZdqw7B1801EDLVWFdi4OgbwdkPE3uS7fZvc8NSN2wTjc2YIitaUkT4XdoRSxPEpz7VI8myPooAZOHCOLKuvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95d0057857b11b83cd4d2b8e264584f98ab288fa9aa24cd733f83233cdcc31cb","last_reissued_at":"2026-05-17T23:48:18.615660Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:18.615660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.08150","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-17T23:48:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A8wic+5C2jcrLaFUQLQUjGnGhF3Gt7lkatO0tHcaY+zzYFbhUKsCKtZ52AUpudOImbqHqhF6HYyebqPTG89RCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:31:36.976205Z"},"content_sha256":"e4309d695b81105510d5d3a414ae9775f069eed92f7232533827b3eb89cde253","schema_version":"1.0","event_id":"sha256:e4309d695b81105510d5d3a414ae9775f069eed92f7232533827b3eb89cde253"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SXIAK6CXWENYHTKNFOHCMRME7G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Brief Note on Single Source Fault Tolerant Reachability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Meirav Zehavi, Pranabendu Misra, Saket Saurabh","submitted_at":"2019-04-17T09:22:20Z","abstract_excerpt":"Let $G$ be a directed graph with $n$ vertices and $m$ edges, and let $s \\in V(G)$ be a designated source vertex. We consider the problem of single source reachability (SSR) from $s$ in presence of failures of edges (or vertices). Formally, a spanning subgraph $H$ of $G$ is a {\\em $k$-Fault Tolerant Reachability Subgraph ($k$-FTRS)} if it has the following property. For any set $F$ of at most $k$ edges (or vertices) in $G$, and for any vertex $v\\in V(G)$, the vertex $v$ is reachable from $s$ in $G-F$ if and only if it is reachable from $s$ in $H - F$. Baswana et.al. [STOC 2016, SICOMP 2018] sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08150","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-17T23:48:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rn6g6cT0tnGCwgMDMlatdnfc99IOIc8VJHqdwp7rCH6gbeFMDjeKbxpO9/UtvDXAJc+A8PfrZZZEBa/NSe5LAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:31:36.976701Z"},"content_sha256":"b9e95d5bfc524584b4143cca0e400bab80e0ef0b56b3c1dc6f6263217df81c35","schema_version":"1.0","event_id":"sha256:b9e95d5bfc524584b4143cca0e400bab80e0ef0b56b3c1dc6f6263217df81c35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SXIAK6CXWENYHTKNFOHCMRME7G/bundle.json","state_url":"https://pith.science/pith/SXIAK6CXWENYHTKNFOHCMRME7G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SXIAK6CXWENYHTKNFOHCMRME7G/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-06-05T18:31:36Z","links":{"resolver":"https://pith.science/pith/SXIAK6CXWENYHTKNFOHCMRME7G","bundle":"https://pith.science/pith/SXIAK6CXWENYHTKNFOHCMRME7G/bundle.json","state":"https://pith.science/pith/SXIAK6CXWENYHTKNFOHCMRME7G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SXIAK6CXWENYHTKNFOHCMRME7G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SXIAK6CXWENYHTKNFOHCMRME7G","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":"f00cd84edb5983bc041d4dc9b0de49fcde003d84935156d508e84b79e7607c88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-17T09:22:20Z","title_canon_sha256":"73b67ee48219054a3b716e28731bfedd5618d25cf7bf9404e19b74aa155c85f9"},"schema_version":"1.0","source":{"id":"1904.08150","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08150","created_at":"2026-05-17T23:48:18Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08150v1","created_at":"2026-05-17T23:48:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08150","created_at":"2026-05-17T23:48:18Z"},{"alias_kind":"pith_short_12","alias_value":"SXIAK6CXWENY","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SXIAK6CXWENYHTKN","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SXIAK6CX","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:b9e95d5bfc524584b4143cca0e400bab80e0ef0b56b3c1dc6f6263217df81c35","target":"graph","created_at":"2026-05-17T23:48: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":"Let $G$ be a directed graph with $n$ vertices and $m$ edges, and let $s \\in V(G)$ be a designated source vertex. We consider the problem of single source reachability (SSR) from $s$ in presence of failures of edges (or vertices). Formally, a spanning subgraph $H$ of $G$ is a {\\em $k$-Fault Tolerant Reachability Subgraph ($k$-FTRS)} if it has the following property. For any set $F$ of at most $k$ edges (or vertices) in $G$, and for any vertex $v\\in V(G)$, the vertex $v$ is reachable from $s$ in $G-F$ if and only if it is reachable from $s$ in $H - F$. Baswana et.al. [STOC 2016, SICOMP 2018] sho","authors_text":"Daniel Lokshtanov, Meirav Zehavi, Pranabendu Misra, Saket Saurabh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-17T09:22:20Z","title":"A Brief Note on Single Source Fault Tolerant Reachability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08150","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:e4309d695b81105510d5d3a414ae9775f069eed92f7232533827b3eb89cde253","target":"record","created_at":"2026-05-17T23:48: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":"f00cd84edb5983bc041d4dc9b0de49fcde003d84935156d508e84b79e7607c88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-17T09:22:20Z","title_canon_sha256":"73b67ee48219054a3b716e28731bfedd5618d25cf7bf9404e19b74aa155c85f9"},"schema_version":"1.0","source":{"id":"1904.08150","kind":"arxiv","version":1}},"canonical_sha256":"95d0057857b11b83cd4d2b8e264584f98ab288fa9aa24cd733f83233cdcc31cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95d0057857b11b83cd4d2b8e264584f98ab288fa9aa24cd733f83233cdcc31cb","first_computed_at":"2026-05-17T23:48:18.615660Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:18.615660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HZdqw7B1801EDLVWFdi4OgbwdkPE3uS7fZvc8NSN2wTjc2YIitaUkT4XdoRSxPEpz7VI8myPooAZOHCOLKuvAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:18.616165Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.08150","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4309d695b81105510d5d3a414ae9775f069eed92f7232533827b3eb89cde253","sha256:b9e95d5bfc524584b4143cca0e400bab80e0ef0b56b3c1dc6f6263217df81c35"],"state_sha256":"a6b4637d83d469021c62ccf30264aab204aa06a1ba5e7c27c7c504cd5a7047ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aYvQ3BHQ9+B8viWGWGTFMD7xLaR6Gut0f3suqv0fbKo9qsPhsPomkBM45womHikcemgt9Hd4lISFYnvBMfu5DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:31:36.979253Z","bundle_sha256":"00facb3f79c695765b640703e12411611e4a1df546ca10d3eb98d4ee80652db1"}}