{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:Z2EPETYPS32IWG4N534YN7ZIE6","short_pith_number":"pith:Z2EPETYP","schema_version":"1.0","canonical_sha256":"ce88f24f0f96f48b1b8deef986ff282783cdcc2a5938282535b5a7e9ce1cbe34","source":{"kind":"arxiv","id":"0804.3071","version":2},"attestation_state":"computed","paper":{"title":"Shuffling algorithm for boxed plane partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.PR"],"primary_cat":"math.CO","authors_text":"Alexei Borodin, Vadim Gorin","submitted_at":"2008-04-18T17:17:46Z","abstract_excerpt":"We introduce discrete time Markov chains that preserve uniform measures on boxed plane partitions. Elementary Markov steps change the size of the box from (a x b x c) to ((a-1) x (b+1) x c) or ((a+1) x (b-1) x c). Algorithmic realization of each step involves O((a+b)c) operations. One application is an efficient perfect random sampling algorithm for uniformly distributed boxed plane partitions.\n  Trajectories of our Markov chains can be viewed as random point configurations in the three-dimensional lattice. We compute the bulk limits of the correlation functions of the resulting random point p"},"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":"0804.3071","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-04-18T17:17:46Z","cross_cats_sorted":["math-ph","math.MP","math.PR"],"title_canon_sha256":"09ee483bbc00379406b65a1b4d58fd5350c12ff61c42de1bb5d085a63b1f8f11","abstract_canon_sha256":"95d0e8e5b873e487d45e021af57fe08771add536620593e8006aac2a1a6cf613"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:17.272658Z","signature_b64":"xsNaZ/V4/+v682nj+U15Myr/34Enii+fW94aIAjx0C2HrKYAU//0hzvxFbCvu198qK3AGbKMGQbQaNvkFRIFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce88f24f0f96f48b1b8deef986ff282783cdcc2a5938282535b5a7e9ce1cbe34","last_reissued_at":"2026-05-18T04:15:17.271961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:17.271961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shuffling algorithm for boxed plane partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.PR"],"primary_cat":"math.CO","authors_text":"Alexei Borodin, Vadim Gorin","submitted_at":"2008-04-18T17:17:46Z","abstract_excerpt":"We introduce discrete time Markov chains that preserve uniform measures on boxed plane partitions. Elementary Markov steps change the size of the box from (a x b x c) to ((a-1) x (b+1) x c) or ((a+1) x (b-1) x c). Algorithmic realization of each step involves O((a+b)c) operations. One application is an efficient perfect random sampling algorithm for uniformly distributed boxed plane partitions.\n  Trajectories of our Markov chains can be viewed as random point configurations in the three-dimensional lattice. We compute the bulk limits of the correlation functions of the resulting random point p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.3071","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":"0804.3071","created_at":"2026-05-18T04:15:17.272088+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.3071v2","created_at":"2026-05-18T04:15:17.272088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.3071","created_at":"2026-05-18T04:15:17.272088+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2EPETYPS32I","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2EPETYPS32IWG4N","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2EPETYP","created_at":"2026-05-18T12:25:58.018023+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/Z2EPETYPS32IWG4N534YN7ZIE6","json":"https://pith.science/pith/Z2EPETYPS32IWG4N534YN7ZIE6.json","graph_json":"https://pith.science/api/pith-number/Z2EPETYPS32IWG4N534YN7ZIE6/graph.json","events_json":"https://pith.science/api/pith-number/Z2EPETYPS32IWG4N534YN7ZIE6/events.json","paper":"https://pith.science/paper/Z2EPETYP"},"agent_actions":{"view_html":"https://pith.science/pith/Z2EPETYPS32IWG4N534YN7ZIE6","download_json":"https://pith.science/pith/Z2EPETYPS32IWG4N534YN7ZIE6.json","view_paper":"https://pith.science/paper/Z2EPETYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.3071&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2EPETYPS32IWG4N534YN7ZIE6/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2EPETYPS32IWG4N534YN7ZIE6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2EPETYPS32IWG4N534YN7ZIE6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2EPETYPS32IWG4N534YN7ZIE6/action/storage_attestation","attest_author":"https://pith.science/pith/Z2EPETYPS32IWG4N534YN7ZIE6/action/author_attestation","sign_citation":"https://pith.science/pith/Z2EPETYPS32IWG4N534YN7ZIE6/action/citation_signature","submit_replication":"https://pith.science/pith/Z2EPETYPS32IWG4N534YN7ZIE6/action/replication_record"}},"created_at":"2026-05-18T04:15:17.272088+00:00","updated_at":"2026-05-18T04:15:17.272088+00:00"}