{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:G7ZBMLMFJZG5N4AU5IQBXLJMDH","short_pith_number":"pith:G7ZBMLMF","schema_version":"1.0","canonical_sha256":"37f2162d854e4dd6f014ea201bad2c19de32c0ac49003467518573668ea33dcb","source":{"kind":"arxiv","id":"1410.8234","version":1},"attestation_state":"computed","paper":{"title":"Efficient Coupling for Random Walk with Redistribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Elizabeth Tripp, Hugo Panzo, Iddo Ben-Ari","submitted_at":"2014-10-30T02:40:51Z","abstract_excerpt":"What can one say on convergence to stationarity of a finite state Markov chain that behaves \"locally\" like a nearest neighbor random walk on ${\\mathbb Z}$ ? The model we consider is a version of nearest neighbor lazy random walk on the state space $ \\{0,\\dots,N\\}$: the probability for staying put at each site is $\\frac 12$, the transition to the nearest neighbors, one on the right and one on the left, occurs with probability $\\frac14$ each, where we identify two sites, $J_0$ and $J_N$ as, respectively, the neighbor of $0$ from the left and the neighbor of $N$ from the right (but $0$ is not a n"},"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":"1410.8234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-10-30T02:40:51Z","cross_cats_sorted":[],"title_canon_sha256":"82ea64bf586634293976f8c5486ce5aeca82692e1f1e37c447eaf4c5e25719be","abstract_canon_sha256":"4f967879e653f111b9a88e3876363745cb8378f2ac6805eb06c3fda0029ba1b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:00.280753Z","signature_b64":"HsDRiKMJWQ8RvA3ybRniyZDzhIMtEklKK7AW8XzrdNEw/DV3CPMFm2+5M+PaKrKapM2jxX9rp3oqGg5RrOo4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37f2162d854e4dd6f014ea201bad2c19de32c0ac49003467518573668ea33dcb","last_reissued_at":"2026-05-18T02:39:00.280332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:00.280332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Coupling for Random Walk with Redistribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Elizabeth Tripp, Hugo Panzo, Iddo Ben-Ari","submitted_at":"2014-10-30T02:40:51Z","abstract_excerpt":"What can one say on convergence to stationarity of a finite state Markov chain that behaves \"locally\" like a nearest neighbor random walk on ${\\mathbb Z}$ ? The model we consider is a version of nearest neighbor lazy random walk on the state space $ \\{0,\\dots,N\\}$: the probability for staying put at each site is $\\frac 12$, the transition to the nearest neighbors, one on the right and one on the left, occurs with probability $\\frac14$ each, where we identify two sites, $J_0$ and $J_N$ as, respectively, the neighbor of $0$ from the left and the neighbor of $N$ from the right (but $0$ is not a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8234","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":"1410.8234","created_at":"2026-05-18T02:39:00.280398+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.8234v1","created_at":"2026-05-18T02:39:00.280398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8234","created_at":"2026-05-18T02:39:00.280398+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7ZBMLMFJZG5","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7ZBMLMFJZG5N4AU","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7ZBMLMF","created_at":"2026-05-18T12:28:28.263976+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/G7ZBMLMFJZG5N4AU5IQBXLJMDH","json":"https://pith.science/pith/G7ZBMLMFJZG5N4AU5IQBXLJMDH.json","graph_json":"https://pith.science/api/pith-number/G7ZBMLMFJZG5N4AU5IQBXLJMDH/graph.json","events_json":"https://pith.science/api/pith-number/G7ZBMLMFJZG5N4AU5IQBXLJMDH/events.json","paper":"https://pith.science/paper/G7ZBMLMF"},"agent_actions":{"view_html":"https://pith.science/pith/G7ZBMLMFJZG5N4AU5IQBXLJMDH","download_json":"https://pith.science/pith/G7ZBMLMFJZG5N4AU5IQBXLJMDH.json","view_paper":"https://pith.science/paper/G7ZBMLMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.8234&json=true","fetch_graph":"https://pith.science/api/pith-number/G7ZBMLMFJZG5N4AU5IQBXLJMDH/graph.json","fetch_events":"https://pith.science/api/pith-number/G7ZBMLMFJZG5N4AU5IQBXLJMDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7ZBMLMFJZG5N4AU5IQBXLJMDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7ZBMLMFJZG5N4AU5IQBXLJMDH/action/storage_attestation","attest_author":"https://pith.science/pith/G7ZBMLMFJZG5N4AU5IQBXLJMDH/action/author_attestation","sign_citation":"https://pith.science/pith/G7ZBMLMFJZG5N4AU5IQBXLJMDH/action/citation_signature","submit_replication":"https://pith.science/pith/G7ZBMLMFJZG5N4AU5IQBXLJMDH/action/replication_record"}},"created_at":"2026-05-18T02:39:00.280398+00:00","updated_at":"2026-05-18T02:39:00.280398+00:00"}