{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:3JWBGMPTRHIVEIOYVHAP2XFSWH","short_pith_number":"pith:3JWBGMPT","canonical_record":{"source":{"id":"2507.04867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-07-07T10:51:33Z","cross_cats_sorted":[],"title_canon_sha256":"abc9267bf09b6f010192134d0f6cf0e6777e15b8567aa2c72cf3614922e61778","abstract_canon_sha256":"f0b96487c88a3781340ec420908134ac7390648842dbfb2fc543130d61bab148"},"schema_version":"1.0"},"canonical_sha256":"da6c1331f389d15221d8a9c0fd5cb2b1c7187294a1b75423de519128bfbe3cc0","source":{"kind":"arxiv","id":"2507.04867","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.04867","created_at":"2026-07-05T11:32:55Z"},{"alias_kind":"arxiv_version","alias_value":"2507.04867v1","created_at":"2026-07-05T11:32:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.04867","created_at":"2026-07-05T11:32:55Z"},{"alias_kind":"pith_short_12","alias_value":"3JWBGMPTRHIV","created_at":"2026-07-05T11:32:55Z"},{"alias_kind":"pith_short_16","alias_value":"3JWBGMPTRHIVEIOY","created_at":"2026-07-05T11:32:55Z"},{"alias_kind":"pith_short_8","alias_value":"3JWBGMPT","created_at":"2026-07-05T11:32:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:3JWBGMPTRHIVEIOYVHAP2XFSWH","target":"record","payload":{"canonical_record":{"source":{"id":"2507.04867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-07-07T10:51:33Z","cross_cats_sorted":[],"title_canon_sha256":"abc9267bf09b6f010192134d0f6cf0e6777e15b8567aa2c72cf3614922e61778","abstract_canon_sha256":"f0b96487c88a3781340ec420908134ac7390648842dbfb2fc543130d61bab148"},"schema_version":"1.0"},"canonical_sha256":"da6c1331f389d15221d8a9c0fd5cb2b1c7187294a1b75423de519128bfbe3cc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:55.506276Z","signature_b64":"fTHK9tOF7dN+CtbuWnqvdkEXtxUT1qsUDpax4alOaPH8K6Bdh4WJucaWfrwwcGJUlOqXrDM8YRQVzzXKNbENAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da6c1331f389d15221d8a9c0fd5cb2b1c7187294a1b75423de519128bfbe3cc0","last_reissued_at":"2026-07-05T11:32:55.505807Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:55.505807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.04867","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-07-05T11:32:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rHiws2GVZkDe5JU44I/d/QonCvJu+ZkKw2V6OoKXojZh0GufjuurzkNm7nrQVAaAsVLSF8+AVLCvStwKPBEzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T01:47:39.961573Z"},"content_sha256":"d184b3ffa209c586e663235a455c5b9f597f57d1e4265c6ef65246dd75641290","schema_version":"1.0","event_id":"sha256:d184b3ffa209c586e663235a455c5b9f597f57d1e4265c6ef65246dd75641290"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:3JWBGMPTRHIVEIOYVHAP2XFSWH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local limit of Prim's algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Beno\\^it Corsini, Remco van der Hofstad, Rowel G\\\"undlach","submitted_at":"2025-07-07T10:51:33Z","abstract_excerpt":"We study the local evolution of Prim's algorithm on large finite weighted graphs. When performed for $n$ steps, where $n$ is the size of the graph, Prim's algorithm will construct the minimal spanning tree (MST). We assume that our graphs converge locally in probability to some limiting rooted graph. In that case, Aldous and Steele already proved that the local limit of the MST converges to a limiting object, which can be thought of as the MST on the limiting infinite rooted graph.\n  Our aim is to investigate {\\em how} the local limit of the MST is reached \\textit{dynamically}. For this, we ta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.04867","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.04867/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:32:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"riv1AETOAGSZHl/H24YowE3s9jGwvbE2osW7Cuv/lhSt2oWtqIiDwG7i6SIVcmy3RmxsUcSRaUR6j1jS/l6xAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T01:47:39.962185Z"},"content_sha256":"e0c8dcd5dd3e25170db56aa99f2bdf74b3596680880b0c96728b992f78ff4620","schema_version":"1.0","event_id":"sha256:e0c8dcd5dd3e25170db56aa99f2bdf74b3596680880b0c96728b992f78ff4620"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JWBGMPTRHIVEIOYVHAP2XFSWH/bundle.json","state_url":"https://pith.science/pith/3JWBGMPTRHIVEIOYVHAP2XFSWH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JWBGMPTRHIVEIOYVHAP2XFSWH/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-08-09T01:47:39Z","links":{"resolver":"https://pith.science/pith/3JWBGMPTRHIVEIOYVHAP2XFSWH","bundle":"https://pith.science/pith/3JWBGMPTRHIVEIOYVHAP2XFSWH/bundle.json","state":"https://pith.science/pith/3JWBGMPTRHIVEIOYVHAP2XFSWH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JWBGMPTRHIVEIOYVHAP2XFSWH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:3JWBGMPTRHIVEIOYVHAP2XFSWH","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":"f0b96487c88a3781340ec420908134ac7390648842dbfb2fc543130d61bab148","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-07-07T10:51:33Z","title_canon_sha256":"abc9267bf09b6f010192134d0f6cf0e6777e15b8567aa2c72cf3614922e61778"},"schema_version":"1.0","source":{"id":"2507.04867","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.04867","created_at":"2026-07-05T11:32:55Z"},{"alias_kind":"arxiv_version","alias_value":"2507.04867v1","created_at":"2026-07-05T11:32:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.04867","created_at":"2026-07-05T11:32:55Z"},{"alias_kind":"pith_short_12","alias_value":"3JWBGMPTRHIV","created_at":"2026-07-05T11:32:55Z"},{"alias_kind":"pith_short_16","alias_value":"3JWBGMPTRHIVEIOY","created_at":"2026-07-05T11:32:55Z"},{"alias_kind":"pith_short_8","alias_value":"3JWBGMPT","created_at":"2026-07-05T11:32:55Z"}],"graph_snapshots":[{"event_id":"sha256:e0c8dcd5dd3e25170db56aa99f2bdf74b3596680880b0c96728b992f78ff4620","target":"graph","created_at":"2026-07-05T11:32:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.04867/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the local evolution of Prim's algorithm on large finite weighted graphs. When performed for $n$ steps, where $n$ is the size of the graph, Prim's algorithm will construct the minimal spanning tree (MST). We assume that our graphs converge locally in probability to some limiting rooted graph. In that case, Aldous and Steele already proved that the local limit of the MST converges to a limiting object, which can be thought of as the MST on the limiting infinite rooted graph.\n  Our aim is to investigate {\\em how} the local limit of the MST is reached \\textit{dynamically}. For this, we ta","authors_text":"Beno\\^it Corsini, Remco van der Hofstad, Rowel G\\\"undlach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-07-07T10:51:33Z","title":"Local limit of Prim's algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.04867","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:d184b3ffa209c586e663235a455c5b9f597f57d1e4265c6ef65246dd75641290","target":"record","created_at":"2026-07-05T11:32:55Z","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":"f0b96487c88a3781340ec420908134ac7390648842dbfb2fc543130d61bab148","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-07-07T10:51:33Z","title_canon_sha256":"abc9267bf09b6f010192134d0f6cf0e6777e15b8567aa2c72cf3614922e61778"},"schema_version":"1.0","source":{"id":"2507.04867","kind":"arxiv","version":1}},"canonical_sha256":"da6c1331f389d15221d8a9c0fd5cb2b1c7187294a1b75423de519128bfbe3cc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da6c1331f389d15221d8a9c0fd5cb2b1c7187294a1b75423de519128bfbe3cc0","first_computed_at":"2026-07-05T11:32:55.505807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:32:55.505807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fTHK9tOF7dN+CtbuWnqvdkEXtxUT1qsUDpax4alOaPH8K6Bdh4WJucaWfrwwcGJUlOqXrDM8YRQVzzXKNbENAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:32:55.506276Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.04867","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d184b3ffa209c586e663235a455c5b9f597f57d1e4265c6ef65246dd75641290","sha256:e0c8dcd5dd3e25170db56aa99f2bdf74b3596680880b0c96728b992f78ff4620"],"state_sha256":"4d75af59c7c6f6a4399495f11a12fc8b8f88bf324eafbeeeb6dd3b51bda8e8b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dWQonErWAFkt9q8QtayWC2Mx7umU+zrWlO5ArfON9QLQjtb6NwLEvp3Ueek+09YYqgSXgnTdGFui0R+mYCJSDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T01:47:39.967536Z","bundle_sha256":"b56231fbe90e889a17288c487cce1f1077618573ca8e8c448a2b9e5d053c4664"}}