{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XVTOIQKZCYSXZMCHMFCOJHQCE7","short_pith_number":"pith:XVTOIQKZ","schema_version":"1.0","canonical_sha256":"bd66e4415916257cb0476144e49e0227f4b482050ecb5e4e222dc1283b4e8ee2","source":{"kind":"arxiv","id":"1110.1324","version":2},"attestation_state":"computed","paper":{"title":"Asymptotics for the Length of the Longest Increasing Subsequence of Binary Markov Random Word","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Christian Houdr\\'e, Trevis J. Litherland","submitted_at":"2011-10-06T16:58:32Z","abstract_excerpt":"Let $(X_n)_{n\\ge 0}$ be an irreducible, aperiodic, and homogeneous binary Markov chain and let $LI_n$ be the length of the longest (weakly) increasing subsequence of $(X_k)_{1\\le k \\le n}$. Using combinatorial constructions and weak invariance principles, we present elementary arguments leading to a new proof that (after proper centering and scaling) the limiting law of $LI_n$ is the maximal eigenvalue of a $2 \\times 2$ Gaussian random matrix. In fact, the limiting shape of the RSK Young diagrams associated with the binary Markov random word is the spectrum of this random matrix."},"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":"1110.1324","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-06T16:58:32Z","cross_cats_sorted":[],"title_canon_sha256":"8919c43ca76c8de141c24c21c66f52f248bd5697e8f7c56d94795d244d9b27c4","abstract_canon_sha256":"63e51a88ab74738245bcc011439362cff501b6dcd14922f44811c184d2336416"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:47:53.691987Z","signature_b64":"m0bPSJ6kzSzId/1aAnXLkcqs1WrtnP3DqZftO60EBwAsQRB9NfS5J3C9C1/l8KZ+t28EB1zoFIgKLOLLNgadAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd66e4415916257cb0476144e49e0227f4b482050ecb5e4e222dc1283b4e8ee2","last_reissued_at":"2026-05-18T03:47:53.691548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:47:53.691548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotics for the Length of the Longest Increasing Subsequence of Binary Markov Random Word","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Christian Houdr\\'e, Trevis J. Litherland","submitted_at":"2011-10-06T16:58:32Z","abstract_excerpt":"Let $(X_n)_{n\\ge 0}$ be an irreducible, aperiodic, and homogeneous binary Markov chain and let $LI_n$ be the length of the longest (weakly) increasing subsequence of $(X_k)_{1\\le k \\le n}$. Using combinatorial constructions and weak invariance principles, we present elementary arguments leading to a new proof that (after proper centering and scaling) the limiting law of $LI_n$ is the maximal eigenvalue of a $2 \\times 2$ Gaussian random matrix. In fact, the limiting shape of the RSK Young diagrams associated with the binary Markov random word is the spectrum of this random matrix."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1324","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":"1110.1324","created_at":"2026-05-18T03:47:53.691618+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.1324v2","created_at":"2026-05-18T03:47:53.691618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1324","created_at":"2026-05-18T03:47:53.691618+00:00"},{"alias_kind":"pith_short_12","alias_value":"XVTOIQKZCYSX","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"XVTOIQKZCYSXZMCH","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"XVTOIQKZ","created_at":"2026-05-18T12:26:47.523578+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/XVTOIQKZCYSXZMCHMFCOJHQCE7","json":"https://pith.science/pith/XVTOIQKZCYSXZMCHMFCOJHQCE7.json","graph_json":"https://pith.science/api/pith-number/XVTOIQKZCYSXZMCHMFCOJHQCE7/graph.json","events_json":"https://pith.science/api/pith-number/XVTOIQKZCYSXZMCHMFCOJHQCE7/events.json","paper":"https://pith.science/paper/XVTOIQKZ"},"agent_actions":{"view_html":"https://pith.science/pith/XVTOIQKZCYSXZMCHMFCOJHQCE7","download_json":"https://pith.science/pith/XVTOIQKZCYSXZMCHMFCOJHQCE7.json","view_paper":"https://pith.science/paper/XVTOIQKZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.1324&json=true","fetch_graph":"https://pith.science/api/pith-number/XVTOIQKZCYSXZMCHMFCOJHQCE7/graph.json","fetch_events":"https://pith.science/api/pith-number/XVTOIQKZCYSXZMCHMFCOJHQCE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XVTOIQKZCYSXZMCHMFCOJHQCE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XVTOIQKZCYSXZMCHMFCOJHQCE7/action/storage_attestation","attest_author":"https://pith.science/pith/XVTOIQKZCYSXZMCHMFCOJHQCE7/action/author_attestation","sign_citation":"https://pith.science/pith/XVTOIQKZCYSXZMCHMFCOJHQCE7/action/citation_signature","submit_replication":"https://pith.science/pith/XVTOIQKZCYSXZMCHMFCOJHQCE7/action/replication_record"}},"created_at":"2026-05-18T03:47:53.691618+00:00","updated_at":"2026-05-18T03:47:53.691618+00:00"}