{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GNKY7H66VDFWXT5ILQ6OMX4JWE","short_pith_number":"pith:GNKY7H66","schema_version":"1.0","canonical_sha256":"33558f9fdea8cb6bcfa85c3ce65f89b11e0e2b5128370e59d67f4547b487ac8b","source":{"kind":"arxiv","id":"2507.11028","version":2},"attestation_state":"computed","paper":{"title":"One-arm domination time in Cylindrical Hastings-Levitov$(0)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Eviatar B. Procaccia, Guanyi Chen, Yuxuan Zong","submitted_at":"2025-07-15T06:49:35Z","abstract_excerpt":"The cylindrical Hastings-Levitov$(0)$ admits a single infinite connected tree (arm). For a cylinder of width $N$ and particles of size $\\lambda$, {we consider the first time $\\upsilon_{N, \\lambda}$ after which only the unique infinite tree receives particles}. We prove that $\\frac{cN^2}{\\lambda^3} \\le \\mathbb{E}[\\upsilon_{N, \\lambda}]\\le\\frac{CN^2}{\\lambda^3}$, and establish an exponential tail for $\\upsilon_{N, \\lambda}$. Moreover, we obtain an asymptotic bound to the expected total number of trees, and the last time a new tree emerges."},"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.11028","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-07-15T06:49:35Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"704b19da6f8dfc2971210efd6e3395e0692f4aa2836852df6592d4902b79d1fc","abstract_canon_sha256":"077ff3a661dfca8e81a1e5a2ca005298edb16418fd9e3f567b09c3a0692d00e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:15.990598Z","signature_b64":"U1LrtNCM/23ZeS0jm78yoROL/FjjtuxUA02YnzqNK0KxE9Pkjnj5EPZTM5fwMExc2pXizH3wHrID57l5U/G7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33558f9fdea8cb6bcfa85c3ce65f89b11e0e2b5128370e59d67f4547b487ac8b","last_reissued_at":"2026-06-23T02:13:15.990118Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:15.990118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One-arm domination time in Cylindrical Hastings-Levitov$(0)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Eviatar B. Procaccia, Guanyi Chen, Yuxuan Zong","submitted_at":"2025-07-15T06:49:35Z","abstract_excerpt":"The cylindrical Hastings-Levitov$(0)$ admits a single infinite connected tree (arm). For a cylinder of width $N$ and particles of size $\\lambda$, {we consider the first time $\\upsilon_{N, \\lambda}$ after which only the unique infinite tree receives particles}. We prove that $\\frac{cN^2}{\\lambda^3} \\le \\mathbb{E}[\\upsilon_{N, \\lambda}]\\le\\frac{CN^2}{\\lambda^3}$, and establish an exponential tail for $\\upsilon_{N, \\lambda}$. Moreover, we obtain an asymptotic bound to the expected total number of trees, and the last time a new tree emerges."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11028","kind":"arxiv","version":2},"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.11028/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.11028","created_at":"2026-06-23T02:13:15.990176+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.11028v2","created_at":"2026-06-23T02:13:15.990176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11028","created_at":"2026-06-23T02:13:15.990176+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNKY7H66VDFW","created_at":"2026-06-23T02:13:15.990176+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNKY7H66VDFWXT5I","created_at":"2026-06-23T02:13:15.990176+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNKY7H66","created_at":"2026-06-23T02:13:15.990176+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.14851","citing_title":"Pool model: a mass preserving multi particle aggregation process","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GNKY7H66VDFWXT5ILQ6OMX4JWE","json":"https://pith.science/pith/GNKY7H66VDFWXT5ILQ6OMX4JWE.json","graph_json":"https://pith.science/api/pith-number/GNKY7H66VDFWXT5ILQ6OMX4JWE/graph.json","events_json":"https://pith.science/api/pith-number/GNKY7H66VDFWXT5ILQ6OMX4JWE/events.json","paper":"https://pith.science/paper/GNKY7H66"},"agent_actions":{"view_html":"https://pith.science/pith/GNKY7H66VDFWXT5ILQ6OMX4JWE","download_json":"https://pith.science/pith/GNKY7H66VDFWXT5ILQ6OMX4JWE.json","view_paper":"https://pith.science/paper/GNKY7H66","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.11028&json=true","fetch_graph":"https://pith.science/api/pith-number/GNKY7H66VDFWXT5ILQ6OMX4JWE/graph.json","fetch_events":"https://pith.science/api/pith-number/GNKY7H66VDFWXT5ILQ6OMX4JWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNKY7H66VDFWXT5ILQ6OMX4JWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNKY7H66VDFWXT5ILQ6OMX4JWE/action/storage_attestation","attest_author":"https://pith.science/pith/GNKY7H66VDFWXT5ILQ6OMX4JWE/action/author_attestation","sign_citation":"https://pith.science/pith/GNKY7H66VDFWXT5ILQ6OMX4JWE/action/citation_signature","submit_replication":"https://pith.science/pith/GNKY7H66VDFWXT5ILQ6OMX4JWE/action/replication_record"}},"created_at":"2026-06-23T02:13:15.990176+00:00","updated_at":"2026-06-23T02:13:15.990176+00:00"}