{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DEO3IIXOWH4IRJXUXO2ZB3ZC63","short_pith_number":"pith:DEO3IIXO","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"},"canonical_sha256":"191db422eeb1f888a6f4bbb590ef22f6c346a123a696c20ba3241d877424cbae","source":{"kind":"arxiv","id":"1605.03512","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03512","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03512v2","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03512","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"pith_short_12","alias_value":"DEO3IIXOWH4I","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DEO3IIXOWH4IRJXU","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DEO3IIXO","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DEO3IIXOWH4IRJXUXO2ZB3ZC63","target":"record","payload":{"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"},"canonical_sha256":"191db422eeb1f888a6f4bbb590ef22f6c346a123a696c20ba3241d877424cbae","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"},"source_kind":"arxiv","source_id":"1605.03512","source_version":2,"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-18T00:54:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2mnpX/t9sYU9VtFKRPjTmfO9IbpmLWWK7E5EAQnIlbXcZVk/18UwLvMOOVIhpqW5kBo48hEICiRefz1PxDlIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:42:52.279687Z"},"content_sha256":"ff89a9e76deffde1a4b34fa3bc23f6d54865b805406c684e0b7521b1c12bc34a","schema_version":"1.0","event_id":"sha256:ff89a9e76deffde1a4b34fa3bc23f6d54865b805406c684e0b7521b1c12bc34a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DEO3IIXOWH4IRJXUXO2ZB3ZC63","target":"graph","payload":{"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"},"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-18T00:54:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EAr+L8hRLLWX2i4c/Ie4Pe+/Qhx3swEYG4lA7MsEVBTMtGMDh6/jG0bN20sv07Nci3zfM+giot9qUUF2hDuRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:42:52.280390Z"},"content_sha256":"fab90331ad8534839eced25b8965b926ca2ccd301644e0458bf5be9c3b86ae4f","schema_version":"1.0","event_id":"sha256:fab90331ad8534839eced25b8965b926ca2ccd301644e0458bf5be9c3b86ae4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DEO3IIXOWH4IRJXUXO2ZB3ZC63/bundle.json","state_url":"https://pith.science/pith/DEO3IIXOWH4IRJXUXO2ZB3ZC63/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DEO3IIXOWH4IRJXUXO2ZB3ZC63/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-05-30T00:42:52Z","links":{"resolver":"https://pith.science/pith/DEO3IIXOWH4IRJXUXO2ZB3ZC63","bundle":"https://pith.science/pith/DEO3IIXOWH4IRJXUXO2ZB3ZC63/bundle.json","state":"https://pith.science/pith/DEO3IIXOWH4IRJXUXO2ZB3ZC63/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DEO3IIXOWH4IRJXUXO2ZB3ZC63/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DEO3IIXOWH4IRJXUXO2ZB3ZC63","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":"ebb1cd1fe4c41e42913ef46852a54c7ea3fd318cc74fdb788acb43276c7b93f6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-11T16:57:50Z","title_canon_sha256":"ca4125ce10a0adf27226039967b880dd8f920bf1fcb1f5f15b3616cc9dd0cac9"},"schema_version":"1.0","source":{"id":"1605.03512","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03512","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03512v2","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03512","created_at":"2026-05-18T00:54:10Z"},{"alias_kind":"pith_short_12","alias_value":"DEO3IIXOWH4I","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DEO3IIXOWH4IRJXU","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DEO3IIXO","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:fab90331ad8534839eced25b8965b926ca2ccd301644e0458bf5be9c3b86ae4f","target":"graph","created_at":"2026-05-18T00:54:10Z","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 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","authors_text":"Hye Soo Choi, Steven N. Evans","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-11T16:57:50Z","title":"Doob-Martin compactification of a Markov chain for growing random words sequentially"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03512","kind":"arxiv","version":2},"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:ff89a9e76deffde1a4b34fa3bc23f6d54865b805406c684e0b7521b1c12bc34a","target":"record","created_at":"2026-05-18T00:54:10Z","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":"ebb1cd1fe4c41e42913ef46852a54c7ea3fd318cc74fdb788acb43276c7b93f6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-11T16:57:50Z","title_canon_sha256":"ca4125ce10a0adf27226039967b880dd8f920bf1fcb1f5f15b3616cc9dd0cac9"},"schema_version":"1.0","source":{"id":"1605.03512","kind":"arxiv","version":2}},"canonical_sha256":"191db422eeb1f888a6f4bbb590ef22f6c346a123a696c20ba3241d877424cbae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"191db422eeb1f888a6f4bbb590ef22f6c346a123a696c20ba3241d877424cbae","first_computed_at":"2026-05-18T00:54:10.756090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:10.756090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GCEXhiiIBUiQ13ao6lOfa3IC2S3ehvG+KnohwnuH4HEjyQ2gcAmwOSwPmqfnG7n0AoDs/qPefVSQzsJRsVJBAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:10.756577Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03512","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff89a9e76deffde1a4b34fa3bc23f6d54865b805406c684e0b7521b1c12bc34a","sha256:fab90331ad8534839eced25b8965b926ca2ccd301644e0458bf5be9c3b86ae4f"],"state_sha256":"25b985978423fb76b892329eaefbd6f75f1e82a02d7f76f2865ee339c973b4ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xdEVZyzVEU7NIfXqLmgw84OURH6MEXkgwr89FrCQ8BCFp9q8jK8f73LhfZhBi5cMVhafrZOt/qU2QmEisyXxDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:42:52.284205Z","bundle_sha256":"3b7e37d74e631c48d0e4393443298a2c6ebdad331e2c29f731ff44f4df5d7b81"}}