{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QGGHTBYIWAIVTGWSWTMYNSB7S4","short_pith_number":"pith:QGGHTBYI","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"},"canonical_sha256":"818c798708b011599ad2b4d986c83f9735869596fae0d29e9e47ffd0db38aa5a","source":{"kind":"arxiv","id":"1111.2652","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.2652","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"arxiv_version","alias_value":"1111.2652v3","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2652","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"pith_short_12","alias_value":"QGGHTBYIWAIV","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QGGHTBYIWAIVTGWS","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QGGHTBYI","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QGGHTBYIWAIVTGWSWTMYNSB7S4","target":"record","payload":{"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"},"canonical_sha256":"818c798708b011599ad2b4d986c83f9735869596fae0d29e9e47ffd0db38aa5a","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"},"source_kind":"arxiv","source_id":"1111.2652","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:38:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ttuQEww5swv6g7l78M5eOH1kum8j0OsV2T2h6g8a9MvLzobYETQXPKKCd4lbkOGZ0MExz1QW9bA45kfKiJ/OAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T18:00:31.498805Z"},"content_sha256":"5dccbd2deb40f8370ac1c490e396bd8dd76f97aee941728f0ebae37d8fe1feee","schema_version":"1.0","event_id":"sha256:5dccbd2deb40f8370ac1c490e396bd8dd76f97aee941728f0ebae37d8fe1feee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QGGHTBYIWAIVTGWSWTMYNSB7S4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:38:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MNEsvVnLfvYr5byQWmxAECmv2f1AEg0MVZzxHAqDULsfG/Nh7kPxukQOVoPpBhY46eNkOzyi7O8i5i3WBd0GDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T18:00:31.499281Z"},"content_sha256":"51d709e2cced9fc970ce9c7227161fb7e7d80ba7a018fcc27c0b6fc47612e80c","schema_version":"1.0","event_id":"sha256:51d709e2cced9fc970ce9c7227161fb7e7d80ba7a018fcc27c0b6fc47612e80c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QGGHTBYIWAIVTGWSWTMYNSB7S4/bundle.json","state_url":"https://pith.science/pith/QGGHTBYIWAIVTGWSWTMYNSB7S4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QGGHTBYIWAIVTGWSWTMYNSB7S4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T18:00:31Z","links":{"resolver":"https://pith.science/pith/QGGHTBYIWAIVTGWSWTMYNSB7S4","bundle":"https://pith.science/pith/QGGHTBYIWAIVTGWSWTMYNSB7S4/bundle.json","state":"https://pith.science/pith/QGGHTBYIWAIVTGWSWTMYNSB7S4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QGGHTBYIWAIVTGWSWTMYNSB7S4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QGGHTBYIWAIVTGWSWTMYNSB7S4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"373e0d6623a92d272993496d9b0b4e113bb999e92d83789414cbf01aa0414dee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-11T03:00:13Z","title_canon_sha256":"9976fe02bbd17a112154d3eb7a32a856f5d58a01319181071295d90c2d3fb3e3"},"schema_version":"1.0","source":{"id":"1111.2652","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.2652","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"arxiv_version","alias_value":"1111.2652v3","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2652","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"pith_short_12","alias_value":"QGGHTBYIWAIV","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QGGHTBYIWAIVTGWS","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QGGHTBYI","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:51d709e2cced9fc970ce9c7227161fb7e7d80ba7a018fcc27c0b6fc47612e80c","target":"graph","created_at":"2026-05-18T02:38:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"David E Speyer, Nathan Reading","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-11T03:00:13Z","title":"Combinatorial frameworks for cluster algebras"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2652","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5dccbd2deb40f8370ac1c490e396bd8dd76f97aee941728f0ebae37d8fe1feee","target":"record","created_at":"2026-05-18T02:38:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"373e0d6623a92d272993496d9b0b4e113bb999e92d83789414cbf01aa0414dee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-11T03:00:13Z","title_canon_sha256":"9976fe02bbd17a112154d3eb7a32a856f5d58a01319181071295d90c2d3fb3e3"},"schema_version":"1.0","source":{"id":"1111.2652","kind":"arxiv","version":3}},"canonical_sha256":"818c798708b011599ad2b4d986c83f9735869596fae0d29e9e47ffd0db38aa5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"818c798708b011599ad2b4d986c83f9735869596fae0d29e9e47ffd0db38aa5a","first_computed_at":"2026-05-18T02:38:53.371812Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:53.371812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hfHkrgyMrDVhD5eimmykJ4OFuKYMLHOHL9hhGJ51h3T7Nl9vd3MuzQM9IS6R1UnsmTVDKkBSeXKOErrDD8aMCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:53.372197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.2652","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5dccbd2deb40f8370ac1c490e396bd8dd76f97aee941728f0ebae37d8fe1feee","sha256:51d709e2cced9fc970ce9c7227161fb7e7d80ba7a018fcc27c0b6fc47612e80c"],"state_sha256":"60781aa926319ad5257bdf91c5211bd4d3d8dacbb44bd2b0b9f7c2b3b2931336"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0K69beF363ja7sslthBOXgvvlQo1f5T/sSqjJs2QB2Wdb+D5QnPctAENtHFKUUcEWoBN+RWn+cTnZJDFZilsCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T18:00:31.503254Z","bundle_sha256":"59d257ad376202533689dacd6def7053cb3372773a397e98b119dbd81a12bb64"}}