{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JL4WYXEW2QOU4PWOQF44KRYJVG","short_pith_number":"pith:JL4WYXEW","schema_version":"1.0","canonical_sha256":"4af96c5c96d41d4e3ece8179c54709a98d7ed3621ebcd8dff1d0c140b19698ae","source":{"kind":"arxiv","id":"1410.0099","version":1},"attestation_state":"computed","paper":{"title":"Coalescence and meeting times on $n$-block Markov chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.PR","authors_text":"Kathleen Lan, Kevin McGoff","submitted_at":"2014-10-01T03:35:24Z","abstract_excerpt":"We consider finite state, discrete-time, mixing Markov chains $(V,P)$, where $V$ is the state space and $P$ is transition matrix. To each such chain $(V,P)$, we associate a sequence of chains $(V_n,P_n)$ by coding trajectories of $(V,P)$ according to their overlapping $n$-blocks. The chain $(V_n,P_n)$, called the $n$-block Markov chain associated to $(V,P)$, may be considered an alternate version of $(V,P)$ having memory of length $n$. Along such a sequence of chains, we characterize the asymptotic behavior of coalescence times and meeting times as $n$ tends to infinity. In particular, we defi"},"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.0099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-10-01T03:35:24Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"09001812a1fbe2d24f88d629b07ba9fd06d3a256389919f0900ab969384b5439","abstract_canon_sha256":"d2cff204611fbd27aac6a03c290dcb7968a24e376ac6c8c2bf1594b79de03b82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:18.027945Z","signature_b64":"mLrX8a+z/EBVXJpSFKKKlV5UlLIORCU9MlzxBFE09lvKMoWg4xnoOzFV/C6leaHFYP4brHjgtAYRUBk7CC0yDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4af96c5c96d41d4e3ece8179c54709a98d7ed3621ebcd8dff1d0c140b19698ae","last_reissued_at":"2026-05-18T02:41:18.027519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:18.027519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coalescence and meeting times on $n$-block Markov chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.PR","authors_text":"Kathleen Lan, Kevin McGoff","submitted_at":"2014-10-01T03:35:24Z","abstract_excerpt":"We consider finite state, discrete-time, mixing Markov chains $(V,P)$, where $V$ is the state space and $P$ is transition matrix. To each such chain $(V,P)$, we associate a sequence of chains $(V_n,P_n)$ by coding trajectories of $(V,P)$ according to their overlapping $n$-blocks. The chain $(V_n,P_n)$, called the $n$-block Markov chain associated to $(V,P)$, may be considered an alternate version of $(V,P)$ having memory of length $n$. Along such a sequence of chains, we characterize the asymptotic behavior of coalescence times and meeting times as $n$ tends to infinity. In particular, we defi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0099","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.0099","created_at":"2026-05-18T02:41:18.027590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.0099v1","created_at":"2026-05-18T02:41:18.027590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0099","created_at":"2026-05-18T02:41:18.027590+00:00"},{"alias_kind":"pith_short_12","alias_value":"JL4WYXEW2QOU","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JL4WYXEW2QOU4PWO","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JL4WYXEW","created_at":"2026-05-18T12:28:33.132498+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/JL4WYXEW2QOU4PWOQF44KRYJVG","json":"https://pith.science/pith/JL4WYXEW2QOU4PWOQF44KRYJVG.json","graph_json":"https://pith.science/api/pith-number/JL4WYXEW2QOU4PWOQF44KRYJVG/graph.json","events_json":"https://pith.science/api/pith-number/JL4WYXEW2QOU4PWOQF44KRYJVG/events.json","paper":"https://pith.science/paper/JL4WYXEW"},"agent_actions":{"view_html":"https://pith.science/pith/JL4WYXEW2QOU4PWOQF44KRYJVG","download_json":"https://pith.science/pith/JL4WYXEW2QOU4PWOQF44KRYJVG.json","view_paper":"https://pith.science/paper/JL4WYXEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.0099&json=true","fetch_graph":"https://pith.science/api/pith-number/JL4WYXEW2QOU4PWOQF44KRYJVG/graph.json","fetch_events":"https://pith.science/api/pith-number/JL4WYXEW2QOU4PWOQF44KRYJVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JL4WYXEW2QOU4PWOQF44KRYJVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JL4WYXEW2QOU4PWOQF44KRYJVG/action/storage_attestation","attest_author":"https://pith.science/pith/JL4WYXEW2QOU4PWOQF44KRYJVG/action/author_attestation","sign_citation":"https://pith.science/pith/JL4WYXEW2QOU4PWOQF44KRYJVG/action/citation_signature","submit_replication":"https://pith.science/pith/JL4WYXEW2QOU4PWOQF44KRYJVG/action/replication_record"}},"created_at":"2026-05-18T02:41:18.027590+00:00","updated_at":"2026-05-18T02:41:18.027590+00:00"}