{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IP5RM3KAGFCD6O26O6MSNZLLGS","short_pith_number":"pith:IP5RM3KA","schema_version":"1.0","canonical_sha256":"43fb166d4031443f3b5e779926e56b34a25bc09bbf1f8dc80113cc06140bb48e","source":{"kind":"arxiv","id":"1407.3764","version":3},"attestation_state":"computed","paper":{"title":"Perfect sampling algorithm for Schur processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.DM","math.CO"],"primary_cat":"math.PR","authors_text":"C\\'edric Boutillier, Dan Betea, Guillaume Chapuy, J\\'er\\'emie Bouttier, Mirjana Vuleti\\'c, Sylvie Corteel","submitted_at":"2014-07-14T18:54:41Z","abstract_excerpt":"We describe random generation algorithms for a large class of random combinatorial objects called Schur processes, which are sequences of random (integer) partitions subject to certain interlacing conditions. This class contains several fundamental combinatorial objects as special cases, such as plane partitions, tilings of Aztec diamonds, pyramid partitions and more generally steep domino tilings of the plane. Our algorithm, which is of polynomial complexity, is both exact (i.e. the output follows exactly the target probability law, which is either Boltzmann or uniform in our case), and entro"},"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":"1407.3764","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-07-14T18:54:41Z","cross_cats_sorted":["cond-mat.stat-mech","cs.DM","math.CO"],"title_canon_sha256":"e6f45abc853d210ea0fbc2b64f88b1721ec87b07dd01d7a5ea9483481676a473","abstract_canon_sha256":"37a3cbda2d69e8995520a6c1121ba2c199d14eef2cc36bd610e78ef614470cb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:44.253562Z","signature_b64":"5WEEWPw67YuHDmk8nUlvz+tTcQbk1XnTGyE0Zgo2Mkjguj3wjMGX+tX+ZrGShg2GCThJforWqgq/bMcG/Ub+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43fb166d4031443f3b5e779926e56b34a25bc09bbf1f8dc80113cc06140bb48e","last_reissued_at":"2026-05-18T00:06:44.253206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:44.253206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect sampling algorithm for Schur processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.DM","math.CO"],"primary_cat":"math.PR","authors_text":"C\\'edric Boutillier, Dan Betea, Guillaume Chapuy, J\\'er\\'emie Bouttier, Mirjana Vuleti\\'c, Sylvie Corteel","submitted_at":"2014-07-14T18:54:41Z","abstract_excerpt":"We describe random generation algorithms for a large class of random combinatorial objects called Schur processes, which are sequences of random (integer) partitions subject to certain interlacing conditions. This class contains several fundamental combinatorial objects as special cases, such as plane partitions, tilings of Aztec diamonds, pyramid partitions and more generally steep domino tilings of the plane. Our algorithm, which is of polynomial complexity, is both exact (i.e. the output follows exactly the target probability law, which is either Boltzmann or uniform in our case), and entro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3764","kind":"arxiv","version":3},"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":"1407.3764","created_at":"2026-05-18T00:06:44.253262+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.3764v3","created_at":"2026-05-18T00:06:44.253262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3764","created_at":"2026-05-18T00:06:44.253262+00:00"},{"alias_kind":"pith_short_12","alias_value":"IP5RM3KAGFCD","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IP5RM3KAGFCD6O26","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IP5RM3KA","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/IP5RM3KAGFCD6O26O6MSNZLLGS","json":"https://pith.science/pith/IP5RM3KAGFCD6O26O6MSNZLLGS.json","graph_json":"https://pith.science/api/pith-number/IP5RM3KAGFCD6O26O6MSNZLLGS/graph.json","events_json":"https://pith.science/api/pith-number/IP5RM3KAGFCD6O26O6MSNZLLGS/events.json","paper":"https://pith.science/paper/IP5RM3KA"},"agent_actions":{"view_html":"https://pith.science/pith/IP5RM3KAGFCD6O26O6MSNZLLGS","download_json":"https://pith.science/pith/IP5RM3KAGFCD6O26O6MSNZLLGS.json","view_paper":"https://pith.science/paper/IP5RM3KA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.3764&json=true","fetch_graph":"https://pith.science/api/pith-number/IP5RM3KAGFCD6O26O6MSNZLLGS/graph.json","fetch_events":"https://pith.science/api/pith-number/IP5RM3KAGFCD6O26O6MSNZLLGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IP5RM3KAGFCD6O26O6MSNZLLGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IP5RM3KAGFCD6O26O6MSNZLLGS/action/storage_attestation","attest_author":"https://pith.science/pith/IP5RM3KAGFCD6O26O6MSNZLLGS/action/author_attestation","sign_citation":"https://pith.science/pith/IP5RM3KAGFCD6O26O6MSNZLLGS/action/citation_signature","submit_replication":"https://pith.science/pith/IP5RM3KAGFCD6O26O6MSNZLLGS/action/replication_record"}},"created_at":"2026-05-18T00:06:44.253262+00:00","updated_at":"2026-05-18T00:06:44.253262+00:00"}