{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NEIO2RPQS36PNQHN25C7WO7SHF","short_pith_number":"pith:NEIO2RPQ","schema_version":"1.0","canonical_sha256":"6910ed45f096fcf6c0edd745fb3bf23979bf4bd29d25064b427a415fa056bf88","source":{"kind":"arxiv","id":"1604.07631","version":2},"attestation_state":"computed","paper":{"title":"Phase transition for the Once-reinforced random walk on $\\mathbb{Z}^d$-like trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Daniel Kious, Vladas Sidoravicius","submitted_at":"2016-04-26T11:50:20Z","abstract_excerpt":"In this short paper, we consider the Once-reinforced random walk with reinforcement parameter $a$ on trees with bounded degree which are transient for the simple random walk. On each of these trees, we prove that there exists an explicit critical parameter $a_0$ such that the Once-reinforced random walk is almost surely recurrent if $a>a_0$ and almost surely transient if $a<a_0$. This provides the first examples of phase transition for the Once-reinforced random walk."},"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":"1604.07631","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-04-26T11:50:20Z","cross_cats_sorted":[],"title_canon_sha256":"6f33bae1f141f62cae0a71eabac7a607c80daa29d3272cc276f7947eba0bee25","abstract_canon_sha256":"19a57e85dc5b60dd6dbb01b47172c9b813e8b5689ad42cf0329444576db25daa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:36.772966Z","signature_b64":"DCrgKBR/ekmTvtGJU02N5GQ5+iH8MMHpFTBoOXiWOVE2ulmWir6WU3YNwIPcC2lMORYoB9EQzj5Ho1njbSLMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6910ed45f096fcf6c0edd745fb3bf23979bf4bd29d25064b427a415fa056bf88","last_reissued_at":"2026-05-18T00:37:36.772483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:36.772483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Phase transition for the Once-reinforced random walk on $\\mathbb{Z}^d$-like trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Daniel Kious, Vladas Sidoravicius","submitted_at":"2016-04-26T11:50:20Z","abstract_excerpt":"In this short paper, we consider the Once-reinforced random walk with reinforcement parameter $a$ on trees with bounded degree which are transient for the simple random walk. On each of these trees, we prove that there exists an explicit critical parameter $a_0$ such that the Once-reinforced random walk is almost surely recurrent if $a>a_0$ and almost surely transient if $a<a_0$. This provides the first examples of phase transition for the Once-reinforced random walk."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07631","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":""},"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":"1604.07631","created_at":"2026-05-18T00:37:36.772551+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07631v2","created_at":"2026-05-18T00:37:36.772551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07631","created_at":"2026-05-18T00:37:36.772551+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEIO2RPQS36P","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEIO2RPQS36PNQHN","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEIO2RPQ","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NEIO2RPQS36PNQHN25C7WO7SHF","json":"https://pith.science/pith/NEIO2RPQS36PNQHN25C7WO7SHF.json","graph_json":"https://pith.science/api/pith-number/NEIO2RPQS36PNQHN25C7WO7SHF/graph.json","events_json":"https://pith.science/api/pith-number/NEIO2RPQS36PNQHN25C7WO7SHF/events.json","paper":"https://pith.science/paper/NEIO2RPQ"},"agent_actions":{"view_html":"https://pith.science/pith/NEIO2RPQS36PNQHN25C7WO7SHF","download_json":"https://pith.science/pith/NEIO2RPQS36PNQHN25C7WO7SHF.json","view_paper":"https://pith.science/paper/NEIO2RPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07631&json=true","fetch_graph":"https://pith.science/api/pith-number/NEIO2RPQS36PNQHN25C7WO7SHF/graph.json","fetch_events":"https://pith.science/api/pith-number/NEIO2RPQS36PNQHN25C7WO7SHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEIO2RPQS36PNQHN25C7WO7SHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEIO2RPQS36PNQHN25C7WO7SHF/action/storage_attestation","attest_author":"https://pith.science/pith/NEIO2RPQS36PNQHN25C7WO7SHF/action/author_attestation","sign_citation":"https://pith.science/pith/NEIO2RPQS36PNQHN25C7WO7SHF/action/citation_signature","submit_replication":"https://pith.science/pith/NEIO2RPQS36PNQHN25C7WO7SHF/action/replication_record"}},"created_at":"2026-05-18T00:37:36.772551+00:00","updated_at":"2026-05-18T00:37:36.772551+00:00"}