{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZWA22RE6MLHRPRERZEKLMXQSEH","short_pith_number":"pith:ZWA22RE6","canonical_record":{"source":{"id":"1908.03473","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T14:31:09Z","cross_cats_sorted":[],"title_canon_sha256":"0832137b95bbcefda60c78c7d5a7b93af0a3d8aaa704fc761a59c251a4d07d3a","abstract_canon_sha256":"69908a8a10eb918eb4d0ab91826773f8ff3bb4c0ec7076547743a78a47d77e9c"},"schema_version":"1.0"},"canonical_sha256":"cd81ad449e62cf17c491c914b65e1221f1b3fdab3021c1eeed07b8a32d2c4f78","source":{"kind":"arxiv","id":"1908.03473","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03473","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03473v4","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03473","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"pith_short_12","alias_value":"ZWA22RE6MLHR","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"pith_short_16","alias_value":"ZWA22RE6MLHRPRER","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"pith_short_8","alias_value":"ZWA22RE6","created_at":"2026-07-05T05:28:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZWA22RE6MLHRPRERZEKLMXQSEH","target":"record","payload":{"canonical_record":{"source":{"id":"1908.03473","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T14:31:09Z","cross_cats_sorted":[],"title_canon_sha256":"0832137b95bbcefda60c78c7d5a7b93af0a3d8aaa704fc761a59c251a4d07d3a","abstract_canon_sha256":"69908a8a10eb918eb4d0ab91826773f8ff3bb4c0ec7076547743a78a47d77e9c"},"schema_version":"1.0"},"canonical_sha256":"cd81ad449e62cf17c491c914b65e1221f1b3fdab3021c1eeed07b8a32d2c4f78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:28:58.227007Z","signature_b64":"p2d5AiNRfrpUtpWGJO6e/3XIlD/gHVGjgdxj22WYizTT06Md/tTFRGtgHks97r+GyEezoNytQrNAr9aKympPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd81ad449e62cf17c491c914b65e1221f1b3fdab3021c1eeed07b8a32d2c4f78","last_reissued_at":"2026-07-05T05:28:58.226652Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:28:58.226652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.03473","source_version":4,"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-07-05T05:28:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5TaRuWuFKRjtzAZA5GKYn7pl3xkylRpbwxbuP6COmmyPxP2a+lvTHnH8VZIHXybOry88LydYoAQNSRGNiuo7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T15:55:07.700055Z"},"content_sha256":"def1139714c92cc055d7e593180e86ae3c24a1aa3886f67d2abcc53223a0c7b5","schema_version":"1.0","event_id":"sha256:def1139714c92cc055d7e593180e86ae3c24a1aa3886f67d2abcc53223a0c7b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZWA22RE6MLHRPRERZEKLMXQSEH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David A. Bader, Paul Burkhardt","submitted_at":"2019-08-09T14:31:09Z","abstract_excerpt":"Given an undirected, weighted graph, the minimum spanning tree (MST) is a tree that connects all of the vertices of the graph with minimum sum of edge weights. In real world applications, network designers often seek to quickly find a replacement edge for each edge in the MST. For example, when a traffic accident closes a road in a transportation network, or a line goes down in a communication network, the replacement edge may reconnect the MST at lowest cost. In the paper, we consider the case of finding the lowest cost replacement edge for each edge of the MST. A previous algorithm by Tarjan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03473","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.03473/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:28:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MUDxyiDo2o7dckYZPTMTfyIdlVh9voS8zBEXPAjIexn/R9IB5ILLBOVHBOhOs7f9tHrcd3U7fB9QlPKYBvKUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T15:55:07.700865Z"},"content_sha256":"0737ab91f08b116f0b07512eb61247c5e12a74c34eabf6565f6d7c8d28d35b87","schema_version":"1.0","event_id":"sha256:0737ab91f08b116f0b07512eb61247c5e12a74c34eabf6565f6d7c8d28d35b87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWA22RE6MLHRPRERZEKLMXQSEH/bundle.json","state_url":"https://pith.science/pith/ZWA22RE6MLHRPRERZEKLMXQSEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWA22RE6MLHRPRERZEKLMXQSEH/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-08-16T15:55:07Z","links":{"resolver":"https://pith.science/pith/ZWA22RE6MLHRPRERZEKLMXQSEH","bundle":"https://pith.science/pith/ZWA22RE6MLHRPRERZEKLMXQSEH/bundle.json","state":"https://pith.science/pith/ZWA22RE6MLHRPRERZEKLMXQSEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWA22RE6MLHRPRERZEKLMXQSEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZWA22RE6MLHRPRERZEKLMXQSEH","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":"69908a8a10eb918eb4d0ab91826773f8ff3bb4c0ec7076547743a78a47d77e9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T14:31:09Z","title_canon_sha256":"0832137b95bbcefda60c78c7d5a7b93af0a3d8aaa704fc761a59c251a4d07d3a"},"schema_version":"1.0","source":{"id":"1908.03473","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03473","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03473v4","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03473","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"pith_short_12","alias_value":"ZWA22RE6MLHR","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"pith_short_16","alias_value":"ZWA22RE6MLHRPRER","created_at":"2026-07-05T05:28:58Z"},{"alias_kind":"pith_short_8","alias_value":"ZWA22RE6","created_at":"2026-07-05T05:28:58Z"}],"graph_snapshots":[{"event_id":"sha256:0737ab91f08b116f0b07512eb61247c5e12a74c34eabf6565f6d7c8d28d35b87","target":"graph","created_at":"2026-07-05T05:28:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.03473/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given an undirected, weighted graph, the minimum spanning tree (MST) is a tree that connects all of the vertices of the graph with minimum sum of edge weights. In real world applications, network designers often seek to quickly find a replacement edge for each edge in the MST. For example, when a traffic accident closes a road in a transportation network, or a line goes down in a communication network, the replacement edge may reconnect the MST at lowest cost. In the paper, we consider the case of finding the lowest cost replacement edge for each edge of the MST. A previous algorithm by Tarjan","authors_text":"David A. Bader, Paul Burkhardt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T14:31:09Z","title":"A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03473","kind":"arxiv","version":4},"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:def1139714c92cc055d7e593180e86ae3c24a1aa3886f67d2abcc53223a0c7b5","target":"record","created_at":"2026-07-05T05:28:58Z","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":"69908a8a10eb918eb4d0ab91826773f8ff3bb4c0ec7076547743a78a47d77e9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T14:31:09Z","title_canon_sha256":"0832137b95bbcefda60c78c7d5a7b93af0a3d8aaa704fc761a59c251a4d07d3a"},"schema_version":"1.0","source":{"id":"1908.03473","kind":"arxiv","version":4}},"canonical_sha256":"cd81ad449e62cf17c491c914b65e1221f1b3fdab3021c1eeed07b8a32d2c4f78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd81ad449e62cf17c491c914b65e1221f1b3fdab3021c1eeed07b8a32d2c4f78","first_computed_at":"2026-07-05T05:28:58.226652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:28:58.226652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p2d5AiNRfrpUtpWGJO6e/3XIlD/gHVGjgdxj22WYizTT06Md/tTFRGtgHks97r+GyEezoNytQrNAr9aKympPBw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:28:58.227007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03473","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:def1139714c92cc055d7e593180e86ae3c24a1aa3886f67d2abcc53223a0c7b5","sha256:0737ab91f08b116f0b07512eb61247c5e12a74c34eabf6565f6d7c8d28d35b87"],"state_sha256":"d89b8fb96a831e864a346e7db6a288584b83eeb9486f388c5172e2a62eb692d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fiy11DjVUASN7y23g7vioVnodFU/IcjdBWQNW4cqENQUsKlqQhicZV78Zmnysdy/SbZ0klaw0FGlOhASFZ0ADg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T15:55:07.710350Z","bundle_sha256":"0db3c543fb78ab1c2de73b2ad756eff804ce844d70072bdac258fa145a357d4c"}}