{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EGHVSEFY7YRN7IWZKZGQATC5GJ","short_pith_number":"pith:EGHVSEFY","canonical_record":{"source":{"id":"1707.04867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-16T11:32:16Z","cross_cats_sorted":[],"title_canon_sha256":"546377cb652de5c116f01eb137779ab584a25c9a00cb1db68d2020be8fc12d52","abstract_canon_sha256":"535bdca354a7d0d3d1e23528e4e9bf49f0381437140b045e1bbb23139bf58e32"},"schema_version":"1.0"},"canonical_sha256":"218f5910b8fe22dfa2d9564d004c5d324bb7161ff4dce423f78e3ab46faa83c4","source":{"kind":"arxiv","id":"1707.04867","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04867","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04867v1","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04867","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"EGHVSEFY7YRN","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EGHVSEFY7YRN7IWZ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EGHVSEFY","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EGHVSEFY7YRN7IWZKZGQATC5GJ","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-16T11:32:16Z","cross_cats_sorted":[],"title_canon_sha256":"546377cb652de5c116f01eb137779ab584a25c9a00cb1db68d2020be8fc12d52","abstract_canon_sha256":"535bdca354a7d0d3d1e23528e4e9bf49f0381437140b045e1bbb23139bf58e32"},"schema_version":"1.0"},"canonical_sha256":"218f5910b8fe22dfa2d9564d004c5d324bb7161ff4dce423f78e3ab46faa83c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:11.971455Z","signature_b64":"UsBAUvW0nLi34JIodbXBhUYsU8ZnWuvV4zbYk+mUpMhsFeKFtEcP/vq95D+5QaBkdCS9LNtqMJUDZ/spUSpPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"218f5910b8fe22dfa2d9564d004c5d324bb7161ff4dce423f78e3ab46faa83c4","last_reissued_at":"2026-05-18T00:40:11.970724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:11.970724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04867","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-18T00:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LY5YJ5yr5cDebFBjbmZrF2cwgoEEPhrfCMxXCsM3mFXO43e7BoAWcL0MlfTf6CEBTHiqONKN17MKlQLyeghHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:30:09.202516Z"},"content_sha256":"950f9aa1d32bf9c20b4a83d92295519497aef355ae130a1aacc2b528cbcc4db3","schema_version":"1.0","event_id":"sha256:950f9aa1d32bf9c20b4a83d92295519497aef355ae130a1aacc2b528cbcc4db3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EGHVSEFY7YRN7IWZKZGQATC5GJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near Optimal Sized Weight Tolerant Subgraph for Single Source Shortest Path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Debarati Das, Diptarka Chakraborty","submitted_at":"2017-07-16T11:32:16Z","abstract_excerpt":"In this paper we address the problem of computing a sparse subgraph of a weighted directed graph such that the exact distances from a designated source vertex to all other vertices are preserved under bounded weight increment. Finding a small sized subgraph that preserves distances between any pair of vertices is a well studied problem. Since in the real world any network is prone to failures, it is natural to study the fault tolerant version of the above problem. Unfortunately, it turns out that there may not always exist such a sparse subgraph even under single edge failure [Demetrescu \\emph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04867","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-18T00:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYmD7GEJXwwI096yM+UwuLERSTAXTl8wmINXQtqW7IGnsBpytEXT2hnBzfhl0Hgs5vZxjBIGlfvhf4h3z7tdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T06:30:09.203149Z"},"content_sha256":"d5a76b2c4df8cfd7cebeb73829541d74a7669c456fd1b347516aea3e9b09cb9e","schema_version":"1.0","event_id":"sha256:d5a76b2c4df8cfd7cebeb73829541d74a7669c456fd1b347516aea3e9b09cb9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EGHVSEFY7YRN7IWZKZGQATC5GJ/bundle.json","state_url":"https://pith.science/pith/EGHVSEFY7YRN7IWZKZGQATC5GJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EGHVSEFY7YRN7IWZKZGQATC5GJ/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-08T06:30:09Z","links":{"resolver":"https://pith.science/pith/EGHVSEFY7YRN7IWZKZGQATC5GJ","bundle":"https://pith.science/pith/EGHVSEFY7YRN7IWZKZGQATC5GJ/bundle.json","state":"https://pith.science/pith/EGHVSEFY7YRN7IWZKZGQATC5GJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EGHVSEFY7YRN7IWZKZGQATC5GJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EGHVSEFY7YRN7IWZKZGQATC5GJ","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":"535bdca354a7d0d3d1e23528e4e9bf49f0381437140b045e1bbb23139bf58e32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-16T11:32:16Z","title_canon_sha256":"546377cb652de5c116f01eb137779ab584a25c9a00cb1db68d2020be8fc12d52"},"schema_version":"1.0","source":{"id":"1707.04867","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04867","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04867v1","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04867","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"EGHVSEFY7YRN","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EGHVSEFY7YRN7IWZ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EGHVSEFY","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:d5a76b2c4df8cfd7cebeb73829541d74a7669c456fd1b347516aea3e9b09cb9e","target":"graph","created_at":"2026-05-18T00:40:11Z","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 paper we address the problem of computing a sparse subgraph of a weighted directed graph such that the exact distances from a designated source vertex to all other vertices are preserved under bounded weight increment. Finding a small sized subgraph that preserves distances between any pair of vertices is a well studied problem. Since in the real world any network is prone to failures, it is natural to study the fault tolerant version of the above problem. Unfortunately, it turns out that there may not always exist such a sparse subgraph even under single edge failure [Demetrescu \\emph","authors_text":"Debarati Das, Diptarka Chakraborty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-16T11:32:16Z","title":"Near Optimal Sized Weight Tolerant Subgraph for Single Source Shortest Path"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04867","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:950f9aa1d32bf9c20b4a83d92295519497aef355ae130a1aacc2b528cbcc4db3","target":"record","created_at":"2026-05-18T00:40:11Z","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":"535bdca354a7d0d3d1e23528e4e9bf49f0381437140b045e1bbb23139bf58e32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-16T11:32:16Z","title_canon_sha256":"546377cb652de5c116f01eb137779ab584a25c9a00cb1db68d2020be8fc12d52"},"schema_version":"1.0","source":{"id":"1707.04867","kind":"arxiv","version":1}},"canonical_sha256":"218f5910b8fe22dfa2d9564d004c5d324bb7161ff4dce423f78e3ab46faa83c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"218f5910b8fe22dfa2d9564d004c5d324bb7161ff4dce423f78e3ab46faa83c4","first_computed_at":"2026-05-18T00:40:11.970724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:11.970724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UsBAUvW0nLi34JIodbXBhUYsU8ZnWuvV4zbYk+mUpMhsFeKFtEcP/vq95D+5QaBkdCS9LNtqMJUDZ/spUSpPCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:11.971455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04867","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:950f9aa1d32bf9c20b4a83d92295519497aef355ae130a1aacc2b528cbcc4db3","sha256:d5a76b2c4df8cfd7cebeb73829541d74a7669c456fd1b347516aea3e9b09cb9e"],"state_sha256":"42d276aab1c96b6df63ecc4f8a551befaa9dbdcffd01eaa464f7ace5f4493458"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"akDfydgn6fZ3B1QOhYWFqUuyoNvd/8oDyjWd9VZwKYLooyGgNMGeE1etW9VifQDTuWM4w0nNe45LVCk+hMhGAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T06:30:09.206832Z","bundle_sha256":"3d3bb8a2fdccdf0023f9b9b421f4ef3d9aaefcbae8b88d718cfd25df12e5c95b"}}