{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TGGAYFMLNUCQN2ZHEGBCSZIDLT","short_pith_number":"pith:TGGAYFML","schema_version":"1.0","canonical_sha256":"998c0c158b6d0506eb2721822965035cc1bd1ae408b26956a39104235ef0224e","source":{"kind":"arxiv","id":"1212.5771","version":1},"attestation_state":"computed","paper":{"title":"Assembling crystals of type A","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander V. Karzanov, Gleb A. Koshevoy, Vladimir I. Danilov","submitted_at":"2012-12-23T08:12:09Z","abstract_excerpt":"Regular $A_n$-crystals are certain edge-colored directed graphs which are related to representations of the quantized universal enveloping algebra $U_q(\\mathfrak{sl}_{n+1})$. For such a crystal $K$ with colors $1,2,...,n$, we consider its maximal connected subcrystals with colors $1,...,n-1$ and with colors $2,...,n$ and characterize the interlacing structure for all pairs of these subcrystals. This is used to give a recursive description of the combinatorial structure of $K$ and develop an efficient procedure of assembling $K$."},"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":"1212.5771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-23T08:12:09Z","cross_cats_sorted":[],"title_canon_sha256":"3490e9649ef172ecd875e31f84de85b641331a4333a076e40ed52e39644add34","abstract_canon_sha256":"e9dcd28d4d83dfaad7496a9f71fe70735f5fe430b7ded0cdfe9135c528b8164f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:51.417459Z","signature_b64":"ANlvpOGCl+a1Vx0L6/gayxW3qTtPW557CoLqsM3ibxDVmy04ZgD1Eg7wbG8NZ/PKSa7oTS4k0pS+0lJFmtnqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"998c0c158b6d0506eb2721822965035cc1bd1ae408b26956a39104235ef0224e","last_reissued_at":"2026-05-18T03:37:51.416896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:51.416896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Assembling crystals of type A","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander V. Karzanov, Gleb A. Koshevoy, Vladimir I. Danilov","submitted_at":"2012-12-23T08:12:09Z","abstract_excerpt":"Regular $A_n$-crystals are certain edge-colored directed graphs which are related to representations of the quantized universal enveloping algebra $U_q(\\mathfrak{sl}_{n+1})$. For such a crystal $K$ with colors $1,2,...,n$, we consider its maximal connected subcrystals with colors $1,...,n-1$ and with colors $2,...,n$ and characterize the interlacing structure for all pairs of these subcrystals. This is used to give a recursive description of the combinatorial structure of $K$ and develop an efficient procedure of assembling $K$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5771","kind":"arxiv","version":1},"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":"1212.5771","created_at":"2026-05-18T03:37:51.416982+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.5771v1","created_at":"2026-05-18T03:37:51.416982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5771","created_at":"2026-05-18T03:37:51.416982+00:00"},{"alias_kind":"pith_short_12","alias_value":"TGGAYFMLNUCQ","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TGGAYFMLNUCQN2ZH","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TGGAYFML","created_at":"2026-05-18T12:27:23.164592+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/TGGAYFMLNUCQN2ZHEGBCSZIDLT","json":"https://pith.science/pith/TGGAYFMLNUCQN2ZHEGBCSZIDLT.json","graph_json":"https://pith.science/api/pith-number/TGGAYFMLNUCQN2ZHEGBCSZIDLT/graph.json","events_json":"https://pith.science/api/pith-number/TGGAYFMLNUCQN2ZHEGBCSZIDLT/events.json","paper":"https://pith.science/paper/TGGAYFML"},"agent_actions":{"view_html":"https://pith.science/pith/TGGAYFMLNUCQN2ZHEGBCSZIDLT","download_json":"https://pith.science/pith/TGGAYFMLNUCQN2ZHEGBCSZIDLT.json","view_paper":"https://pith.science/paper/TGGAYFML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.5771&json=true","fetch_graph":"https://pith.science/api/pith-number/TGGAYFMLNUCQN2ZHEGBCSZIDLT/graph.json","fetch_events":"https://pith.science/api/pith-number/TGGAYFMLNUCQN2ZHEGBCSZIDLT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TGGAYFMLNUCQN2ZHEGBCSZIDLT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TGGAYFMLNUCQN2ZHEGBCSZIDLT/action/storage_attestation","attest_author":"https://pith.science/pith/TGGAYFMLNUCQN2ZHEGBCSZIDLT/action/author_attestation","sign_citation":"https://pith.science/pith/TGGAYFMLNUCQN2ZHEGBCSZIDLT/action/citation_signature","submit_replication":"https://pith.science/pith/TGGAYFMLNUCQN2ZHEGBCSZIDLT/action/replication_record"}},"created_at":"2026-05-18T03:37:51.416982+00:00","updated_at":"2026-05-18T03:37:51.416982+00:00"}