{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RPLROR7U5YCJE6Y26IKIYAANDQ","short_pith_number":"pith:RPLROR7U","schema_version":"1.0","canonical_sha256":"8bd71747f4ee04927b1af2148c000d1c10bc3601c1c10c7358f0b7fca8011ff4","source":{"kind":"arxiv","id":"1407.1910","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.1910","created_at":"2026-05-18T02:48:08.924750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.1910v1","created_at":"2026-05-18T02:48:08.924750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1910","created_at":"2026-05-18T02:48:08.924750+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPLROR7U5YCJ","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPLROR7U5YCJE6Y2","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPLROR7U","created_at":"2026-05-18T12:28:46.137349+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/RPLROR7U5YCJE6Y26IKIYAANDQ","json":"https://pith.science/pith/RPLROR7U5YCJE6Y26IKIYAANDQ.json","graph_json":"https://pith.science/api/pith-number/RPLROR7U5YCJE6Y26IKIYAANDQ/graph.json","events_json":"https://pith.science/api/pith-number/RPLROR7U5YCJE6Y26IKIYAANDQ/events.json","paper":"https://pith.science/paper/RPLROR7U"},"agent_actions":{"view_html":"https://pith.science/pith/RPLROR7U5YCJE6Y26IKIYAANDQ","download_json":"https://pith.science/pith/RPLROR7U5YCJE6Y26IKIYAANDQ.json","view_paper":"https://pith.science/paper/RPLROR7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.1910&json=true","fetch_graph":"https://pith.science/api/pith-number/RPLROR7U5YCJE6Y26IKIYAANDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/RPLROR7U5YCJE6Y26IKIYAANDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPLROR7U5YCJE6Y26IKIYAANDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPLROR7U5YCJE6Y26IKIYAANDQ/action/storage_attestation","attest_author":"https://pith.science/pith/RPLROR7U5YCJE6Y26IKIYAANDQ/action/author_attestation","sign_citation":"https://pith.science/pith/RPLROR7U5YCJE6Y26IKIYAANDQ/action/citation_signature","submit_replication":"https://pith.science/pith/RPLROR7U5YCJE6Y26IKIYAANDQ/action/replication_record"}},"created_at":"2026-05-18T02:48:08.924750+00:00","updated_at":"2026-05-18T02:48:08.924750+00:00"}