{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6QJH2JEBRS56VLWU6ZEZUEDCJT","short_pith_number":"pith:6QJH2JEB","schema_version":"1.0","canonical_sha256":"f4127d24818cbbeaaed4f6499a10624cd2fb86a07f31c8760b41c30591a3a534","source":{"kind":"arxiv","id":"2507.03552","version":1},"attestation_state":"computed","paper":{"title":"On one-dimensional Cluster cluster model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Daniel Sharon, Eviatar B. Procaccia, Noam Berger","submitted_at":"2025-07-04T13:02:24Z","abstract_excerpt":"The Cluster-cluster model was introduced by Meakin et al in 1984. Each $x\\in \\mathbb{Z}^d$ starts with a cluster of size 1 with probability $p \\in (0,1]$ independently. Each cluster $C$ performs a continuous-time SRW with rate $|C|^{-\\alpha}$. If it attempts to move to a vertex occupied by another cluster, it does not move, and instead the two clusters connect via a new edge. Focusing on dimension $d=1$, we show that for $\\alpha>-2$, at time $t$, the cluster size is of order $t^\\frac{1}{\\alpha + 2}$, and for $\\alpha < -2$ we get an infinite cluster in finite time a.s. Additionally, for $\\alpha"},"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":"2507.03552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-07-04T13:02:24Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"e63ac5df34ac32707be47adb915537505c3299b482a4e535e34ee63afee21c0f","abstract_canon_sha256":"102be700481b111b2becfdc1c117d17d59aa88f276147e0785a5554b42114cec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:01.423870Z","signature_b64":"LVUfteH/uAGpry11GC6fJF62pv5tOabM7xROKoSbsXz36SetUyvVWjvMblvlrgHqctosVHL7yoxqvJbbwsnWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4127d24818cbbeaaed4f6499a10624cd2fb86a07f31c8760b41c30591a3a534","last_reissued_at":"2026-07-05T11:32:01.423350Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:01.423350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On one-dimensional Cluster cluster model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Daniel Sharon, Eviatar B. Procaccia, Noam Berger","submitted_at":"2025-07-04T13:02:24Z","abstract_excerpt":"The Cluster-cluster model was introduced by Meakin et al in 1984. Each $x\\in \\mathbb{Z}^d$ starts with a cluster of size 1 with probability $p \\in (0,1]$ independently. Each cluster $C$ performs a continuous-time SRW with rate $|C|^{-\\alpha}$. If it attempts to move to a vertex occupied by another cluster, it does not move, and instead the two clusters connect via a new edge. Focusing on dimension $d=1$, we show that for $\\alpha>-2$, at time $t$, the cluster size is of order $t^\\frac{1}{\\alpha + 2}$, and for $\\alpha < -2$ we get an infinite cluster in finite time a.s. Additionally, for $\\alpha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.03552","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.03552/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":"2507.03552","created_at":"2026-07-05T11:32:01.423420+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.03552v1","created_at":"2026-07-05T11:32:01.423420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.03552","created_at":"2026-07-05T11:32:01.423420+00:00"},{"alias_kind":"pith_short_12","alias_value":"6QJH2JEBRS56","created_at":"2026-07-05T11:32:01.423420+00:00"},{"alias_kind":"pith_short_16","alias_value":"6QJH2JEBRS56VLWU","created_at":"2026-07-05T11:32:01.423420+00:00"},{"alias_kind":"pith_short_8","alias_value":"6QJH2JEB","created_at":"2026-07-05T11:32:01.423420+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.14851","citing_title":"Pool model: a mass preserving multi particle aggregation process","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6QJH2JEBRS56VLWU6ZEZUEDCJT","json":"https://pith.science/pith/6QJH2JEBRS56VLWU6ZEZUEDCJT.json","graph_json":"https://pith.science/api/pith-number/6QJH2JEBRS56VLWU6ZEZUEDCJT/graph.json","events_json":"https://pith.science/api/pith-number/6QJH2JEBRS56VLWU6ZEZUEDCJT/events.json","paper":"https://pith.science/paper/6QJH2JEB"},"agent_actions":{"view_html":"https://pith.science/pith/6QJH2JEBRS56VLWU6ZEZUEDCJT","download_json":"https://pith.science/pith/6QJH2JEBRS56VLWU6ZEZUEDCJT.json","view_paper":"https://pith.science/paper/6QJH2JEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.03552&json=true","fetch_graph":"https://pith.science/api/pith-number/6QJH2JEBRS56VLWU6ZEZUEDCJT/graph.json","fetch_events":"https://pith.science/api/pith-number/6QJH2JEBRS56VLWU6ZEZUEDCJT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6QJH2JEBRS56VLWU6ZEZUEDCJT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6QJH2JEBRS56VLWU6ZEZUEDCJT/action/storage_attestation","attest_author":"https://pith.science/pith/6QJH2JEBRS56VLWU6ZEZUEDCJT/action/author_attestation","sign_citation":"https://pith.science/pith/6QJH2JEBRS56VLWU6ZEZUEDCJT/action/citation_signature","submit_replication":"https://pith.science/pith/6QJH2JEBRS56VLWU6ZEZUEDCJT/action/replication_record"}},"created_at":"2026-07-05T11:32:01.423420+00:00","updated_at":"2026-07-05T11:32:01.423420+00:00"}