{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:5EXQOBEXCWJLYCF5W6CBQKB44N","short_pith_number":"pith:5EXQOBEX","schema_version":"1.0","canonical_sha256":"e92f0704971592bc08bdb78418283ce36284e932724a408203bcd5db5e2a7ec7","source":{"kind":"arxiv","id":"0906.3154","version":3},"attestation_state":"computed","paper":{"title":"Fixation for Distributed Clustering Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Charles M. Newman, Leonardo T. Rolla, Marcelo R. Hilario, Oren Louidor, Scott Sheffield, Vladas Sidoravicius","submitted_at":"2009-06-17T13:12:22Z","abstract_excerpt":"We study a discrete-time resource flow in $Z^d$, where wealthier vertices attract the resources of their less rich neighbors. For any translation-invariant probability distribution of initial resource quantities, we prove that the flow at each vertex terminates after finitely many steps. This answers (a generalized version of) a question posed by van den Berg and Meester in 1991. The proof uses the mass-transport principle and extends to other graphs."},"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":"0906.3154","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-06-17T13:12:22Z","cross_cats_sorted":[],"title_canon_sha256":"7b4e9a0474bba8404e6dbbc5c32bd10e9c41d704ffd07524720baf9c4e6f00c1","abstract_canon_sha256":"c1bd5c228e46dcfa4096e9378508acfabe7a843b9f4cef65a08b677d0b7aa10a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:07.432774Z","signature_b64":"zRbqfJjCFAHWo8Sb2/8xDKStAVY6heZabYbIVNdrcBoJnKGGm2YzXl+WosuW/UE4mdh9Ed/TtE9kdnsAcNYYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e92f0704971592bc08bdb78418283ce36284e932724a408203bcd5db5e2a7ec7","last_reissued_at":"2026-05-18T00:39:07.432067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:07.432067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixation for Distributed Clustering Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Charles M. Newman, Leonardo T. Rolla, Marcelo R. Hilario, Oren Louidor, Scott Sheffield, Vladas Sidoravicius","submitted_at":"2009-06-17T13:12:22Z","abstract_excerpt":"We study a discrete-time resource flow in $Z^d$, where wealthier vertices attract the resources of their less rich neighbors. For any translation-invariant probability distribution of initial resource quantities, we prove that the flow at each vertex terminates after finitely many steps. This answers (a generalized version of) a question posed by van den Berg and Meester in 1991. The proof uses the mass-transport principle and extends to other graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.3154","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":"0906.3154","created_at":"2026-05-18T00:39:07.432180+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.3154v3","created_at":"2026-05-18T00:39:07.432180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.3154","created_at":"2026-05-18T00:39:07.432180+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EXQOBEXCWJL","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EXQOBEXCWJLYCF5","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EXQOBEX","created_at":"2026-05-18T12:25:58.837520+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/5EXQOBEXCWJLYCF5W6CBQKB44N","json":"https://pith.science/pith/5EXQOBEXCWJLYCF5W6CBQKB44N.json","graph_json":"https://pith.science/api/pith-number/5EXQOBEXCWJLYCF5W6CBQKB44N/graph.json","events_json":"https://pith.science/api/pith-number/5EXQOBEXCWJLYCF5W6CBQKB44N/events.json","paper":"https://pith.science/paper/5EXQOBEX"},"agent_actions":{"view_html":"https://pith.science/pith/5EXQOBEXCWJLYCF5W6CBQKB44N","download_json":"https://pith.science/pith/5EXQOBEXCWJLYCF5W6CBQKB44N.json","view_paper":"https://pith.science/paper/5EXQOBEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.3154&json=true","fetch_graph":"https://pith.science/api/pith-number/5EXQOBEXCWJLYCF5W6CBQKB44N/graph.json","fetch_events":"https://pith.science/api/pith-number/5EXQOBEXCWJLYCF5W6CBQKB44N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EXQOBEXCWJLYCF5W6CBQKB44N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EXQOBEXCWJLYCF5W6CBQKB44N/action/storage_attestation","attest_author":"https://pith.science/pith/5EXQOBEXCWJLYCF5W6CBQKB44N/action/author_attestation","sign_citation":"https://pith.science/pith/5EXQOBEXCWJLYCF5W6CBQKB44N/action/citation_signature","submit_replication":"https://pith.science/pith/5EXQOBEXCWJLYCF5W6CBQKB44N/action/replication_record"}},"created_at":"2026-05-18T00:39:07.432180+00:00","updated_at":"2026-05-18T00:39:07.432180+00:00"}