{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:OFKHJGRYTLMONSZHRHQJ7HLIMM","short_pith_number":"pith:OFKHJGRY","schema_version":"1.0","canonical_sha256":"7154749a389ad8e6cb2789e09f9d68632347fca3a76101a5cacfcfe16603c132","source":{"kind":"arxiv","id":"1003.5505","version":5},"attestation_state":"computed","paper":{"title":"Almost sure convergence for stochastically biased random walks on trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Gabriel Faraud, Yueyun Hu, Zhan Shi","submitted_at":"2010-03-29T11:32:19Z","abstract_excerpt":"We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random; the resulting random walk is then a tree-valued random walk in random environment. We investigate the recurrent case, and prove, under suitable general integrability assumptions, that upon the system's non-extinction, the maximal displacement of the walk in the first n steps, divided by (log n)^3, converges almost surely to a known positive constant."},"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":"1003.5505","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-03-29T11:32:19Z","cross_cats_sorted":[],"title_canon_sha256":"7d09d3a14530daf07f44947608ef5f80114d5c0e676a0161cfc1df0cd81c242a","abstract_canon_sha256":"be3793e26213c69e1132c9721ba714dd45f6156d5bd50363f66afdfbd27b4ce5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:26.283347Z","signature_b64":"0K/TY2m7TeX3IZhVxpF+aknt1XojjI9V4WION+zaPYk8fz6Ly9a5gp35+d2d5QrFWgUG2689mhhgjWpkAI5+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7154749a389ad8e6cb2789e09f9d68632347fca3a76101a5cacfcfe16603c132","last_reissued_at":"2026-05-18T02:24:26.282851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:26.282851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost sure convergence for stochastically biased random walks on trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Gabriel Faraud, Yueyun Hu, Zhan Shi","submitted_at":"2010-03-29T11:32:19Z","abstract_excerpt":"We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random; the resulting random walk is then a tree-valued random walk in random environment. We investigate the recurrent case, and prove, under suitable general integrability assumptions, that upon the system's non-extinction, the maximal displacement of the walk in the first n steps, divided by (log n)^3, converges almost surely to a known positive constant."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.5505","kind":"arxiv","version":5},"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":"1003.5505","created_at":"2026-05-18T02:24:26.282913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.5505v5","created_at":"2026-05-18T02:24:26.282913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.5505","created_at":"2026-05-18T02:24:26.282913+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFKHJGRYTLMO","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFKHJGRYTLMONSZH","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFKHJGRY","created_at":"2026-05-18T12:26:12.377268+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/OFKHJGRYTLMONSZHRHQJ7HLIMM","json":"https://pith.science/pith/OFKHJGRYTLMONSZHRHQJ7HLIMM.json","graph_json":"https://pith.science/api/pith-number/OFKHJGRYTLMONSZHRHQJ7HLIMM/graph.json","events_json":"https://pith.science/api/pith-number/OFKHJGRYTLMONSZHRHQJ7HLIMM/events.json","paper":"https://pith.science/paper/OFKHJGRY"},"agent_actions":{"view_html":"https://pith.science/pith/OFKHJGRYTLMONSZHRHQJ7HLIMM","download_json":"https://pith.science/pith/OFKHJGRYTLMONSZHRHQJ7HLIMM.json","view_paper":"https://pith.science/paper/OFKHJGRY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.5505&json=true","fetch_graph":"https://pith.science/api/pith-number/OFKHJGRYTLMONSZHRHQJ7HLIMM/graph.json","fetch_events":"https://pith.science/api/pith-number/OFKHJGRYTLMONSZHRHQJ7HLIMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFKHJGRYTLMONSZHRHQJ7HLIMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFKHJGRYTLMONSZHRHQJ7HLIMM/action/storage_attestation","attest_author":"https://pith.science/pith/OFKHJGRYTLMONSZHRHQJ7HLIMM/action/author_attestation","sign_citation":"https://pith.science/pith/OFKHJGRYTLMONSZHRHQJ7HLIMM/action/citation_signature","submit_replication":"https://pith.science/pith/OFKHJGRYTLMONSZHRHQJ7HLIMM/action/replication_record"}},"created_at":"2026-05-18T02:24:26.282913+00:00","updated_at":"2026-05-18T02:24:26.282913+00:00"}