{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UVBRGKYZY5FP5GHXRAPVWWVMSL","short_pith_number":"pith:UVBRGKYZ","schema_version":"1.0","canonical_sha256":"a543132b19c74afe98f7881f5b5aac92f608302fc97709a1da5d0dd49dcec663","source":{"kind":"arxiv","id":"1611.04497","version":1},"attestation_state":"computed","paper":{"title":"Favorite sites of randomly biased walks on a supercritical Galton-Watson tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Dayue Chen, Lo\\\"ic de Raph\\'elis, Yueyun Hu","submitted_at":"2016-11-14T17:53:06Z","abstract_excerpt":"Erd\\H{o}s and R\\'ev\\'esz initiated the study of favorite sites by considering the one-dimensional simple random walk. We investigate in this paper the same problem for a class of null-recurrent randomly biased walks on a supercritical Gaton-Watson tree. We prove that there is some parameter $\\kappa \\in (1, \\infty]$ such that the set of the favorite sites of the biased walk is almost surely bounded in the case $\\kappa \\in (2, \\infty]$, tight in the case $\\kappa=2$, and oscillates between a neighborhood of the root and the boundary of the range in the case $\\kappa \\in (1, 2)$. Moreover, our resu"},"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":"1611.04497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-11-14T17:53:06Z","cross_cats_sorted":[],"title_canon_sha256":"13531d01b4b0ad7b214a2341e445b659baf67ad93d06489441a30d0fc2c2baa1","abstract_canon_sha256":"46f9d4a96245578199f64d0582e12498f1f6eccf3a2c29dd5797800d23092282"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:12.951595Z","signature_b64":"lRT2hyz2Eig2zD1963VY2FI5bQhIOGldf2U4iEZ8QKFep80zo0O98xdGJ3oe2DDaxK5Abh30ajLSKbS1LB1LCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a543132b19c74afe98f7881f5b5aac92f608302fc97709a1da5d0dd49dcec663","last_reissued_at":"2026-05-18T00:59:12.950974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:12.950974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Favorite sites of randomly biased walks on a supercritical Galton-Watson tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Dayue Chen, Lo\\\"ic de Raph\\'elis, Yueyun Hu","submitted_at":"2016-11-14T17:53:06Z","abstract_excerpt":"Erd\\H{o}s and R\\'ev\\'esz initiated the study of favorite sites by considering the one-dimensional simple random walk. We investigate in this paper the same problem for a class of null-recurrent randomly biased walks on a supercritical Gaton-Watson tree. We prove that there is some parameter $\\kappa \\in (1, \\infty]$ such that the set of the favorite sites of the biased walk is almost surely bounded in the case $\\kappa \\in (2, \\infty]$, tight in the case $\\kappa=2$, and oscillates between a neighborhood of the root and the boundary of the range in the case $\\kappa \\in (1, 2)$. Moreover, our resu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04497","kind":"arxiv","version":1},"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":"1611.04497","created_at":"2026-05-18T00:59:12.951100+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.04497v1","created_at":"2026-05-18T00:59:12.951100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04497","created_at":"2026-05-18T00:59:12.951100+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVBRGKYZY5FP","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVBRGKYZY5FP5GHX","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVBRGKYZ","created_at":"2026-05-18T12:30:46.583412+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/UVBRGKYZY5FP5GHXRAPVWWVMSL","json":"https://pith.science/pith/UVBRGKYZY5FP5GHXRAPVWWVMSL.json","graph_json":"https://pith.science/api/pith-number/UVBRGKYZY5FP5GHXRAPVWWVMSL/graph.json","events_json":"https://pith.science/api/pith-number/UVBRGKYZY5FP5GHXRAPVWWVMSL/events.json","paper":"https://pith.science/paper/UVBRGKYZ"},"agent_actions":{"view_html":"https://pith.science/pith/UVBRGKYZY5FP5GHXRAPVWWVMSL","download_json":"https://pith.science/pith/UVBRGKYZY5FP5GHXRAPVWWVMSL.json","view_paper":"https://pith.science/paper/UVBRGKYZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.04497&json=true","fetch_graph":"https://pith.science/api/pith-number/UVBRGKYZY5FP5GHXRAPVWWVMSL/graph.json","fetch_events":"https://pith.science/api/pith-number/UVBRGKYZY5FP5GHXRAPVWWVMSL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVBRGKYZY5FP5GHXRAPVWWVMSL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVBRGKYZY5FP5GHXRAPVWWVMSL/action/storage_attestation","attest_author":"https://pith.science/pith/UVBRGKYZY5FP5GHXRAPVWWVMSL/action/author_attestation","sign_citation":"https://pith.science/pith/UVBRGKYZY5FP5GHXRAPVWWVMSL/action/citation_signature","submit_replication":"https://pith.science/pith/UVBRGKYZY5FP5GHXRAPVWWVMSL/action/replication_record"}},"created_at":"2026-05-18T00:59:12.951100+00:00","updated_at":"2026-05-18T00:59:12.951100+00:00"}