{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2B3ROYMISWQ5UXLD6UUMGFOU6J","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":"0f6e671b9046b07dcdcc4d239b9e568121d9fbd96c1212fe32c665f16486e158","cross_cats_sorted":["cond-mat.stat-mech","math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-04-27T12:18:08Z","title_canon_sha256":"7e92e66c5212cb5493248cae718488d3dfb83a400df7472b8f535a5422cca0c0"},"schema_version":"1.0","source":{"id":"2604.24389","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.24389","created_at":"2026-06-05T01:15:24Z"},{"alias_kind":"arxiv_version","alias_value":"2604.24389v2","created_at":"2026-06-05T01:15:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.24389","created_at":"2026-06-05T01:15:24Z"},{"alias_kind":"pith_short_12","alias_value":"2B3ROYMISWQ5","created_at":"2026-06-05T01:15:24Z"},{"alias_kind":"pith_short_16","alias_value":"2B3ROYMISWQ5UXLD","created_at":"2026-06-05T01:15:24Z"},{"alias_kind":"pith_short_8","alias_value":"2B3ROYMI","created_at":"2026-06-05T01:15:24Z"}],"graph_snapshots":[{"event_id":"sha256:f78865848c294b361a7157afe2c101541bafc1478b11beef331ee661b34bd7cd","target":"graph","created_at":"2026-06-05T01:15:24Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We show that the process exhibits a sharp phase transition between recurrence and transience. The critical value is determined by the branching-ruin number of the tree. We prove that the walk is almost surely transient when the branching-ruin number is greater than 1/2, and recurrent when it is less than 1/2."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The branching-ruin number of the tree equals the Hausdorff dimension of its boundary under a suitable metric, allowing the critical value to be located at 1/2."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"True self-avoiding walks on general trees are transient if the branching-ruin number exceeds 1/2 and recurrent otherwise."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"True self-avoiding walks on trees switch from recurrent to transient exactly when the branching-ruin number exceeds 1/2."}],"snapshot_sha256":"3381a42417d80c5c1eb7460417f897ec9d9fba0f9e4b49e96328e12d6a5c2f14"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-21T06:41:15.018328Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T22:06:18.380624Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.24389/integrity.json","findings":[],"snapshot_sha256":"c327ccac50bcc3992c385e327435301f9ce7588d18a9a0cc8ea45f6018e43e65","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the asymptotic behavior of ``true\" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse with probability proportional to the current weight of that edge, where the weight of each edge after being traversed $n$ times is given by $w(n)=\\exp(-\\beta n)$. We show that the process exhibits a sharp phase transition between recurrence and transience. The critical value is determined by the branching-ruin number of the tree, which coincides with the Hausd","authors_text":"Tuan-Minh Nguyen","cross_cats":["cond-mat.stat-mech","math-ph","math.MP"],"headline":"True self-avoiding walks on trees switch from recurrent to transient exactly when the branching-ruin number exceeds 1/2.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-04-27T12:18:08Z","title":"\"True\" self-avoiding walks on general trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.24389","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T01:55:12.268244Z","id":"a2fadedf-c578-4338-97d6-4cdf11b4b1ef","model_set":{"reader":"grok-4.3"},"one_line_summary":"True self-avoiding walks on general trees are transient if the branching-ruin number exceeds 1/2 and recurrent otherwise.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"True self-avoiding walks on trees switch from recurrent to transient exactly when the branching-ruin number exceeds 1/2.","strongest_claim":"We show that the process exhibits a sharp phase transition between recurrence and transience. The critical value is determined by the branching-ruin number of the tree. We prove that the walk is almost surely transient when the branching-ruin number is greater than 1/2, and recurrent when it is less than 1/2.","weakest_assumption":"The branching-ruin number of the tree equals the Hausdorff dimension of its boundary under a suitable metric, allowing the critical value to be located at 1/2."}},"verdict_id":"a2fadedf-c578-4338-97d6-4cdf11b4b1ef"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:77c480bf624f4eaa7ee93a6bac9ff66b724a1aa0cf0db4d7c14a439a456d829c","target":"record","created_at":"2026-06-05T01:15:24Z","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":"0f6e671b9046b07dcdcc4d239b9e568121d9fbd96c1212fe32c665f16486e158","cross_cats_sorted":["cond-mat.stat-mech","math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-04-27T12:18:08Z","title_canon_sha256":"7e92e66c5212cb5493248cae718488d3dfb83a400df7472b8f535a5422cca0c0"},"schema_version":"1.0","source":{"id":"2604.24389","kind":"arxiv","version":2}},"canonical_sha256":"d07717618895a1da5d63f528c315d4f247115291a1db0c6dc32b2bc06cb83990","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d07717618895a1da5d63f528c315d4f247115291a1db0c6dc32b2bc06cb83990","first_computed_at":"2026-06-05T01:15:24.728121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T01:15:24.728121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XIzWaY1TOrPihjzm0DGXiQYm12TGzqndQ4mj7dNDrdv1g5HMqF7X9vvHCbMZP2lUXECulopUv1MONQIwdjyBBQ==","signature_status":"signed_v1","signed_at":"2026-06-05T01:15:24.728587Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.24389","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77c480bf624f4eaa7ee93a6bac9ff66b724a1aa0cf0db4d7c14a439a456d829c","sha256:f78865848c294b361a7157afe2c101541bafc1478b11beef331ee661b34bd7cd"],"state_sha256":"8cc18e722a6d9e4e08503ee255afb47a6192809803731df9e5b459fe9241d43f"}