{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:D5XO2YQ7IL2BPVREI4GLP2NAMB","short_pith_number":"pith:D5XO2YQ7","schema_version":"1.0","canonical_sha256":"1f6eed621f42f417d624470cb7e9a060625efc0a5b1dac672ea69debebbb05c4","source":{"kind":"arxiv","id":"1501.07087","version":2},"attestation_state":"computed","paper":{"title":"Zigzag diagrams and Martin boundary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Pierre Tarrago","submitted_at":"2015-01-28T12:50:22Z","abstract_excerpt":"We investigate the asymptotic behavior of random paths on a graded graph which describes the subword order for words in two letters. This graph, denoted by $\\mathcal{Z}$, has been introduced by Viennot, who also discovered a remarkable bijection between paths on $\\mathcal{Z}$ and sequences of permutations. Later on, Gnedin and Olshanski used this bijection to describe the set of Gibbs measures on this graph. Both authors also conjectured that the Martin boundary of $\\mathcal{Z}$ should coincide with its minimal boundary. We give here a proof of this conjecture by describing the distribution of"},"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":"1501.07087","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-01-28T12:50:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a22d74faf511171ed3b00612bacca7a6026b080304edb0b90158cbaf3378162b","abstract_canon_sha256":"35abb8ada74272cb4145440483218a4f7b1406a0562d2bf6d82b68cab9753920"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:14.940913Z","signature_b64":"pwXdV/1XhUa74EGLo1mgufv/fAnYqNHw3tU+2ZpF3uzpxWEpZKesGWqp7gf9KHIeyaFjuRvTO5flDL3RtJ/RCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f6eed621f42f417d624470cb7e9a060625efc0a5b1dac672ea69debebbb05c4","last_reissued_at":"2026-05-18T00:05:14.940291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:14.940291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zigzag diagrams and Martin boundary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Pierre Tarrago","submitted_at":"2015-01-28T12:50:22Z","abstract_excerpt":"We investigate the asymptotic behavior of random paths on a graded graph which describes the subword order for words in two letters. This graph, denoted by $\\mathcal{Z}$, has been introduced by Viennot, who also discovered a remarkable bijection between paths on $\\mathcal{Z}$ and sequences of permutations. Later on, Gnedin and Olshanski used this bijection to describe the set of Gibbs measures on this graph. Both authors also conjectured that the Martin boundary of $\\mathcal{Z}$ should coincide with its minimal boundary. We give here a proof of this conjecture by describing the distribution of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07087","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":"1501.07087","created_at":"2026-05-18T00:05:14.940389+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07087v2","created_at":"2026-05-18T00:05:14.940389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07087","created_at":"2026-05-18T00:05:14.940389+00:00"},{"alias_kind":"pith_short_12","alias_value":"D5XO2YQ7IL2B","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"D5XO2YQ7IL2BPVRE","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"D5XO2YQ7","created_at":"2026-05-18T12:29:17.054201+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/D5XO2YQ7IL2BPVREI4GLP2NAMB","json":"https://pith.science/pith/D5XO2YQ7IL2BPVREI4GLP2NAMB.json","graph_json":"https://pith.science/api/pith-number/D5XO2YQ7IL2BPVREI4GLP2NAMB/graph.json","events_json":"https://pith.science/api/pith-number/D5XO2YQ7IL2BPVREI4GLP2NAMB/events.json","paper":"https://pith.science/paper/D5XO2YQ7"},"agent_actions":{"view_html":"https://pith.science/pith/D5XO2YQ7IL2BPVREI4GLP2NAMB","download_json":"https://pith.science/pith/D5XO2YQ7IL2BPVREI4GLP2NAMB.json","view_paper":"https://pith.science/paper/D5XO2YQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07087&json=true","fetch_graph":"https://pith.science/api/pith-number/D5XO2YQ7IL2BPVREI4GLP2NAMB/graph.json","fetch_events":"https://pith.science/api/pith-number/D5XO2YQ7IL2BPVREI4GLP2NAMB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D5XO2YQ7IL2BPVREI4GLP2NAMB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D5XO2YQ7IL2BPVREI4GLP2NAMB/action/storage_attestation","attest_author":"https://pith.science/pith/D5XO2YQ7IL2BPVREI4GLP2NAMB/action/author_attestation","sign_citation":"https://pith.science/pith/D5XO2YQ7IL2BPVREI4GLP2NAMB/action/citation_signature","submit_replication":"https://pith.science/pith/D5XO2YQ7IL2BPVREI4GLP2NAMB/action/replication_record"}},"created_at":"2026-05-18T00:05:14.940389+00:00","updated_at":"2026-05-18T00:05:14.940389+00:00"}