{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:LPQKFSGD4FDMS6VADAGVECBULM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"96e12cc90e4eb8fa6787ea95e4bcde15d15a8add36fdf83c7bb2271da8986ada","cross_cats_sorted":["math.CO","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-12-07T16:18:27Z","title_canon_sha256":"b99d00c09a2f51791742f746223662e00470cddd679f806fb07c5302488e6e57"},"schema_version":"1.0","source":{"id":"2312.04611","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.04611","created_at":"2026-07-05T07:21:48Z"},{"alias_kind":"arxiv_version","alias_value":"2312.04611v1","created_at":"2026-07-05T07:21:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.04611","created_at":"2026-07-05T07:21:48Z"},{"alias_kind":"pith_short_12","alias_value":"LPQKFSGD4FDM","created_at":"2026-07-05T07:21:48Z"},{"alias_kind":"pith_short_16","alias_value":"LPQKFSGD4FDMS6VA","created_at":"2026-07-05T07:21:48Z"},{"alias_kind":"pith_short_8","alias_value":"LPQKFSGD","created_at":"2026-07-05T07:21:48Z"}],"graph_snapshots":[{"event_id":"sha256:c53e87d369ab671ecc801656de864cf2993fcaa316dcb29d359950d2dc01ab79","target":"graph","created_at":"2026-07-05T07:21:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.04611/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ben Hayes, Mikl\\'os Abert, Miko{\\l}aj Fr\\k{a}czyk","cross_cats":["math.CO","math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-12-07T16:18:27Z","title":"Growth dichotomy for unimodular random rooted trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.04611","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:de173701f4a4e5208c6bbdcfe847579c02c35114ff998e9586c2c3e17d1e5d0f","target":"record","created_at":"2026-07-05T07:21:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"96e12cc90e4eb8fa6787ea95e4bcde15d15a8add36fdf83c7bb2271da8986ada","cross_cats_sorted":["math.CO","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-12-07T16:18:27Z","title_canon_sha256":"b99d00c09a2f51791742f746223662e00470cddd679f806fb07c5302488e6e57"},"schema_version":"1.0","source":{"id":"2312.04611","kind":"arxiv","version":1}},"canonical_sha256":"5be0a2c8c3e146c97aa0180d5208345b35917c5694b05c8ff5d3e601d2700c79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5be0a2c8c3e146c97aa0180d5208345b35917c5694b05c8ff5d3e601d2700c79","first_computed_at":"2026-07-05T07:21:48.539112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:21:48.539112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q/nAnzpRMJ3eKQAQL80vTYHN1o+xsYhhKNRzhsqDZUxageTZWvdIbEITjsy1RDCBmnXzFYcEJZ97RDimKXAGDA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:21:48.539544Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.04611","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de173701f4a4e5208c6bbdcfe847579c02c35114ff998e9586c2c3e17d1e5d0f","sha256:c53e87d369ab671ecc801656de864cf2993fcaa316dcb29d359950d2dc01ab79"],"state_sha256":"111ef616ad131294e876013f089b2c907e0551d35b93121f1fa4ca24ce856e41"}