{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QWFUKGRBAU67KXNSVNJWIWN5E3","short_pith_number":"pith:QWFUKGRB","schema_version":"1.0","canonical_sha256":"858b451a21053df55db2ab536459bd26eff9df535378d1ce7c6b8fd9aefcd66c","source":{"kind":"arxiv","id":"1906.01533","version":1},"attestation_state":"computed","paper":{"title":"Successive minimum spanning trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Gregory B. Sorkin, Svante Janson","submitted_at":"2019-06-04T15:44:26Z","abstract_excerpt":"In a complete graph $K_n$ with edge weights drawn independently from a uniform distribution $U(0,1)$ (or alternatively an exponential distribution $\\operatorname{Exp}(1)$), let $T_1$ be the MST (the spanning tree of minimum weight) and let $T_k$ be the MST after deletion of the edges of all previous trees $T_i$, $i<k$. We show that each tree's weight $w(T_k)$ converges in probability to a constant $\\gamma_k$ with $2k-2\\sqrt k <\\gamma_k<2k+2\\sqrt k$, and we conjecture that $\\gamma_k = 2k-1+o(1)$. The problem is distinct from that of Frieze and Johansson (2018), finding $k$ MSTs of combined mini"},"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":"1906.01533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-04T15:44:26Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"4c00579eb4b0cd37ca1084318f9afd9d94ac6de144850a25f2a6d982f4da5b4c","abstract_canon_sha256":"020e2037a3ac7c05f1a88da50073cd5d73b570c08fc32a56de2c62e7f5d4d225"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:16.223458Z","signature_b64":"s6k0KMcw0ts5RlHMpTP5XUePQpvGSKxdAQ+cukjUSxvsHWD8+11znv25diMKgCQ0P34Pbr5We88QCCvGWYpkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"858b451a21053df55db2ab536459bd26eff9df535378d1ce7c6b8fd9aefcd66c","last_reissued_at":"2026-05-17T23:44:16.222807Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:16.222807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Successive minimum spanning trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Gregory B. Sorkin, Svante Janson","submitted_at":"2019-06-04T15:44:26Z","abstract_excerpt":"In a complete graph $K_n$ with edge weights drawn independently from a uniform distribution $U(0,1)$ (or alternatively an exponential distribution $\\operatorname{Exp}(1)$), let $T_1$ be the MST (the spanning tree of minimum weight) and let $T_k$ be the MST after deletion of the edges of all previous trees $T_i$, $i<k$. We show that each tree's weight $w(T_k)$ converges in probability to a constant $\\gamma_k$ with $2k-2\\sqrt k <\\gamma_k<2k+2\\sqrt k$, and we conjecture that $\\gamma_k = 2k-1+o(1)$. The problem is distinct from that of Frieze and Johansson (2018), finding $k$ MSTs of combined mini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01533","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":"1906.01533","created_at":"2026-05-17T23:44:16.222905+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.01533v1","created_at":"2026-05-17T23:44:16.222905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01533","created_at":"2026-05-17T23:44:16.222905+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWFUKGRBAU67","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWFUKGRBAU67KXNS","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWFUKGRB","created_at":"2026-05-18T12:33:27.125529+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/QWFUKGRBAU67KXNSVNJWIWN5E3","json":"https://pith.science/pith/QWFUKGRBAU67KXNSVNJWIWN5E3.json","graph_json":"https://pith.science/api/pith-number/QWFUKGRBAU67KXNSVNJWIWN5E3/graph.json","events_json":"https://pith.science/api/pith-number/QWFUKGRBAU67KXNSVNJWIWN5E3/events.json","paper":"https://pith.science/paper/QWFUKGRB"},"agent_actions":{"view_html":"https://pith.science/pith/QWFUKGRBAU67KXNSVNJWIWN5E3","download_json":"https://pith.science/pith/QWFUKGRBAU67KXNSVNJWIWN5E3.json","view_paper":"https://pith.science/paper/QWFUKGRB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.01533&json=true","fetch_graph":"https://pith.science/api/pith-number/QWFUKGRBAU67KXNSVNJWIWN5E3/graph.json","fetch_events":"https://pith.science/api/pith-number/QWFUKGRBAU67KXNSVNJWIWN5E3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWFUKGRBAU67KXNSVNJWIWN5E3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWFUKGRBAU67KXNSVNJWIWN5E3/action/storage_attestation","attest_author":"https://pith.science/pith/QWFUKGRBAU67KXNSVNJWIWN5E3/action/author_attestation","sign_citation":"https://pith.science/pith/QWFUKGRBAU67KXNSVNJWIWN5E3/action/citation_signature","submit_replication":"https://pith.science/pith/QWFUKGRBAU67KXNSVNJWIWN5E3/action/replication_record"}},"created_at":"2026-05-17T23:44:16.222905+00:00","updated_at":"2026-05-17T23:44:16.222905+00:00"}