{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RC3UTCJKCGPUNQUCJG3T33GG3O","short_pith_number":"pith:RC3UTCJK","schema_version":"1.0","canonical_sha256":"88b749892a119f46c28249b73decc6dba31e2d7c3acc869dc76d783cd10d8fe2","source":{"kind":"arxiv","id":"1202.3901","version":2},"attestation_state":"computed","paper":{"title":"Asymptotics of Random Lozenge Tilings via Gelfand-Tsetlin Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.CO","math.MP"],"primary_cat":"math.PR","authors_text":"Leonid Petrov","submitted_at":"2012-02-17T13:05:15Z","abstract_excerpt":"A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m=1,...,N, subject to certain interlacing constraints. We study the ensemble of uniformly random Gelfand-Tsetlin schemes with arbitrary fixed N-th row. We obtain an explicit double contour integral expression for the determinantal correlation kernel of this ensemble (and also of its q-deformation).\n  This provides new tools for asymptotic analysis of uniformly random lozenge tilings of polygons on the triangular lattice; or, equivalently, of random stepped surfaces. We work with a class of polygons which allo"},"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":"1202.3901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-02-17T13:05:15Z","cross_cats_sorted":["math-ph","math.CO","math.MP"],"title_canon_sha256":"e8f648dfb78ec7d7bdc80f8d9b496598ab81339cd982724ed3be255de5cdb114","abstract_canon_sha256":"85602126e14aa848d739e506aa0f56e1aed480e2e9166a14ecc4cf71ff9dc258"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:41.950363Z","signature_b64":"PfmXJ7PEIgmNdlsLszQ0uan84JVuqTFrF533JRa4u9zjmqQCcnGSMbmmAYW8t9nI7HwDUya/PUuSx+zFuGGnDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88b749892a119f46c28249b73decc6dba31e2d7c3acc869dc76d783cd10d8fe2","last_reissued_at":"2026-05-18T03:24:41.949711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:41.949711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotics of Random Lozenge Tilings via Gelfand-Tsetlin Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.CO","math.MP"],"primary_cat":"math.PR","authors_text":"Leonid Petrov","submitted_at":"2012-02-17T13:05:15Z","abstract_excerpt":"A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m=1,...,N, subject to certain interlacing constraints. We study the ensemble of uniformly random Gelfand-Tsetlin schemes with arbitrary fixed N-th row. We obtain an explicit double contour integral expression for the determinantal correlation kernel of this ensemble (and also of its q-deformation).\n  This provides new tools for asymptotic analysis of uniformly random lozenge tilings of polygons on the triangular lattice; or, equivalently, of random stepped surfaces. We work with a class of polygons which allo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3901","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":"1202.3901","created_at":"2026-05-18T03:24:41.949808+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3901v2","created_at":"2026-05-18T03:24:41.949808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3901","created_at":"2026-05-18T03:24:41.949808+00:00"},{"alias_kind":"pith_short_12","alias_value":"RC3UTCJKCGPU","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RC3UTCJKCGPUNQUC","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RC3UTCJK","created_at":"2026-05-18T12:27:20.899486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.09290","citing_title":"Asymptotics of Harish-Chandra transform and infinitesimal freeness","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RC3UTCJKCGPUNQUCJG3T33GG3O","json":"https://pith.science/pith/RC3UTCJKCGPUNQUCJG3T33GG3O.json","graph_json":"https://pith.science/api/pith-number/RC3UTCJKCGPUNQUCJG3T33GG3O/graph.json","events_json":"https://pith.science/api/pith-number/RC3UTCJKCGPUNQUCJG3T33GG3O/events.json","paper":"https://pith.science/paper/RC3UTCJK"},"agent_actions":{"view_html":"https://pith.science/pith/RC3UTCJKCGPUNQUCJG3T33GG3O","download_json":"https://pith.science/pith/RC3UTCJKCGPUNQUCJG3T33GG3O.json","view_paper":"https://pith.science/paper/RC3UTCJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3901&json=true","fetch_graph":"https://pith.science/api/pith-number/RC3UTCJKCGPUNQUCJG3T33GG3O/graph.json","fetch_events":"https://pith.science/api/pith-number/RC3UTCJKCGPUNQUCJG3T33GG3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RC3UTCJKCGPUNQUCJG3T33GG3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RC3UTCJKCGPUNQUCJG3T33GG3O/action/storage_attestation","attest_author":"https://pith.science/pith/RC3UTCJKCGPUNQUCJG3T33GG3O/action/author_attestation","sign_citation":"https://pith.science/pith/RC3UTCJKCGPUNQUCJG3T33GG3O/action/citation_signature","submit_replication":"https://pith.science/pith/RC3UTCJKCGPUNQUCJG3T33GG3O/action/replication_record"}},"created_at":"2026-05-18T03:24:41.949808+00:00","updated_at":"2026-05-18T03:24:41.949808+00:00"}