{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IF7BG4MC7N4ALLCMX5YDOJRDS3","short_pith_number":"pith:IF7BG4MC","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"},"canonical_sha256":"417e137182fb7805ac4cbf7037262396f64783899cab64004d66a801cf65d2d1","source":{"kind":"arxiv","id":"1511.07741","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07741","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07741v1","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07741","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"IF7BG4MC7N4A","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IF7BG4MC7N4ALLCM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IF7BG4MC","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IF7BG4MC7N4ALLCMX5YDOJRDS3","target":"record","payload":{"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"},"canonical_sha256":"417e137182fb7805ac4cbf7037262396f64783899cab64004d66a801cf65d2d1","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"},"source_kind":"arxiv","source_id":"1511.07741","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-18T01:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hYZshTKeLduBSEQM+m1voiCUY8gOQ/YdxafRTEcosK8Bq2IAm93aCSzfO1AzXFgcr9HALp2fLKwM+C8zP7AhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T13:41:08.713151Z"},"content_sha256":"eae36566438376947e353d6cf36e78fd696ce70b9c981592e061c8b936387c42","schema_version":"1.0","event_id":"sha256:eae36566438376947e353d6cf36e78fd696ce70b9c981592e061c8b936387c42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IF7BG4MC7N4ALLCMX5YDOJRDS3","target":"graph","payload":{"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"},"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-18T01:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OvTTM8ZfJWw+XwT5naB+O4n09F8DAu3OX1v6V6IQmBNqCxJEnnbnyEDpciIspq1dByupGAIpaGhDEMSaCEnYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T13:41:08.713516Z"},"content_sha256":"780a6e565ec112f85412260554b367f2c01b91aad8570ff699b5d9c3902f0e41","schema_version":"1.0","event_id":"sha256:780a6e565ec112f85412260554b367f2c01b91aad8570ff699b5d9c3902f0e41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IF7BG4MC7N4ALLCMX5YDOJRDS3/bundle.json","state_url":"https://pith.science/pith/IF7BG4MC7N4ALLCMX5YDOJRDS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IF7BG4MC7N4ALLCMX5YDOJRDS3/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-23T13:41:08Z","links":{"resolver":"https://pith.science/pith/IF7BG4MC7N4ALLCMX5YDOJRDS3","bundle":"https://pith.science/pith/IF7BG4MC7N4ALLCMX5YDOJRDS3/bundle.json","state":"https://pith.science/pith/IF7BG4MC7N4ALLCMX5YDOJRDS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IF7BG4MC7N4ALLCMX5YDOJRDS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IF7BG4MC7N4ALLCMX5YDOJRDS3","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":"9fe66e66ba12ae627dec774ac0c61ab2cd32575d8c1c884396d7db823c0eb61d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-24T14:55:45Z","title_canon_sha256":"f2743333b92a7ebd27838d07ad73bf67b6d31ed412c8135d55e4c8ef34c84606"},"schema_version":"1.0","source":{"id":"1511.07741","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07741","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07741v1","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07741","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"IF7BG4MC7N4A","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IF7BG4MC7N4ALLCM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IF7BG4MC","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:780a6e565ec112f85412260554b367f2c01b91aad8570ff699b5d9c3902f0e41","target":"graph","created_at":"2026-05-18T01:26:03Z","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":"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","authors_text":"Loukas Georgiadis, Robert E. Tarjan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-24T14:55:45Z","title":"A Note on Fault Tolerant Reachability for Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07741","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:eae36566438376947e353d6cf36e78fd696ce70b9c981592e061c8b936387c42","target":"record","created_at":"2026-05-18T01:26:03Z","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":"9fe66e66ba12ae627dec774ac0c61ab2cd32575d8c1c884396d7db823c0eb61d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-24T14:55:45Z","title_canon_sha256":"f2743333b92a7ebd27838d07ad73bf67b6d31ed412c8135d55e4c8ef34c84606"},"schema_version":"1.0","source":{"id":"1511.07741","kind":"arxiv","version":1}},"canonical_sha256":"417e137182fb7805ac4cbf7037262396f64783899cab64004d66a801cf65d2d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"417e137182fb7805ac4cbf7037262396f64783899cab64004d66a801cf65d2d1","first_computed_at":"2026-05-18T01:26:03.763916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:03.763916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nGQQV0p8+GVoHchvw9rQnF+/0AKtRHMFBMkYMKo3hUHZP9wgz/VxpX/IFFKnG7Bdzx78GhH4/uKdeLtHMGVGBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:03.764381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07741","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eae36566438376947e353d6cf36e78fd696ce70b9c981592e061c8b936387c42","sha256:780a6e565ec112f85412260554b367f2c01b91aad8570ff699b5d9c3902f0e41"],"state_sha256":"414b5c167a3ebab9d6ca2c547e901122843e01e67ffbc7d1dc278e257dce90b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1FyPaeKHcSDG6jT75OCu+EYiGP8hK6IZ/4gsHTB3lf1R8BIs9zpqnKKUea2+TorkhBBIFq0Gguu/kw9ZCgHNDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T13:41:08.715596Z","bundle_sha256":"a9fbe5b2f65680bc6f765ca740214c466db23b54a430056fe28d8c1c04066fd9"}}