{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7KJVPCSLG5AJCMWH2E5HHPJW6V","short_pith_number":"pith:7KJVPCSL","canonical_record":{"source":{"id":"1308.4100","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-08-19T19:07:04Z","cross_cats_sorted":[],"title_canon_sha256":"20b4e3cb844a34db5ad89ca41a97b26c1708d1f8020aa2c4f2fdf542df603652","abstract_canon_sha256":"f3fe8dbff0a0ce9a1d8599613ab2ae4a1e025eac269381cbe1b74277a1d1c102"},"schema_version":"1.0"},"canonical_sha256":"fa93578a4b37409132c7d13a73bd36f560f05b994fc86b4fb28d3edfae0cb2ac","source":{"kind":"arxiv","id":"1308.4100","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4100","created_at":"2026-05-18T02:49:38Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4100v3","created_at":"2026-05-18T02:49:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4100","created_at":"2026-05-18T02:49:38Z"},{"alias_kind":"pith_short_12","alias_value":"7KJVPCSLG5AJ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7KJVPCSLG5AJCMWH","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7KJVPCSL","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7KJVPCSLG5AJCMWH2E5HHPJW6V","target":"record","payload":{"canonical_record":{"source":{"id":"1308.4100","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-08-19T19:07:04Z","cross_cats_sorted":[],"title_canon_sha256":"20b4e3cb844a34db5ad89ca41a97b26c1708d1f8020aa2c4f2fdf542df603652","abstract_canon_sha256":"f3fe8dbff0a0ce9a1d8599613ab2ae4a1e025eac269381cbe1b74277a1d1c102"},"schema_version":"1.0"},"canonical_sha256":"fa93578a4b37409132c7d13a73bd36f560f05b994fc86b4fb28d3edfae0cb2ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:38.965228Z","signature_b64":"R+U2L1AEZzRZmROFi/6xR02VjD0Ql77Al1VT60ST5AZ+8wE4NIJWRY4+14vGHkJaC9kZkIvWNXRpEmBmKZBfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa93578a4b37409132c7d13a73bd36f560f05b994fc86b4fb28d3edfae0cb2ac","last_reissued_at":"2026-05-18T02:49:38.964891Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:38.964891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.4100","source_version":3,"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-18T02:49:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X8R7xcUlSo+Pi+LAiVR2O9t9VTHwPhlIJbOsjaYJEWVfNEJLQHeIFBHjes1VIlScsO+nJzBOCp00bCxWs4FrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:30:44.114885Z"},"content_sha256":"3d40b0a45dbf28757d1bc628281fc4323de72245fe501af3ed72394e26d3cb8d","schema_version":"1.0","event_id":"sha256:3d40b0a45dbf28757d1bc628281fc4323de72245fe501af3ed72394e26d3cb8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7KJVPCSLG5AJCMWH2E5HHPJW6V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Markovian loop clusters on the complete graph and coagulation equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Sophie Lemaire","submitted_at":"2013-08-19T19:07:04Z","abstract_excerpt":"Poissonian ensembles of Markov loops on a finite graph define a random graph process in which the addition of a loop can merge more than two connected components. We study Markov loops on the complete graph derived from a simple random walk killed at each step with a constant probability. Using a component exploration procedure, we describe the asymptotic distribution of the connected component size of a vertex at a time proportional to the number of vertices, show that the largest component size undergoes a phase transition and establish the coagulation equations associated to this random gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4100","kind":"arxiv","version":3},"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-18T02:49:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JiTXy6yXiBDjszOK6qFbOe07t2d573MmsT+ZglKhYuTfGfBoXwM8LWYec0fHauLVS5xRHrvvG8yK22fCNzE6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:30:44.115231Z"},"content_sha256":"96308848ea2e0d87778fa84c8670c2deb9d2d1f9535ca397e316ef672b641b24","schema_version":"1.0","event_id":"sha256:96308848ea2e0d87778fa84c8670c2deb9d2d1f9535ca397e316ef672b641b24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7KJVPCSLG5AJCMWH2E5HHPJW6V/bundle.json","state_url":"https://pith.science/pith/7KJVPCSLG5AJCMWH2E5HHPJW6V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7KJVPCSLG5AJCMWH2E5HHPJW6V/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-06-24T16:30:44Z","links":{"resolver":"https://pith.science/pith/7KJVPCSLG5AJCMWH2E5HHPJW6V","bundle":"https://pith.science/pith/7KJVPCSLG5AJCMWH2E5HHPJW6V/bundle.json","state":"https://pith.science/pith/7KJVPCSLG5AJCMWH2E5HHPJW6V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7KJVPCSLG5AJCMWH2E5HHPJW6V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7KJVPCSLG5AJCMWH2E5HHPJW6V","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":"f3fe8dbff0a0ce9a1d8599613ab2ae4a1e025eac269381cbe1b74277a1d1c102","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-08-19T19:07:04Z","title_canon_sha256":"20b4e3cb844a34db5ad89ca41a97b26c1708d1f8020aa2c4f2fdf542df603652"},"schema_version":"1.0","source":{"id":"1308.4100","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.4100","created_at":"2026-05-18T02:49:38Z"},{"alias_kind":"arxiv_version","alias_value":"1308.4100v3","created_at":"2026-05-18T02:49:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4100","created_at":"2026-05-18T02:49:38Z"},{"alias_kind":"pith_short_12","alias_value":"7KJVPCSLG5AJ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7KJVPCSLG5AJCMWH","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7KJVPCSL","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:96308848ea2e0d87778fa84c8670c2deb9d2d1f9535ca397e316ef672b641b24","target":"graph","created_at":"2026-05-18T02:49:38Z","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":"Poissonian ensembles of Markov loops on a finite graph define a random graph process in which the addition of a loop can merge more than two connected components. We study Markov loops on the complete graph derived from a simple random walk killed at each step with a constant probability. Using a component exploration procedure, we describe the asymptotic distribution of the connected component size of a vertex at a time proportional to the number of vertices, show that the largest component size undergoes a phase transition and establish the coagulation equations associated to this random gra","authors_text":"Sophie Lemaire","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-08-19T19:07:04Z","title":"Markovian loop clusters on the complete graph and coagulation equations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4100","kind":"arxiv","version":3},"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:3d40b0a45dbf28757d1bc628281fc4323de72245fe501af3ed72394e26d3cb8d","target":"record","created_at":"2026-05-18T02:49:38Z","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":"f3fe8dbff0a0ce9a1d8599613ab2ae4a1e025eac269381cbe1b74277a1d1c102","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-08-19T19:07:04Z","title_canon_sha256":"20b4e3cb844a34db5ad89ca41a97b26c1708d1f8020aa2c4f2fdf542df603652"},"schema_version":"1.0","source":{"id":"1308.4100","kind":"arxiv","version":3}},"canonical_sha256":"fa93578a4b37409132c7d13a73bd36f560f05b994fc86b4fb28d3edfae0cb2ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa93578a4b37409132c7d13a73bd36f560f05b994fc86b4fb28d3edfae0cb2ac","first_computed_at":"2026-05-18T02:49:38.964891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:38.964891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R+U2L1AEZzRZmROFi/6xR02VjD0Ql77Al1VT60ST5AZ+8wE4NIJWRY4+14vGHkJaC9kZkIvWNXRpEmBmKZBfDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:38.965228Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.4100","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d40b0a45dbf28757d1bc628281fc4323de72245fe501af3ed72394e26d3cb8d","sha256:96308848ea2e0d87778fa84c8670c2deb9d2d1f9535ca397e316ef672b641b24"],"state_sha256":"06dcde25bcff8db4af8ef14f233bb71260c3ecfbe93161ddb110c0dd7715af9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wAy4MaN+IN3mcRebKC9O7ERJLlXsCOJtDAc1x6MejCxHYK9mpIXUPh9um1Ua3tqeZSPWN+c/OpeQuRzkQzSnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T16:30:44.117164Z","bundle_sha256":"a381c3087089154c1c6ed9dfbd7ebbbf11de49f5291a899b7a37195ab4718262"}}