{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CJP7RYKG35LCYETYCKCZSAJHOA","short_pith_number":"pith:CJP7RYKG","schema_version":"1.0","canonical_sha256":"125ff8e146df562c127812859901277038fb85292d40728558b5583445ce784d","source":{"kind":"arxiv","id":"2403.05372","version":3},"attestation_state":"computed","paper":{"title":"Limit Laws for Critical Dispersion on Complete Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.PR","authors_text":"Annika Steibel, Konstantinos Panagiotou, Tam\\'as Makai, Umberto De Ambroggio","submitted_at":"2024-03-08T15:06:20Z","abstract_excerpt":"We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. In subsequent time steps, all particles that are located on a vertex inhabited by at least two particles jump independently to a neighbour chosen uniformly at random. The process ends at the first step when no vertex is inhabited by more than one particle; we call this (random) time step the dispersion time.\n  In this work we study the case where $G$ is the complete graph on $n$ vertices "},"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":"2403.05372","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2024-03-08T15:06:20Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"b9cb24bd8c4cc999fe0a8853e752d5ae016a1a9e2fc820ca929412fe28e6ba9e","abstract_canon_sha256":"20089708306aa91dc5e49dfedb8e591992ed44f9350d0beadfd7bd20df458eb4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:11:43.410387Z","signature_b64":"ZFvFLiLn93aC7ShcmeZrsbFWJngw6C2K/AL0JlxO791OarUaZCbNrqEVZ1onkLZXhYCfFf/fjFOZrNYfSURfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"125ff8e146df562c127812859901277038fb85292d40728558b5583445ce784d","last_reissued_at":"2026-07-05T08:11:43.409917Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:11:43.409917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limit Laws for Critical Dispersion on Complete Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.PR","authors_text":"Annika Steibel, Konstantinos Panagiotou, Tam\\'as Makai, Umberto De Ambroggio","submitted_at":"2024-03-08T15:06:20Z","abstract_excerpt":"We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. In subsequent time steps, all particles that are located on a vertex inhabited by at least two particles jump independently to a neighbour chosen uniformly at random. The process ends at the first step when no vertex is inhabited by more than one particle; we call this (random) time step the dispersion time.\n  In this work we study the case where $G$ is the complete graph on $n$ vertices "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.05372","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.05372/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.05372","created_at":"2026-07-05T08:11:43.409973+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.05372v3","created_at":"2026-07-05T08:11:43.409973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.05372","created_at":"2026-07-05T08:11:43.409973+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJP7RYKG35LC","created_at":"2026-07-05T08:11:43.409973+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJP7RYKG35LCYETY","created_at":"2026-07-05T08:11:43.409973+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJP7RYKG","created_at":"2026-07-05T08:11:43.409973+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.16401","citing_title":"Divide-Fuse-Conquer: Eliciting \"Aha Moments\" in Multi-Scenario Games","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CJP7RYKG35LCYETYCKCZSAJHOA","json":"https://pith.science/pith/CJP7RYKG35LCYETYCKCZSAJHOA.json","graph_json":"https://pith.science/api/pith-number/CJP7RYKG35LCYETYCKCZSAJHOA/graph.json","events_json":"https://pith.science/api/pith-number/CJP7RYKG35LCYETYCKCZSAJHOA/events.json","paper":"https://pith.science/paper/CJP7RYKG"},"agent_actions":{"view_html":"https://pith.science/pith/CJP7RYKG35LCYETYCKCZSAJHOA","download_json":"https://pith.science/pith/CJP7RYKG35LCYETYCKCZSAJHOA.json","view_paper":"https://pith.science/paper/CJP7RYKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.05372&json=true","fetch_graph":"https://pith.science/api/pith-number/CJP7RYKG35LCYETYCKCZSAJHOA/graph.json","fetch_events":"https://pith.science/api/pith-number/CJP7RYKG35LCYETYCKCZSAJHOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJP7RYKG35LCYETYCKCZSAJHOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJP7RYKG35LCYETYCKCZSAJHOA/action/storage_attestation","attest_author":"https://pith.science/pith/CJP7RYKG35LCYETYCKCZSAJHOA/action/author_attestation","sign_citation":"https://pith.science/pith/CJP7RYKG35LCYETYCKCZSAJHOA/action/citation_signature","submit_replication":"https://pith.science/pith/CJP7RYKG35LCYETYCKCZSAJHOA/action/replication_record"}},"created_at":"2026-07-05T08:11:43.409973+00:00","updated_at":"2026-07-05T08:11:43.409973+00:00"}