{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BOV43DCIFBVFFPLI2ICQHYL3HF","short_pith_number":"pith:BOV43DCI","canonical_record":{"source":{"id":"1502.02831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-02-10T09:57:41Z","cross_cats_sorted":[],"title_canon_sha256":"a80ff4b4c45e07cc25ac210fbaa4d7d7bd419ade953fe283a5b9aee36e797118","abstract_canon_sha256":"e7debcfe3fef3f0d6a6c999bad4842da6ca571aff5164ab9083fd762adb2cc89"},"schema_version":"1.0"},"canonical_sha256":"0babcd8c48286a52bd68d20503e17b395e96e54a6a9100ac5679853d37a6021b","source":{"kind":"arxiv","id":"1502.02831","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02831","created_at":"2026-05-18T02:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02831v1","created_at":"2026-05-18T02:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02831","created_at":"2026-05-18T02:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"BOV43DCIFBVF","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BOV43DCIFBVFFPLI","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BOV43DCI","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BOV43DCIFBVFFPLI2ICQHYL3HF","target":"record","payload":{"canonical_record":{"source":{"id":"1502.02831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-02-10T09:57:41Z","cross_cats_sorted":[],"title_canon_sha256":"a80ff4b4c45e07cc25ac210fbaa4d7d7bd419ade953fe283a5b9aee36e797118","abstract_canon_sha256":"e7debcfe3fef3f0d6a6c999bad4842da6ca571aff5164ab9083fd762adb2cc89"},"schema_version":"1.0"},"canonical_sha256":"0babcd8c48286a52bd68d20503e17b395e96e54a6a9100ac5679853d37a6021b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:30.776790Z","signature_b64":"NO9q/u0f8e9Sa62SZ07ekBD5JYNXARTQPLgv2NWIwEjQUHGfljq9Qs06QFyPvlnCVYCtMGTnTVbaITFa6eHsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0babcd8c48286a52bd68d20503e17b395e96e54a6a9100ac5679853d37a6021b","last_reissued_at":"2026-05-18T02:27:30.776046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:30.776046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.02831","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zyf7Y82/lVrr2JNTcpvcsnkexMaQ1p7F2pqbqhvNTSYo+f628+W9RAezayBT3YXAbAbPFm/ZwNxLTJlRMQFyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T04:20:03.786409Z"},"content_sha256":"b8706bf153044c73f0d1986583d27e3848cef3fb4fd929ce41bcb2a70ec2a25f","schema_version":"1.0","event_id":"sha256:b8706bf153044c73f0d1986583d27e3848cef3fb4fd929ce41bcb2a70ec2a25f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BOV43DCIFBVFFPLI2ICQHYL3HF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The most visited sites of biased random walks on trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Yueyun Hu, Zhan Shi","submitted_at":"2015-02-10T09:57:41Z","abstract_excerpt":"We consider the slow movement of randomly biased random walk $(X_n)$ on a supercritical Galton--Watson tree, and are interested in the sites on the tree that are most visited by the biased random walk. Our main result implies tightness of the distributions of the most visited sites under the annealed measure. This is in contrast with the one-dimensional case, and provides, to the best of our knowledge, the first non-trivial example of null recurrent random walk whose most visited sites are not transient, a question originally raised by Erd\\H{o}s and R\\'ev\\'esz [11] for simple symmetric random "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02831","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:27:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"skn6lTDJZ9DyEgqm5adjE7w0+sJ1qmZ0DMOS5EqE6d45mZW1Ty6lE8qWocmv4Ast6XI03zP68A658O7CCPNXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T04:20:03.786759Z"},"content_sha256":"be1610c4e60b3719dd3be52df3deffbb0945f746ff7396138c348f58dd67be02","schema_version":"1.0","event_id":"sha256:be1610c4e60b3719dd3be52df3deffbb0945f746ff7396138c348f58dd67be02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BOV43DCIFBVFFPLI2ICQHYL3HF/bundle.json","state_url":"https://pith.science/pith/BOV43DCIFBVFFPLI2ICQHYL3HF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BOV43DCIFBVFFPLI2ICQHYL3HF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-12T04:20:03Z","links":{"resolver":"https://pith.science/pith/BOV43DCIFBVFFPLI2ICQHYL3HF","bundle":"https://pith.science/pith/BOV43DCIFBVFFPLI2ICQHYL3HF/bundle.json","state":"https://pith.science/pith/BOV43DCIFBVFFPLI2ICQHYL3HF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BOV43DCIFBVFFPLI2ICQHYL3HF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BOV43DCIFBVFFPLI2ICQHYL3HF","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":"e7debcfe3fef3f0d6a6c999bad4842da6ca571aff5164ab9083fd762adb2cc89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-02-10T09:57:41Z","title_canon_sha256":"a80ff4b4c45e07cc25ac210fbaa4d7d7bd419ade953fe283a5b9aee36e797118"},"schema_version":"1.0","source":{"id":"1502.02831","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02831","created_at":"2026-05-18T02:27:30Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02831v1","created_at":"2026-05-18T02:27:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02831","created_at":"2026-05-18T02:27:30Z"},{"alias_kind":"pith_short_12","alias_value":"BOV43DCIFBVF","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BOV43DCIFBVFFPLI","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BOV43DCI","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:be1610c4e60b3719dd3be52df3deffbb0945f746ff7396138c348f58dd67be02","target":"graph","created_at":"2026-05-18T02:27:30Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider the slow movement of randomly biased random walk $(X_n)$ on a supercritical Galton--Watson tree, and are interested in the sites on the tree that are most visited by the biased random walk. Our main result implies tightness of the distributions of the most visited sites under the annealed measure. This is in contrast with the one-dimensional case, and provides, to the best of our knowledge, the first non-trivial example of null recurrent random walk whose most visited sites are not transient, a question originally raised by Erd\\H{o}s and R\\'ev\\'esz [11] for simple symmetric random ","authors_text":"Yueyun Hu, Zhan Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-02-10T09:57:41Z","title":"The most visited sites of biased random walks on trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02831","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b8706bf153044c73f0d1986583d27e3848cef3fb4fd929ce41bcb2a70ec2a25f","target":"record","created_at":"2026-05-18T02:27:30Z","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":"e7debcfe3fef3f0d6a6c999bad4842da6ca571aff5164ab9083fd762adb2cc89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-02-10T09:57:41Z","title_canon_sha256":"a80ff4b4c45e07cc25ac210fbaa4d7d7bd419ade953fe283a5b9aee36e797118"},"schema_version":"1.0","source":{"id":"1502.02831","kind":"arxiv","version":1}},"canonical_sha256":"0babcd8c48286a52bd68d20503e17b395e96e54a6a9100ac5679853d37a6021b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0babcd8c48286a52bd68d20503e17b395e96e54a6a9100ac5679853d37a6021b","first_computed_at":"2026-05-18T02:27:30.776046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:30.776046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NO9q/u0f8e9Sa62SZ07ekBD5JYNXARTQPLgv2NWIwEjQUHGfljq9Qs06QFyPvlnCVYCtMGTnTVbaITFa6eHsBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:30.776790Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02831","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8706bf153044c73f0d1986583d27e3848cef3fb4fd929ce41bcb2a70ec2a25f","sha256:be1610c4e60b3719dd3be52df3deffbb0945f746ff7396138c348f58dd67be02"],"state_sha256":"7b39c7740aefcf852b757fe900b5d6d63ae52ddfaef0c281de22cf266f9546d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w8B1rYIZfbAMFqnDlSw6db3OjXkRflmvrfYt/xVhua2qcS/wpofj6ap0SO36gMwYRXxkTzZLpV0Zuns6USfbBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T04:20:03.788697Z","bundle_sha256":"86e06bd68b5a3e01175e81d1ff3ec037959e96c899e1d2ffaa8e00a9f67162ac"}}