{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TAL45LX3NIQRA74JHRAKENP6PD","short_pith_number":"pith:TAL45LX3","schema_version":"1.0","canonical_sha256":"9817ceaefb6a21107f893c40a235fe78ed74e89225ca71c86d9fd7f7dae507f0","source":{"kind":"arxiv","id":"1307.1661","version":4},"attestation_state":"computed","paper":{"title":"Minimal spanning trees and Stein's method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Sanchayan Sen, Sourav Chatterjee","submitted_at":"2013-07-05T16:49:13Z","abstract_excerpt":"Kesten and Lee [36] proved that the total length of a minimal spanning tree on certain random point configurations in $\\mathbb{R}^d$ satisfies a central limit theorem. They also raised the question: how to make these results quantitative? However, techniques employed to tackle the same problem for other functionals studied in geometric probability do not apply directly to the minimal spanning tree. Thus the problem of determining the convergence rate in the central limit theorem for Euclidean minimal spanning trees has remained open. In this work, we establish bounds on the convergence rate fo"},"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":"1307.1661","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-07-05T16:49:13Z","cross_cats_sorted":[],"title_canon_sha256":"df867b528482c67efb8d5d3cb2e85788ed6bac253a57d0c9894decf4ba2d2723","abstract_canon_sha256":"a810ff657ca02fd0ee44c9844109d40edb064a2ccb496c69421ca639ae03de92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:43.982325Z","signature_b64":"HwUcPky6KEpgOWj4RV854PYnHTgPkXMu9yo2t5tKsoo665zWkZa2gNT85pLMncdToy1wK1BAkSxFwbcIpypuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9817ceaefb6a21107f893c40a235fe78ed74e89225ca71c86d9fd7f7dae507f0","last_reissued_at":"2026-05-18T01:09:43.981745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:43.981745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal spanning trees and Stein's method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Sanchayan Sen, Sourav Chatterjee","submitted_at":"2013-07-05T16:49:13Z","abstract_excerpt":"Kesten and Lee [36] proved that the total length of a minimal spanning tree on certain random point configurations in $\\mathbb{R}^d$ satisfies a central limit theorem. They also raised the question: how to make these results quantitative? However, techniques employed to tackle the same problem for other functionals studied in geometric probability do not apply directly to the minimal spanning tree. Thus the problem of determining the convergence rate in the central limit theorem for Euclidean minimal spanning trees has remained open. In this work, we establish bounds on the convergence rate fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1661","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":""},"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":"1307.1661","created_at":"2026-05-18T01:09:43.981813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.1661v4","created_at":"2026-05-18T01:09:43.981813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1661","created_at":"2026-05-18T01:09:43.981813+00:00"},{"alias_kind":"pith_short_12","alias_value":"TAL45LX3NIQR","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"TAL45LX3NIQRA74J","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"TAL45LX3","created_at":"2026-05-18T12:27:59.945178+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/TAL45LX3NIQRA74JHRAKENP6PD","json":"https://pith.science/pith/TAL45LX3NIQRA74JHRAKENP6PD.json","graph_json":"https://pith.science/api/pith-number/TAL45LX3NIQRA74JHRAKENP6PD/graph.json","events_json":"https://pith.science/api/pith-number/TAL45LX3NIQRA74JHRAKENP6PD/events.json","paper":"https://pith.science/paper/TAL45LX3"},"agent_actions":{"view_html":"https://pith.science/pith/TAL45LX3NIQRA74JHRAKENP6PD","download_json":"https://pith.science/pith/TAL45LX3NIQRA74JHRAKENP6PD.json","view_paper":"https://pith.science/paper/TAL45LX3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.1661&json=true","fetch_graph":"https://pith.science/api/pith-number/TAL45LX3NIQRA74JHRAKENP6PD/graph.json","fetch_events":"https://pith.science/api/pith-number/TAL45LX3NIQRA74JHRAKENP6PD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TAL45LX3NIQRA74JHRAKENP6PD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TAL45LX3NIQRA74JHRAKENP6PD/action/storage_attestation","attest_author":"https://pith.science/pith/TAL45LX3NIQRA74JHRAKENP6PD/action/author_attestation","sign_citation":"https://pith.science/pith/TAL45LX3NIQRA74JHRAKENP6PD/action/citation_signature","submit_replication":"https://pith.science/pith/TAL45LX3NIQRA74JHRAKENP6PD/action/replication_record"}},"created_at":"2026-05-18T01:09:43.981813+00:00","updated_at":"2026-05-18T01:09:43.981813+00:00"}