{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RPLROR7U5YCJE6Y26IKIYAANDQ","short_pith_number":"pith:RPLROR7U","canonical_record":{"source":{"id":"1407.1910","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-08T00:18:02Z","cross_cats_sorted":[],"title_canon_sha256":"f737c26ce2e117e93fba7198ad4af03c466ab1573a37d34a10f0ab25ff6046fc","abstract_canon_sha256":"0bf4266ac427c995f96afbb72bfd94b359d9d708a3e20b0f692629fb58c6d173"},"schema_version":"1.0"},"canonical_sha256":"8bd71747f4ee04927b1af2148c000d1c10bc3601c1c10c7358f0b7fca8011ff4","source":{"kind":"arxiv","id":"1407.1910","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1910","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1910v1","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1910","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"pith_short_12","alias_value":"RPLROR7U5YCJ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RPLROR7U5YCJE6Y2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RPLROR7U","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RPLROR7U5YCJE6Y26IKIYAANDQ","target":"record","payload":{"canonical_record":{"source":{"id":"1407.1910","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-08T00:18:02Z","cross_cats_sorted":[],"title_canon_sha256":"f737c26ce2e117e93fba7198ad4af03c466ab1573a37d34a10f0ab25ff6046fc","abstract_canon_sha256":"0bf4266ac427c995f96afbb72bfd94b359d9d708a3e20b0f692629fb58c6d173"},"schema_version":"1.0"},"canonical_sha256":"8bd71747f4ee04927b1af2148c000d1c10bc3601c1c10c7358f0b7fca8011ff4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:08.925106Z","signature_b64":"4jg7RFrmmzD+aaLLZfRB5qt0nZnE88/IZqyhG01gpSoygkqm19a9NbaqY0IhLF08QkjnrJ2T682SUQ++NMZ+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bd71747f4ee04927b1af2148c000d1c10bc3601c1c10c7358f0b7fca8011ff4","last_reissued_at":"2026-05-18T02:48:08.924692Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:08.924692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.1910","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-18T02:48:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OaxrpkXrqtPFQDoMCjf5qPmys6AugeDmNKF+k2ypm5sz8e36RFthDapdzBtPvTYBuoKVK+TlUf1a61z/U00oAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:02:36.379910Z"},"content_sha256":"dee4e3ca3fbaa70838cce8e7e8cd7b7f876956c055679a0ddd910ffdafac3037","schema_version":"1.0","event_id":"sha256:dee4e3ca3fbaa70838cce8e7e8cd7b7f876956c055679a0ddd910ffdafac3037"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RPLROR7U5YCJE6Y26IKIYAANDQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Seth Pettie","submitted_at":"2014-07-08T00:18:02Z","abstract_excerpt":"We present a deterministic algorithm for computing the sensitivity of a minimum spanning tree (MST) or shortest path tree in $O(m\\log\\alpha(m,n))$ time, where $\\alpha$ is the inverse-Ackermann function. This improves upon a long standing bound of $O(m\\alpha(m,n))$ established by Tarjan. Our algorithms are based on an efficient split-findmin data structure, which maintains a collection of sequences of weighted elements that may be split into smaller subsequences. As far as we are aware, our split-findmin algorithm is the first with superlinear but sub-inverse-Ackermann complexity. We also give "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1910","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-18T02:48:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K0oqaLmrpTIutt/gBkNiKAaQnSUF9vToCkMfCcNx5Wqt7Y8W8HI1p974G+tduKubQ69QMmdXDWPMQ62U9IbYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:02:36.380256Z"},"content_sha256":"7e1f74aee13b51db3eecfae6053e5b45bb87635dddc40becb76bf4068f5d86c5","schema_version":"1.0","event_id":"sha256:7e1f74aee13b51db3eecfae6053e5b45bb87635dddc40becb76bf4068f5d86c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RPLROR7U5YCJE6Y26IKIYAANDQ/bundle.json","state_url":"https://pith.science/pith/RPLROR7U5YCJE6Y26IKIYAANDQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RPLROR7U5YCJE6Y26IKIYAANDQ/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-22T23:02:36Z","links":{"resolver":"https://pith.science/pith/RPLROR7U5YCJE6Y26IKIYAANDQ","bundle":"https://pith.science/pith/RPLROR7U5YCJE6Y26IKIYAANDQ/bundle.json","state":"https://pith.science/pith/RPLROR7U5YCJE6Y26IKIYAANDQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RPLROR7U5YCJE6Y26IKIYAANDQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RPLROR7U5YCJE6Y26IKIYAANDQ","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":"0bf4266ac427c995f96afbb72bfd94b359d9d708a3e20b0f692629fb58c6d173","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-08T00:18:02Z","title_canon_sha256":"f737c26ce2e117e93fba7198ad4af03c466ab1573a37d34a10f0ab25ff6046fc"},"schema_version":"1.0","source":{"id":"1407.1910","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1910","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1910v1","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1910","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"pith_short_12","alias_value":"RPLROR7U5YCJ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RPLROR7U5YCJE6Y2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RPLROR7U","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:7e1f74aee13b51db3eecfae6053e5b45bb87635dddc40becb76bf4068f5d86c5","target":"graph","created_at":"2026-05-18T02:48:08Z","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":"We present a deterministic algorithm for computing the sensitivity of a minimum spanning tree (MST) or shortest path tree in $O(m\\log\\alpha(m,n))$ time, where $\\alpha$ is the inverse-Ackermann function. This improves upon a long standing bound of $O(m\\alpha(m,n))$ established by Tarjan. Our algorithms are based on an efficient split-findmin data structure, which maintains a collection of sequences of weighted elements that may be split into smaller subsequences. As far as we are aware, our split-findmin algorithm is the first with superlinear but sub-inverse-Ackermann complexity. We also give ","authors_text":"Seth Pettie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-08T00:18:02Z","title":"Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1910","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:dee4e3ca3fbaa70838cce8e7e8cd7b7f876956c055679a0ddd910ffdafac3037","target":"record","created_at":"2026-05-18T02:48:08Z","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":"0bf4266ac427c995f96afbb72bfd94b359d9d708a3e20b0f692629fb58c6d173","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-08T00:18:02Z","title_canon_sha256":"f737c26ce2e117e93fba7198ad4af03c466ab1573a37d34a10f0ab25ff6046fc"},"schema_version":"1.0","source":{"id":"1407.1910","kind":"arxiv","version":1}},"canonical_sha256":"8bd71747f4ee04927b1af2148c000d1c10bc3601c1c10c7358f0b7fca8011ff4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bd71747f4ee04927b1af2148c000d1c10bc3601c1c10c7358f0b7fca8011ff4","first_computed_at":"2026-05-18T02:48:08.924692Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:08.924692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4jg7RFrmmzD+aaLLZfRB5qt0nZnE88/IZqyhG01gpSoygkqm19a9NbaqY0IhLF08QkjnrJ2T682SUQ++NMZ+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:08.925106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.1910","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dee4e3ca3fbaa70838cce8e7e8cd7b7f876956c055679a0ddd910ffdafac3037","sha256:7e1f74aee13b51db3eecfae6053e5b45bb87635dddc40becb76bf4068f5d86c5"],"state_sha256":"02046b2f7af1f4f549029773df4f3886c386d6de0342bfeda31dbc636c1a2127"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MbMn9GgkQszG7BSluRrjKu01OH8nAkWOuLyMymgat1KYh62wUzS41Pnx/PrADcKxMLc8WD5uNxPPdPkRATu3DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:02:36.382215Z","bundle_sha256":"e41c439c96678317640b3d358ad334db23f8c1cddfe931093a16179fd00f565b"}}