{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GAOOJO6UPOM2NTKYVN2YY34W43","short_pith_number":"pith:GAOOJO6U","canonical_record":{"source":{"id":"1301.1664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-08T20:32:37Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"105ac23c3d49e28e8c9c48c8bccf10464bb72887325e94cc6d5f7475b3397d5c","abstract_canon_sha256":"6249a9c1c92263128091291d6740563f8b44a098104364759ca152932a213132"},"schema_version":"1.0"},"canonical_sha256":"301ce4bbd47b99a6cd58ab758c6f96e6e238490011f287273071b782ab1caa67","source":{"kind":"arxiv","id":"1301.1664","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1664","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1664v1","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1664","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"pith_short_12","alias_value":"GAOOJO6UPOM2","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GAOOJO6UPOM2NTKY","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GAOOJO6U","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GAOOJO6UPOM2NTKYVN2YY34W43","target":"record","payload":{"canonical_record":{"source":{"id":"1301.1664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-08T20:32:37Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"105ac23c3d49e28e8c9c48c8bccf10464bb72887325e94cc6d5f7475b3397d5c","abstract_canon_sha256":"6249a9c1c92263128091291d6740563f8b44a098104364759ca152932a213132"},"schema_version":"1.0"},"canonical_sha256":"301ce4bbd47b99a6cd58ab758c6f96e6e238490011f287273071b782ab1caa67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:56.968472Z","signature_b64":"SRYuljW0TxZ/NUfFO/wD+0ZK+QpIh4ttHSTZm6uvQyJrYG+pEvMuavhlWL944IPeaQreh2M2vEFYD2+gGrKbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"301ce4bbd47b99a6cd58ab758c6f96e6e238490011f287273071b782ab1caa67","last_reissued_at":"2026-05-18T03:36:56.967953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:56.967953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.1664","source_version":1,"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-18T03:36:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NPDkatDNx40Z7dyAx6A192r3+SzRuW4tMnHBFhIadi58+MtVTzAHxZwPyIlTmP+PX8VyxmUifVLEwWACo15IAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T23:32:26.933391Z"},"content_sha256":"0cde971ab5b3a4a1ea980a4c8875ed52f3993fde1293af713fce7bdf4a760434","schema_version":"1.0","event_id":"sha256:0cde971ab5b3a4a1ea980a4c8875ed52f3993fde1293af713fce7bdf4a760434"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GAOOJO6UPOM2NTKYVN2YY34W43","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The scaling limit of the minimum spanning tree of the complete graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Christina Goldschmidt, Gr\\'egory Miermont, Louigi Addario-Berry, Nicolas Broutin","submitted_at":"2013-01-08T20:32:37Z","abstract_excerpt":"Consider the minimum spanning tree (MST) of the complete graph with n vertices, when edges are assigned independent random weights. Endow this tree with the graph distance renormalized by n^{1/3} and with the uniform measure on its vertices. We show that the resulting space converges in distribution, as n tends to infinity, to a random measured metric space in the Gromov-Hausdorff-Prokhorov topology. We additionally show that the limit is a random binary R-tree and has Minkowski dimension 3 almost surely. In particular, its law is mutually singular with that of the Brownian continuum random tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1664","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"},"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-18T03:36:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bWUhtyd0Db4BTClaz9kleP4H3qRob7jfaIHVH/+oNw3VGs+RZmKga3FDh1klcJgeFmNXyx8Ku3bmrapAoGAVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T23:32:26.934049Z"},"content_sha256":"2ac4855d9fb3bcf0b9a31b836ab351e869a89349690470bd5dfde18ced324e1b","schema_version":"1.0","event_id":"sha256:2ac4855d9fb3bcf0b9a31b836ab351e869a89349690470bd5dfde18ced324e1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GAOOJO6UPOM2NTKYVN2YY34W43/bundle.json","state_url":"https://pith.science/pith/GAOOJO6UPOM2NTKYVN2YY34W43/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GAOOJO6UPOM2NTKYVN2YY34W43/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-22T23:32:26Z","links":{"resolver":"https://pith.science/pith/GAOOJO6UPOM2NTKYVN2YY34W43","bundle":"https://pith.science/pith/GAOOJO6UPOM2NTKYVN2YY34W43/bundle.json","state":"https://pith.science/pith/GAOOJO6UPOM2NTKYVN2YY34W43/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GAOOJO6UPOM2NTKYVN2YY34W43/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GAOOJO6UPOM2NTKYVN2YY34W43","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":"6249a9c1c92263128091291d6740563f8b44a098104364759ca152932a213132","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-08T20:32:37Z","title_canon_sha256":"105ac23c3d49e28e8c9c48c8bccf10464bb72887325e94cc6d5f7475b3397d5c"},"schema_version":"1.0","source":{"id":"1301.1664","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1664","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1664v1","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1664","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"pith_short_12","alias_value":"GAOOJO6UPOM2","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GAOOJO6UPOM2NTKY","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GAOOJO6U","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:2ac4855d9fb3bcf0b9a31b836ab351e869a89349690470bd5dfde18ced324e1b","target":"graph","created_at":"2026-05-18T03:36:56Z","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":"Consider the minimum spanning tree (MST) of the complete graph with n vertices, when edges are assigned independent random weights. Endow this tree with the graph distance renormalized by n^{1/3} and with the uniform measure on its vertices. We show that the resulting space converges in distribution, as n tends to infinity, to a random measured metric space in the Gromov-Hausdorff-Prokhorov topology. We additionally show that the limit is a random binary R-tree and has Minkowski dimension 3 almost surely. In particular, its law is mutually singular with that of the Brownian continuum random tr","authors_text":"Christina Goldschmidt, Gr\\'egory Miermont, Louigi Addario-Berry, Nicolas Broutin","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-08T20:32:37Z","title":"The scaling limit of the minimum spanning tree of the complete graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1664","kind":"arxiv","version":1},"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:0cde971ab5b3a4a1ea980a4c8875ed52f3993fde1293af713fce7bdf4a760434","target":"record","created_at":"2026-05-18T03:36:56Z","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":"6249a9c1c92263128091291d6740563f8b44a098104364759ca152932a213132","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-01-08T20:32:37Z","title_canon_sha256":"105ac23c3d49e28e8c9c48c8bccf10464bb72887325e94cc6d5f7475b3397d5c"},"schema_version":"1.0","source":{"id":"1301.1664","kind":"arxiv","version":1}},"canonical_sha256":"301ce4bbd47b99a6cd58ab758c6f96e6e238490011f287273071b782ab1caa67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"301ce4bbd47b99a6cd58ab758c6f96e6e238490011f287273071b782ab1caa67","first_computed_at":"2026-05-18T03:36:56.967953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:56.967953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SRYuljW0TxZ/NUfFO/wD+0ZK+QpIh4ttHSTZm6uvQyJrYG+pEvMuavhlWL944IPeaQreh2M2vEFYD2+gGrKbAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:56.968472Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.1664","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cde971ab5b3a4a1ea980a4c8875ed52f3993fde1293af713fce7bdf4a760434","sha256:2ac4855d9fb3bcf0b9a31b836ab351e869a89349690470bd5dfde18ced324e1b"],"state_sha256":"8e3b8dee672522714872ec1f47dc45fd05a64ad3f8594439c8fb657ad7b30af7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fD7RyhfbglZis3+bRMaf6X7/npMjeA7+3Np+LMhUZc7MdkyfhcnLv/ihgnVN96HbaFYOSC6LoU0yUAFz1kfcCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T23:32:26.937533Z","bundle_sha256":"d5a82ad948d909d1b6ca6766d9a5da33c5886e960108c2a82b1a581245b3ef69"}}