{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:D3F3IBN2ARWIJL2XV6BTNE7WLQ","short_pith_number":"pith:D3F3IBN2","schema_version":"1.0","canonical_sha256":"1ecbb405ba046c84af57af833693f65c1bda0fbb8c9a53f067eb07567b3e442b","source":{"kind":"arxiv","id":"1412.4507","version":2},"attestation_state":"computed","paper":{"title":"Local times of subdiffusive biased walks on trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Yueyun Hu","submitted_at":"2014-12-15T09:20:47Z","abstract_excerpt":"Consider a class of null-recurrent randomly biased walks on a super-critical Gaton-Watson tree. We obtain the rates of convergence of the local times and the quenched local probability for the biased walk in the sub-diffusive case. These results are a consequence of a sharp estimate on the return time, whose analysis is driven by a family of concave recursive equations on trees."},"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":"1412.4507","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-12-15T09:20:47Z","cross_cats_sorted":[],"title_canon_sha256":"f0f89d9021a412462a376fe54e1858c06f4e0fd0c9b56f63774ad955ac934214","abstract_canon_sha256":"e8600b995c2875c8f767fc7357ed0c3cb583049f44582967fa068e53356843ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:08.007865Z","signature_b64":"VSZCvDsgcLPz/L7ChHebtNYB+zkRxKRdevEzU7YEXHD0hdCL08DLfZVzsYbzPYyOM2VvnHIIETF1QQyCkFdiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ecbb405ba046c84af57af833693f65c1bda0fbb8c9a53f067eb07567b3e442b","last_reissued_at":"2026-05-17T23:57:08.007466Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:08.007466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local times of subdiffusive biased walks on trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Yueyun Hu","submitted_at":"2014-12-15T09:20:47Z","abstract_excerpt":"Consider a class of null-recurrent randomly biased walks on a super-critical Gaton-Watson tree. We obtain the rates of convergence of the local times and the quenched local probability for the biased walk in the sub-diffusive case. These results are a consequence of a sharp estimate on the return time, whose analysis is driven by a family of concave recursive equations on trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4507","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":"1412.4507","created_at":"2026-05-17T23:57:08.007521+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4507v2","created_at":"2026-05-17T23:57:08.007521+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4507","created_at":"2026-05-17T23:57:08.007521+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3F3IBN2ARWI","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3F3IBN2ARWIJL2X","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3F3IBN2","created_at":"2026-05-18T12:28:25.294606+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/D3F3IBN2ARWIJL2XV6BTNE7WLQ","json":"https://pith.science/pith/D3F3IBN2ARWIJL2XV6BTNE7WLQ.json","graph_json":"https://pith.science/api/pith-number/D3F3IBN2ARWIJL2XV6BTNE7WLQ/graph.json","events_json":"https://pith.science/api/pith-number/D3F3IBN2ARWIJL2XV6BTNE7WLQ/events.json","paper":"https://pith.science/paper/D3F3IBN2"},"agent_actions":{"view_html":"https://pith.science/pith/D3F3IBN2ARWIJL2XV6BTNE7WLQ","download_json":"https://pith.science/pith/D3F3IBN2ARWIJL2XV6BTNE7WLQ.json","view_paper":"https://pith.science/paper/D3F3IBN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4507&json=true","fetch_graph":"https://pith.science/api/pith-number/D3F3IBN2ARWIJL2XV6BTNE7WLQ/graph.json","fetch_events":"https://pith.science/api/pith-number/D3F3IBN2ARWIJL2XV6BTNE7WLQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3F3IBN2ARWIJL2XV6BTNE7WLQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3F3IBN2ARWIJL2XV6BTNE7WLQ/action/storage_attestation","attest_author":"https://pith.science/pith/D3F3IBN2ARWIJL2XV6BTNE7WLQ/action/author_attestation","sign_citation":"https://pith.science/pith/D3F3IBN2ARWIJL2XV6BTNE7WLQ/action/citation_signature","submit_replication":"https://pith.science/pith/D3F3IBN2ARWIJL2XV6BTNE7WLQ/action/replication_record"}},"created_at":"2026-05-17T23:57:08.007521+00:00","updated_at":"2026-05-17T23:57:08.007521+00:00"}