{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:A6KDOM3EA2LL2CH6JCQNCLBFGA","short_pith_number":"pith:A6KDOM3E","schema_version":"1.0","canonical_sha256":"07943733640696bd08fe48a0d12c2530132c71b52a5d7ad8fbe28a9214cc6dd4","source":{"kind":"arxiv","id":"1208.5170","version":2},"attestation_state":"computed","paper":{"title":"On the length of a random minimum spanning tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Colin Cooper, Joel Spencer, Nate Ince, Svante Janson","submitted_at":"2012-08-25T20:42:59Z","abstract_excerpt":"We study the expected value of the length $L_n$ of the minimum spanning tree of the complete graph $K_n$ when each edge $e$ is given an independent uniform $[0,1]$ edge weight. We sharpen the result of Frieze \\cite{F1} that $\\lim_{n\\to\\infty}\\E(L_n)=\\z(3)$ and show that $\\E(L_n)=\\z(3)+\\frac{c_1}{n}+\\frac{c_2+o(1)}{n^{4/3}}$ where $c_1,c_2$ are explicitly defined constants."},"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":"1208.5170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-25T20:42:59Z","cross_cats_sorted":[],"title_canon_sha256":"2b9a263d5707ce7f98081d3770c5faa8fdda984852ba6e08b88f87c92eb6907f","abstract_canon_sha256":"fb72e7fe61d21298389f154ef7ebd59082467eccc1dd3921611f3f0b55a00bf0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:18.514525Z","signature_b64":"Er/TS6Y3TOIt7wW9cxhLAaWQD/uukTCl5ObEdGNQnQDQgiblVsUV/MTRyzfldRw1H5Els6qHI5lI1HiHidtBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07943733640696bd08fe48a0d12c2530132c71b52a5d7ad8fbe28a9214cc6dd4","last_reissued_at":"2026-05-17T23:53:18.513926Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:18.513926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the length of a random minimum spanning tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Colin Cooper, Joel Spencer, Nate Ince, Svante Janson","submitted_at":"2012-08-25T20:42:59Z","abstract_excerpt":"We study the expected value of the length $L_n$ of the minimum spanning tree of the complete graph $K_n$ when each edge $e$ is given an independent uniform $[0,1]$ edge weight. We sharpen the result of Frieze \\cite{F1} that $\\lim_{n\\to\\infty}\\E(L_n)=\\z(3)$ and show that $\\E(L_n)=\\z(3)+\\frac{c_1}{n}+\\frac{c_2+o(1)}{n^{4/3}}$ where $c_1,c_2$ are explicitly defined constants."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5170","kind":"arxiv","version":2},"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":"1208.5170","created_at":"2026-05-17T23:53:18.514009+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.5170v2","created_at":"2026-05-17T23:53:18.514009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5170","created_at":"2026-05-17T23:53:18.514009+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6KDOM3EA2LL","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6KDOM3EA2LL2CH6","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6KDOM3E","created_at":"2026-05-18T12:26:58.693483+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/A6KDOM3EA2LL2CH6JCQNCLBFGA","json":"https://pith.science/pith/A6KDOM3EA2LL2CH6JCQNCLBFGA.json","graph_json":"https://pith.science/api/pith-number/A6KDOM3EA2LL2CH6JCQNCLBFGA/graph.json","events_json":"https://pith.science/api/pith-number/A6KDOM3EA2LL2CH6JCQNCLBFGA/events.json","paper":"https://pith.science/paper/A6KDOM3E"},"agent_actions":{"view_html":"https://pith.science/pith/A6KDOM3EA2LL2CH6JCQNCLBFGA","download_json":"https://pith.science/pith/A6KDOM3EA2LL2CH6JCQNCLBFGA.json","view_paper":"https://pith.science/paper/A6KDOM3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.5170&json=true","fetch_graph":"https://pith.science/api/pith-number/A6KDOM3EA2LL2CH6JCQNCLBFGA/graph.json","fetch_events":"https://pith.science/api/pith-number/A6KDOM3EA2LL2CH6JCQNCLBFGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6KDOM3EA2LL2CH6JCQNCLBFGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6KDOM3EA2LL2CH6JCQNCLBFGA/action/storage_attestation","attest_author":"https://pith.science/pith/A6KDOM3EA2LL2CH6JCQNCLBFGA/action/author_attestation","sign_citation":"https://pith.science/pith/A6KDOM3EA2LL2CH6JCQNCLBFGA/action/citation_signature","submit_replication":"https://pith.science/pith/A6KDOM3EA2LL2CH6JCQNCLBFGA/action/replication_record"}},"created_at":"2026-05-17T23:53:18.514009+00:00","updated_at":"2026-05-17T23:53:18.514009+00:00"}