{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DEO3IIXOWH4IRJXUXO2ZB3ZC63","short_pith_number":"pith:DEO3IIXO","schema_version":"1.0","canonical_sha256":"191db422eeb1f888a6f4bbb590ef22f6c346a123a696c20ba3241d877424cbae","source":{"kind":"arxiv","id":"1605.03512","version":2},"attestation_state":"computed","paper":{"title":"Doob-Martin compactification of a Markov chain for growing random words sequentially","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Hye Soo Choi, Steven N. Evans","submitted_at":"2016-05-11T16:57:50Z","abstract_excerpt":"We consider a Markov chain that iteratively generates a sequence of random finite words in such a way that the $n^{\\mathrm{th}}$ word is uniformly distributed over the set of words of length $2n$ in which $n$ letters are $a$ and $n$ letters are $b$: at each step an $a$ and a $b$ are shuffled in uniformly at random among the letters of the current word. We obtain a concrete characterization of the Doob-Martin boundary of this Markov chain. Writing $N(u)$ for the number of letters $a$ (equivalently, $b$) in the finite word $u$, we show that a sequence $(u_n)_{n \\in \\mathbb{N}}$ of finite words c"},"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":"1605.03512","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-11T16:57:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ca4125ce10a0adf27226039967b880dd8f920bf1fcb1f5f15b3616cc9dd0cac9","abstract_canon_sha256":"ebb1cd1fe4c41e42913ef46852a54c7ea3fd318cc74fdb788acb43276c7b93f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:10.756577Z","signature_b64":"GCEXhiiIBUiQ13ao6lOfa3IC2S3ehvG+KnohwnuH4HEjyQ2gcAmwOSwPmqfnG7n0AoDs/qPefVSQzsJRsVJBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"191db422eeb1f888a6f4bbb590ef22f6c346a123a696c20ba3241d877424cbae","last_reissued_at":"2026-05-18T00:54:10.756090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:10.756090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Doob-Martin compactification of a Markov chain for growing random words sequentially","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Hye Soo Choi, Steven N. Evans","submitted_at":"2016-05-11T16:57:50Z","abstract_excerpt":"We consider a Markov chain that iteratively generates a sequence of random finite words in such a way that the $n^{\\mathrm{th}}$ word is uniformly distributed over the set of words of length $2n$ in which $n$ letters are $a$ and $n$ letters are $b$: at each step an $a$ and a $b$ are shuffled in uniformly at random among the letters of the current word. We obtain a concrete characterization of the Doob-Martin boundary of this Markov chain. Writing $N(u)$ for the number of letters $a$ (equivalently, $b$) in the finite word $u$, we show that a sequence $(u_n)_{n \\in \\mathbb{N}}$ of finite words c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03512","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":"1605.03512","created_at":"2026-05-18T00:54:10.756173+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03512v2","created_at":"2026-05-18T00:54:10.756173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03512","created_at":"2026-05-18T00:54:10.756173+00:00"},{"alias_kind":"pith_short_12","alias_value":"DEO3IIXOWH4I","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DEO3IIXOWH4IRJXU","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DEO3IIXO","created_at":"2026-05-18T12:30:12.583610+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/DEO3IIXOWH4IRJXUXO2ZB3ZC63","json":"https://pith.science/pith/DEO3IIXOWH4IRJXUXO2ZB3ZC63.json","graph_json":"https://pith.science/api/pith-number/DEO3IIXOWH4IRJXUXO2ZB3ZC63/graph.json","events_json":"https://pith.science/api/pith-number/DEO3IIXOWH4IRJXUXO2ZB3ZC63/events.json","paper":"https://pith.science/paper/DEO3IIXO"},"agent_actions":{"view_html":"https://pith.science/pith/DEO3IIXOWH4IRJXUXO2ZB3ZC63","download_json":"https://pith.science/pith/DEO3IIXOWH4IRJXUXO2ZB3ZC63.json","view_paper":"https://pith.science/paper/DEO3IIXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03512&json=true","fetch_graph":"https://pith.science/api/pith-number/DEO3IIXOWH4IRJXUXO2ZB3ZC63/graph.json","fetch_events":"https://pith.science/api/pith-number/DEO3IIXOWH4IRJXUXO2ZB3ZC63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DEO3IIXOWH4IRJXUXO2ZB3ZC63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DEO3IIXOWH4IRJXUXO2ZB3ZC63/action/storage_attestation","attest_author":"https://pith.science/pith/DEO3IIXOWH4IRJXUXO2ZB3ZC63/action/author_attestation","sign_citation":"https://pith.science/pith/DEO3IIXOWH4IRJXUXO2ZB3ZC63/action/citation_signature","submit_replication":"https://pith.science/pith/DEO3IIXOWH4IRJXUXO2ZB3ZC63/action/replication_record"}},"created_at":"2026-05-18T00:54:10.756173+00:00","updated_at":"2026-05-18T00:54:10.756173+00:00"}