{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TAL45LX3NIQRA74JHRAKENP6PD","short_pith_number":"pith:TAL45LX3","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"},"canonical_sha256":"9817ceaefb6a21107f893c40a235fe78ed74e89225ca71c86d9fd7f7dae507f0","source":{"kind":"arxiv","id":"1307.1661","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1661","created_at":"2026-05-18T01:09:43Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1661v4","created_at":"2026-05-18T01:09:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1661","created_at":"2026-05-18T01:09:43Z"},{"alias_kind":"pith_short_12","alias_value":"TAL45LX3NIQR","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"TAL45LX3NIQRA74J","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"TAL45LX3","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TAL45LX3NIQRA74JHRAKENP6PD","target":"record","payload":{"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"},"canonical_sha256":"9817ceaefb6a21107f893c40a235fe78ed74e89225ca71c86d9fd7f7dae507f0","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"},"source_kind":"arxiv","source_id":"1307.1661","source_version":4,"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-18T01:09:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RKRjgZh9I1Q44nvltxAI2BqaP3QHYb8dhajaew3IBunuOdG0YQeWyqWWilGlla6+FvaFHEWHbnuO3dAJWXueDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:20:25.528630Z"},"content_sha256":"f76a51aadcbe5dd3a6f8441d77069f7eea1f89d32a40f2884f0f7bbf61281c1a","schema_version":"1.0","event_id":"sha256:f76a51aadcbe5dd3a6f8441d77069f7eea1f89d32a40f2884f0f7bbf61281c1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TAL45LX3NIQRA74JHRAKENP6PD","target":"graph","payload":{"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"},"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-18T01:09:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cKLdetYVM9fzY8j9akww43TD2p22agh1GasXrHShJAbf6B9J52QVut0NQqlTJ6Ri9IZUs/8eLIu9MYPS1WtUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:20:25.529106Z"},"content_sha256":"3d184abf66df32404caeaed37539c589bc6b4c637d0571328ac30d38743eb144","schema_version":"1.0","event_id":"sha256:3d184abf66df32404caeaed37539c589bc6b4c637d0571328ac30d38743eb144"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TAL45LX3NIQRA74JHRAKENP6PD/bundle.json","state_url":"https://pith.science/pith/TAL45LX3NIQRA74JHRAKENP6PD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TAL45LX3NIQRA74JHRAKENP6PD/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-05-30T09:20:25Z","links":{"resolver":"https://pith.science/pith/TAL45LX3NIQRA74JHRAKENP6PD","bundle":"https://pith.science/pith/TAL45LX3NIQRA74JHRAKENP6PD/bundle.json","state":"https://pith.science/pith/TAL45LX3NIQRA74JHRAKENP6PD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TAL45LX3NIQRA74JHRAKENP6PD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TAL45LX3NIQRA74JHRAKENP6PD","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":"a810ff657ca02fd0ee44c9844109d40edb064a2ccb496c69421ca639ae03de92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-07-05T16:49:13Z","title_canon_sha256":"df867b528482c67efb8d5d3cb2e85788ed6bac253a57d0c9894decf4ba2d2723"},"schema_version":"1.0","source":{"id":"1307.1661","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1661","created_at":"2026-05-18T01:09:43Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1661v4","created_at":"2026-05-18T01:09:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1661","created_at":"2026-05-18T01:09:43Z"},{"alias_kind":"pith_short_12","alias_value":"TAL45LX3NIQR","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"TAL45LX3NIQRA74J","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"TAL45LX3","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:3d184abf66df32404caeaed37539c589bc6b4c637d0571328ac30d38743eb144","target":"graph","created_at":"2026-05-18T01:09:43Z","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":"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","authors_text":"Sanchayan Sen, Sourav Chatterjee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-07-05T16:49:13Z","title":"Minimal spanning trees and Stein's method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1661","kind":"arxiv","version":4},"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:f76a51aadcbe5dd3a6f8441d77069f7eea1f89d32a40f2884f0f7bbf61281c1a","target":"record","created_at":"2026-05-18T01:09:43Z","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":"a810ff657ca02fd0ee44c9844109d40edb064a2ccb496c69421ca639ae03de92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-07-05T16:49:13Z","title_canon_sha256":"df867b528482c67efb8d5d3cb2e85788ed6bac253a57d0c9894decf4ba2d2723"},"schema_version":"1.0","source":{"id":"1307.1661","kind":"arxiv","version":4}},"canonical_sha256":"9817ceaefb6a21107f893c40a235fe78ed74e89225ca71c86d9fd7f7dae507f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9817ceaefb6a21107f893c40a235fe78ed74e89225ca71c86d9fd7f7dae507f0","first_computed_at":"2026-05-18T01:09:43.981745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:43.981745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HwUcPky6KEpgOWj4RV854PYnHTgPkXMu9yo2t5tKsoo665zWkZa2gNT85pLMncdToy1wK1BAkSxFwbcIpypuBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:43.982325Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.1661","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f76a51aadcbe5dd3a6f8441d77069f7eea1f89d32a40f2884f0f7bbf61281c1a","sha256:3d184abf66df32404caeaed37539c589bc6b4c637d0571328ac30d38743eb144"],"state_sha256":"9eec666aef86cdbfdae5536ce1e289bcb5c6e2588209839535a60cdaa6f066d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XygrB0/+ugk2ApKBEeDsbcLrY/Mqwx6SvtBQ1sswB5zFQX+08DZzI/GLzc2eIE0KS3bEqWuD6ww5FuD/jfVEAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:20:25.532608Z","bundle_sha256":"b3a221d2e47171824ecdfbeadf4ff9816a5ecb7dab3f986f6863bdc0fe134c63"}}