{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IF7BG4MC7N4ALLCMX5YDOJRDS3","short_pith_number":"pith:IF7BG4MC","schema_version":"1.0","canonical_sha256":"417e137182fb7805ac4cbf7037262396f64783899cab64004d66a801cf65d2d1","source":{"kind":"arxiv","id":"1511.07741","version":1},"attestation_state":"computed","paper":{"title":"A Note on Fault Tolerant Reachability for Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Loukas Georgiadis, Robert E. Tarjan","submitted_at":"2015-11-24T14:55:45Z","abstract_excerpt":"In this note we describe an application of low-high orders in fault-tolerant network design. Baswana et al. [DISC 2015] study the following reachability problem. We are given a flow graph $G = (V, A)$ with start vertex $s$, and a spanning tree $T =(V, A_T)$ rooted at $s$. We call a set of arcs $A'$ valid if the subgraph $G' = (V, A_T \\cup A')$ of $G$ has the same dominators as $G$. The goal is to find a valid set of minimum size. Baswana et al. gave an $O(m \\log{n})$-time algorithm to compute a minimum-size valid set in $O(m \\log{n})$ time, where $n = |V|$ and $m = |A|$. Here we provide a simp"},"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":"1511.07741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-24T14:55:45Z","cross_cats_sorted":[],"title_canon_sha256":"f2743333b92a7ebd27838d07ad73bf67b6d31ed412c8135d55e4c8ef34c84606","abstract_canon_sha256":"9fe66e66ba12ae627dec774ac0c61ab2cd32575d8c1c884396d7db823c0eb61d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:03.764381Z","signature_b64":"nGQQV0p8+GVoHchvw9rQnF+/0AKtRHMFBMkYMKo3hUHZP9wgz/VxpX/IFFKnG7Bdzx78GhH4/uKdeLtHMGVGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"417e137182fb7805ac4cbf7037262396f64783899cab64004d66a801cf65d2d1","last_reissued_at":"2026-05-18T01:26:03.763916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:03.763916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Fault Tolerant Reachability for Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Loukas Georgiadis, Robert E. Tarjan","submitted_at":"2015-11-24T14:55:45Z","abstract_excerpt":"In this note we describe an application of low-high orders in fault-tolerant network design. Baswana et al. [DISC 2015] study the following reachability problem. We are given a flow graph $G = (V, A)$ with start vertex $s$, and a spanning tree $T =(V, A_T)$ rooted at $s$. We call a set of arcs $A'$ valid if the subgraph $G' = (V, A_T \\cup A')$ of $G$ has the same dominators as $G$. The goal is to find a valid set of minimum size. Baswana et al. gave an $O(m \\log{n})$-time algorithm to compute a minimum-size valid set in $O(m \\log{n})$ time, where $n = |V|$ and $m = |A|$. Here we provide a simp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07741","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.07741","created_at":"2026-05-18T01:26:03.763981+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07741v1","created_at":"2026-05-18T01:26:03.763981+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07741","created_at":"2026-05-18T01:26:03.763981+00:00"},{"alias_kind":"pith_short_12","alias_value":"IF7BG4MC7N4A","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IF7BG4MC7N4ALLCM","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IF7BG4MC","created_at":"2026-05-18T12:29:25.134429+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/IF7BG4MC7N4ALLCMX5YDOJRDS3","json":"https://pith.science/pith/IF7BG4MC7N4ALLCMX5YDOJRDS3.json","graph_json":"https://pith.science/api/pith-number/IF7BG4MC7N4ALLCMX5YDOJRDS3/graph.json","events_json":"https://pith.science/api/pith-number/IF7BG4MC7N4ALLCMX5YDOJRDS3/events.json","paper":"https://pith.science/paper/IF7BG4MC"},"agent_actions":{"view_html":"https://pith.science/pith/IF7BG4MC7N4ALLCMX5YDOJRDS3","download_json":"https://pith.science/pith/IF7BG4MC7N4ALLCMX5YDOJRDS3.json","view_paper":"https://pith.science/paper/IF7BG4MC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07741&json=true","fetch_graph":"https://pith.science/api/pith-number/IF7BG4MC7N4ALLCMX5YDOJRDS3/graph.json","fetch_events":"https://pith.science/api/pith-number/IF7BG4MC7N4ALLCMX5YDOJRDS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IF7BG4MC7N4ALLCMX5YDOJRDS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IF7BG4MC7N4ALLCMX5YDOJRDS3/action/storage_attestation","attest_author":"https://pith.science/pith/IF7BG4MC7N4ALLCMX5YDOJRDS3/action/author_attestation","sign_citation":"https://pith.science/pith/IF7BG4MC7N4ALLCMX5YDOJRDS3/action/citation_signature","submit_replication":"https://pith.science/pith/IF7BG4MC7N4ALLCMX5YDOJRDS3/action/replication_record"}},"created_at":"2026-05-18T01:26:03.763981+00:00","updated_at":"2026-05-18T01:26:03.763981+00:00"}