{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QGGHTBYIWAIVTGWSWTMYNSB7S4","short_pith_number":"pith:QGGHTBYI","schema_version":"1.0","canonical_sha256":"818c798708b011599ad2b4d986c83f9735869596fae0d29e9e47ffd0db38aa5a","source":{"kind":"arxiv","id":"1111.2652","version":3},"attestation_state":"computed","paper":{"title":"Combinatorial frameworks for cluster algebras","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David E Speyer, Nathan Reading","submitted_at":"2011-11-11T03:00:13Z","abstract_excerpt":"We develop a general approach to finding combinatorial models for cluster algebras. The approach is to construct a labeled graph called a framework. When a framework is constructed with certain properties, the result is a model incorporating information about exchange matrices, principal coefficients, g-vectors, and g-vector fans. The idea behind frameworks arises from Cambrian combinatorics and sortable elements, and in this paper, we use sortable elements to construct a framework for any cluster algebra with an acyclic initial exchange matrix. This Cambrian framework yields a model of the en"},"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":"1111.2652","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-11T03:00:13Z","cross_cats_sorted":[],"title_canon_sha256":"9976fe02bbd17a112154d3eb7a32a856f5d58a01319181071295d90c2d3fb3e3","abstract_canon_sha256":"373e0d6623a92d272993496d9b0b4e113bb999e92d83789414cbf01aa0414dee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:53.372197Z","signature_b64":"hfHkrgyMrDVhD5eimmykJ4OFuKYMLHOHL9hhGJ51h3T7Nl9vd3MuzQM9IS6R1UnsmTVDKkBSeXKOErrDD8aMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"818c798708b011599ad2b4d986c83f9735869596fae0d29e9e47ffd0db38aa5a","last_reissued_at":"2026-05-18T02:38:53.371812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:53.371812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial frameworks for cluster algebras","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David E Speyer, Nathan Reading","submitted_at":"2011-11-11T03:00:13Z","abstract_excerpt":"We develop a general approach to finding combinatorial models for cluster algebras. The approach is to construct a labeled graph called a framework. When a framework is constructed with certain properties, the result is a model incorporating information about exchange matrices, principal coefficients, g-vectors, and g-vector fans. The idea behind frameworks arises from Cambrian combinatorics and sortable elements, and in this paper, we use sortable elements to construct a framework for any cluster algebra with an acyclic initial exchange matrix. This Cambrian framework yields a model of the en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2652","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":"1111.2652","created_at":"2026-05-18T02:38:53.371874+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.2652v3","created_at":"2026-05-18T02:38:53.371874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2652","created_at":"2026-05-18T02:38:53.371874+00:00"},{"alias_kind":"pith_short_12","alias_value":"QGGHTBYIWAIV","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QGGHTBYIWAIVTGWS","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QGGHTBYI","created_at":"2026-05-18T12:26:39.201973+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.16283","citing_title":"Local and global patterns of rank 3 $G$-fans of totally-infinite type","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QGGHTBYIWAIVTGWSWTMYNSB7S4","json":"https://pith.science/pith/QGGHTBYIWAIVTGWSWTMYNSB7S4.json","graph_json":"https://pith.science/api/pith-number/QGGHTBYIWAIVTGWSWTMYNSB7S4/graph.json","events_json":"https://pith.science/api/pith-number/QGGHTBYIWAIVTGWSWTMYNSB7S4/events.json","paper":"https://pith.science/paper/QGGHTBYI"},"agent_actions":{"view_html":"https://pith.science/pith/QGGHTBYIWAIVTGWSWTMYNSB7S4","download_json":"https://pith.science/pith/QGGHTBYIWAIVTGWSWTMYNSB7S4.json","view_paper":"https://pith.science/paper/QGGHTBYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.2652&json=true","fetch_graph":"https://pith.science/api/pith-number/QGGHTBYIWAIVTGWSWTMYNSB7S4/graph.json","fetch_events":"https://pith.science/api/pith-number/QGGHTBYIWAIVTGWSWTMYNSB7S4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QGGHTBYIWAIVTGWSWTMYNSB7S4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QGGHTBYIWAIVTGWSWTMYNSB7S4/action/storage_attestation","attest_author":"https://pith.science/pith/QGGHTBYIWAIVTGWSWTMYNSB7S4/action/author_attestation","sign_citation":"https://pith.science/pith/QGGHTBYIWAIVTGWSWTMYNSB7S4/action/citation_signature","submit_replication":"https://pith.science/pith/QGGHTBYIWAIVTGWSWTMYNSB7S4/action/replication_record"}},"created_at":"2026-05-18T02:38:53.371874+00:00","updated_at":"2026-05-18T02:38:53.371874+00:00"}