{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:S5GC2ADKNJ35EER64EEDAPESBU","short_pith_number":"pith:S5GC2ADK","schema_version":"1.0","canonical_sha256":"974c2d006a6a77d2123ee108303c920d25677b14a412057836a2b37e9ef70714","source":{"kind":"arxiv","id":"0804.0787","version":1},"attestation_state":"computed","paper":{"title":"New Graphs of Finite Mutation Type","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Harm Derksen, Theodore Owen","submitted_at":"2008-04-04T17:33:17Z","abstract_excerpt":"To a directed graph without loops and 2-cycles, we can associate a skew-symmetric matrix with integer entries. Mutations of such skew-symmetric matrices, and more generally skew-symmetrizable matrices, have been defined in the context of cluster algebras by Fomin and Zelevinsky. The mutation class of a graph G is the set of all isomorphism classes of graphs that can be obtained from G by a sequence of mutations. A graph is called mutation-finite if its mutation class is finite. Fomin, Shapiro and Thurston constructed mutation-finite graphs from triangulations of oriented bordered surfaces with"},"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.0787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-04-04T17:33:17Z","cross_cats_sorted":[],"title_canon_sha256":"6a56fca64cedce33e9e89822280b3cbca8f8e634258c34e6de3a70e88af790a1","abstract_canon_sha256":"b57de5572a868cfca1b357c97b77aebde264b3d2dcd539380c0728fc9488f541"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:10:38.786945Z","signature_b64":"sE5bE996U/WOYiobUWpaugu1t/zBb3EGVTsDdC3A+Z10Ftid+84SOi7VW5dvMZv6UrLL9MpQMYHUIXc8oAk1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"974c2d006a6a77d2123ee108303c920d25677b14a412057836a2b37e9ef70714","last_reissued_at":"2026-07-04T15:10:38.786050Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:10:38.786050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Graphs of Finite Mutation Type","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Harm Derksen, Theodore Owen","submitted_at":"2008-04-04T17:33:17Z","abstract_excerpt":"To a directed graph without loops and 2-cycles, we can associate a skew-symmetric matrix with integer entries. Mutations of such skew-symmetric matrices, and more generally skew-symmetrizable matrices, have been defined in the context of cluster algebras by Fomin and Zelevinsky. The mutation class of a graph G is the set of all isomorphism classes of graphs that can be obtained from G by a sequence of mutations. A graph is called mutation-finite if its mutation class is finite. Fomin, Shapiro and Thurston constructed mutation-finite graphs from triangulations of oriented bordered surfaces with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.0787","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0804.0787/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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.0787","created_at":"2026-07-04T15:10:38.786118+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.0787v1","created_at":"2026-07-04T15:10:38.786118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.0787","created_at":"2026-07-04T15:10:38.786118+00:00"},{"alias_kind":"pith_short_12","alias_value":"S5GC2ADKNJ35","created_at":"2026-07-04T15:10:38.786118+00:00"},{"alias_kind":"pith_short_16","alias_value":"S5GC2ADKNJ35EER6","created_at":"2026-07-04T15:10:38.786118+00:00"},{"alias_kind":"pith_short_8","alias_value":"S5GC2ADK","created_at":"2026-07-04T15:10:38.786118+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.14863","citing_title":"BPS spectroscopy with reinforcement learning","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S5GC2ADKNJ35EER64EEDAPESBU","json":"https://pith.science/pith/S5GC2ADKNJ35EER64EEDAPESBU.json","graph_json":"https://pith.science/api/pith-number/S5GC2ADKNJ35EER64EEDAPESBU/graph.json","events_json":"https://pith.science/api/pith-number/S5GC2ADKNJ35EER64EEDAPESBU/events.json","paper":"https://pith.science/paper/S5GC2ADK"},"agent_actions":{"view_html":"https://pith.science/pith/S5GC2ADKNJ35EER64EEDAPESBU","download_json":"https://pith.science/pith/S5GC2ADKNJ35EER64EEDAPESBU.json","view_paper":"https://pith.science/paper/S5GC2ADK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.0787&json=true","fetch_graph":"https://pith.science/api/pith-number/S5GC2ADKNJ35EER64EEDAPESBU/graph.json","fetch_events":"https://pith.science/api/pith-number/S5GC2ADKNJ35EER64EEDAPESBU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S5GC2ADKNJ35EER64EEDAPESBU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S5GC2ADKNJ35EER64EEDAPESBU/action/storage_attestation","attest_author":"https://pith.science/pith/S5GC2ADKNJ35EER64EEDAPESBU/action/author_attestation","sign_citation":"https://pith.science/pith/S5GC2ADKNJ35EER64EEDAPESBU/action/citation_signature","submit_replication":"https://pith.science/pith/S5GC2ADKNJ35EER64EEDAPESBU/action/replication_record"}},"created_at":"2026-07-04T15:10:38.786118+00:00","updated_at":"2026-07-04T15:10:38.786118+00:00"}