{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7KJVPCSLG5AJCMWH2E5HHPJW6V","short_pith_number":"pith:7KJVPCSL","schema_version":"1.0","canonical_sha256":"fa93578a4b37409132c7d13a73bd36f560f05b994fc86b4fb28d3edfae0cb2ac","source":{"kind":"arxiv","id":"1308.4100","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.4100","created_at":"2026-05-18T02:49:38.964943+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.4100v3","created_at":"2026-05-18T02:49:38.964943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4100","created_at":"2026-05-18T02:49:38.964943+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KJVPCSLG5AJ","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KJVPCSLG5AJCMWH","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KJVPCSL","created_at":"2026-05-18T12:27:36.564083+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/7KJVPCSLG5AJCMWH2E5HHPJW6V","json":"https://pith.science/pith/7KJVPCSLG5AJCMWH2E5HHPJW6V.json","graph_json":"https://pith.science/api/pith-number/7KJVPCSLG5AJCMWH2E5HHPJW6V/graph.json","events_json":"https://pith.science/api/pith-number/7KJVPCSLG5AJCMWH2E5HHPJW6V/events.json","paper":"https://pith.science/paper/7KJVPCSL"},"agent_actions":{"view_html":"https://pith.science/pith/7KJVPCSLG5AJCMWH2E5HHPJW6V","download_json":"https://pith.science/pith/7KJVPCSLG5AJCMWH2E5HHPJW6V.json","view_paper":"https://pith.science/paper/7KJVPCSL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.4100&json=true","fetch_graph":"https://pith.science/api/pith-number/7KJVPCSLG5AJCMWH2E5HHPJW6V/graph.json","fetch_events":"https://pith.science/api/pith-number/7KJVPCSLG5AJCMWH2E5HHPJW6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KJVPCSLG5AJCMWH2E5HHPJW6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KJVPCSLG5AJCMWH2E5HHPJW6V/action/storage_attestation","attest_author":"https://pith.science/pith/7KJVPCSLG5AJCMWH2E5HHPJW6V/action/author_attestation","sign_citation":"https://pith.science/pith/7KJVPCSLG5AJCMWH2E5HHPJW6V/action/citation_signature","submit_replication":"https://pith.science/pith/7KJVPCSLG5AJCMWH2E5HHPJW6V/action/replication_record"}},"created_at":"2026-05-18T02:49:38.964943+00:00","updated_at":"2026-05-18T02:49:38.964943+00:00"}