{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DS3IYQ232FHPWOY6DTZDBB42ZW","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":"20dee0f79e18199022fc0675c9bafb5138c0345f93b85d6c97615875dfb0ba33","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-08T09:51:24Z","title_canon_sha256":"c8c37c0c60d503b64fe33c7642286f2e0c7ab27b74a17687208cddeb9e85ce08"},"schema_version":"1.0","source":{"id":"1307.2006","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2006","created_at":"2026-05-18T02:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2006v3","created_at":"2026-05-18T02:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2006","created_at":"2026-05-18T02:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"DS3IYQ232FHP","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DS3IYQ232FHPWOY6","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DS3IYQ23","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:031185bee63019946987152fbf6b786242a0a8397bd7559880f8ec1f2119d162","target":"graph","created_at":"2026-05-18T02:32:00Z","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":"In this article, we describe an algorithm to determine whether a permutation class C given by a finite basis B of excluded patterns contains a finite number of simple permutations. This is a continuation of the work initiated in [Brignall, Ruskuc, Vatter, Simple permutations: decidability and unavoidable substructures, 2008], and shares several aspects with it. Like in this article, the main difficulty is to decide whether C contains a finite number of proper pin-permutations, and this decision problem is solved using automata theory. Moreover, we use an encoding of proper pin-permutations by ","authors_text":"Adeline Pierrot, Dominique Rossin, Fr\\'ed\\'erique Bassino, Mathilde Bouvel","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-08T09:51:24Z","title":"An algorithm for deciding the finiteness of the number of simple permutations in permutation classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2006","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:2fc587ef594944e6b3119a7e8f1c6bc021cb06daddc40125434617a6684e1114","target":"record","created_at":"2026-05-18T02:32:00Z","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":"20dee0f79e18199022fc0675c9bafb5138c0345f93b85d6c97615875dfb0ba33","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-08T09:51:24Z","title_canon_sha256":"c8c37c0c60d503b64fe33c7642286f2e0c7ab27b74a17687208cddeb9e85ce08"},"schema_version":"1.0","source":{"id":"1307.2006","kind":"arxiv","version":3}},"canonical_sha256":"1cb68c435bd14efb3b1e1cf230879acdae56f6519b62047bb15ebb5c967acee3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cb68c435bd14efb3b1e1cf230879acdae56f6519b62047bb15ebb5c967acee3","first_computed_at":"2026-05-18T02:32:00.356139Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:00.356139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2wRdB5Ok3wbb+vMDJQqso4df7yNXajQtF/yTga1k3JWpLx0gi1wu9FWFppoQFJW8+Du8SzfSdQrfKCHMrBNYDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:00.356609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.2006","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fc587ef594944e6b3119a7e8f1c6bc021cb06daddc40125434617a6684e1114","sha256:031185bee63019946987152fbf6b786242a0a8397bd7559880f8ec1f2119d162"],"state_sha256":"1399ad14998d24d934340130a2f6d0ceca0180d39518ca9f3823240c05ba8baf"}