{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LPQKFSGD4FDMS6VADAGVECBULM","short_pith_number":"pith:LPQKFSGD","schema_version":"1.0","canonical_sha256":"5be0a2c8c3e146c97aa0180d5208345b35917c5694b05c8ff5d3e601d2700c79","source":{"kind":"arxiv","id":"2312.04611","version":1},"attestation_state":"computed","paper":{"title":"Growth dichotomy for unimodular random rooted trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.DS"],"primary_cat":"math.PR","authors_text":"Ben Hayes, Mikl\\'os Abert, Miko{\\l}aj Fr\\k{a}czyk","submitted_at":"2023-12-07T16:18:27Z","abstract_excerpt":"We show that the growth of a unimodular random rooted tree $(T,o)$ of degree bounded by $d$ always exists, assuming its upper growth passes the critical threshold $\\sqrt{d-1}$. This complements Timar's work who showed the possible nonexistence of growth below this threshold. The proof goes as follows. By Benjamini-Lyons-Schramm, we can realize $(T,o)$ as the cluster of the root for some invariant percolation on the $d$-regular tree. Then we show that for such a percolation, the limiting exponent with which the lazy random walk returns to the cluster of its starting point always exists. We deve"},"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":"2312.04611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-12-07T16:18:27Z","cross_cats_sorted":["math.CO","math.DS"],"title_canon_sha256":"b99d00c09a2f51791742f746223662e00470cddd679f806fb07c5302488e6e57","abstract_canon_sha256":"96e12cc90e4eb8fa6787ea95e4bcde15d15a8add36fdf83c7bb2271da8986ada"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:21:48.539544Z","signature_b64":"q/nAnzpRMJ3eKQAQL80vTYHN1o+xsYhhKNRzhsqDZUxageTZWvdIbEITjsy1RDCBmnXzFYcEJZ97RDimKXAGDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5be0a2c8c3e146c97aa0180d5208345b35917c5694b05c8ff5d3e601d2700c79","last_reissued_at":"2026-07-05T07:21:48.539112Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:21:48.539112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Growth dichotomy for unimodular random rooted trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.DS"],"primary_cat":"math.PR","authors_text":"Ben Hayes, Mikl\\'os Abert, Miko{\\l}aj Fr\\k{a}czyk","submitted_at":"2023-12-07T16:18:27Z","abstract_excerpt":"We show that the growth of a unimodular random rooted tree $(T,o)$ of degree bounded by $d$ always exists, assuming its upper growth passes the critical threshold $\\sqrt{d-1}$. This complements Timar's work who showed the possible nonexistence of growth below this threshold. The proof goes as follows. By Benjamini-Lyons-Schramm, we can realize $(T,o)$ as the cluster of the root for some invariant percolation on the $d$-regular tree. Then we show that for such a percolation, the limiting exponent with which the lazy random walk returns to the cluster of its starting point always exists. We deve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.04611","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/2312.04611/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":"2312.04611","created_at":"2026-07-05T07:21:48.539171+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.04611v1","created_at":"2026-07-05T07:21:48.539171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.04611","created_at":"2026-07-05T07:21:48.539171+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPQKFSGD4FDM","created_at":"2026-07-05T07:21:48.539171+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPQKFSGD4FDMS6VA","created_at":"2026-07-05T07:21:48.539171+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPQKFSGD","created_at":"2026-07-05T07:21:48.539171+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.18465","citing_title":"A unimodular random graph with large upper growth and no growth","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LPQKFSGD4FDMS6VADAGVECBULM","json":"https://pith.science/pith/LPQKFSGD4FDMS6VADAGVECBULM.json","graph_json":"https://pith.science/api/pith-number/LPQKFSGD4FDMS6VADAGVECBULM/graph.json","events_json":"https://pith.science/api/pith-number/LPQKFSGD4FDMS6VADAGVECBULM/events.json","paper":"https://pith.science/paper/LPQKFSGD"},"agent_actions":{"view_html":"https://pith.science/pith/LPQKFSGD4FDMS6VADAGVECBULM","download_json":"https://pith.science/pith/LPQKFSGD4FDMS6VADAGVECBULM.json","view_paper":"https://pith.science/paper/LPQKFSGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.04611&json=true","fetch_graph":"https://pith.science/api/pith-number/LPQKFSGD4FDMS6VADAGVECBULM/graph.json","fetch_events":"https://pith.science/api/pith-number/LPQKFSGD4FDMS6VADAGVECBULM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPQKFSGD4FDMS6VADAGVECBULM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPQKFSGD4FDMS6VADAGVECBULM/action/storage_attestation","attest_author":"https://pith.science/pith/LPQKFSGD4FDMS6VADAGVECBULM/action/author_attestation","sign_citation":"https://pith.science/pith/LPQKFSGD4FDMS6VADAGVECBULM/action/citation_signature","submit_replication":"https://pith.science/pith/LPQKFSGD4FDMS6VADAGVECBULM/action/replication_record"}},"created_at":"2026-07-05T07:21:48.539171+00:00","updated_at":"2026-07-05T07:21:48.539171+00:00"}