{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:B2W3KGDPF64XWA5YTAU37FOR75","short_pith_number":"pith:B2W3KGDP","schema_version":"1.0","canonical_sha256":"0eadb5186f2fb97b03b89829bf95d1ff62a95eaf87d92f7a501cd39f59d99ea4","source":{"kind":"arxiv","id":"1002.3866","version":3},"attestation_state":"computed","paper":{"title":"Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Adeline Pierrot (LIAFA), Dominique Rossin (LIX), Fr\\'ed\\'erique Bassino (LIPN), Mathilde Bouvel (LIAFA)","submitted_at":"2010-02-20T10:53:57Z","abstract_excerpt":"We present an algorithm running in time O(n ln n) which decides if a wreath-closed permutation class Av(B) given by its finite basis B contains a finite number of simple permutations. The method we use is based on an article of Brignall, Ruskuc and Vatter which presents a decision procedure (of high complexity) for solving this question, without the assumption that Av(B) is wreath-closed. Using combinatorial, algorithmic and language theoretic arguments together with one of our previous results on pin-permutations, we are able to transform the problem into a co-finiteness problem in a complete"},"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":"1002.3866","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-02-20T10:53:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"54406cb24014923aa408f048146abebb37038345999a9de3dcfc3713ee7e50c4","abstract_canon_sha256":"7455e8c482d6b28d8821fa0485b8615fc221ae1d44421181392b06161b44201a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:37.889406Z","signature_b64":"Ocoqm87qpEZYfuZs8lUkva+JpXxom0kD/d0FZNIdo4V/+WWlslLepEwGQ6dfXye2OQXKZPts82gNiSHtX8LaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0eadb5186f2fb97b03b89829bf95d1ff62a95eaf87d92f7a501cd39f59d99ea4","last_reissued_at":"2026-05-18T04:25:37.888979Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:37.888979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Adeline Pierrot (LIAFA), Dominique Rossin (LIX), Fr\\'ed\\'erique Bassino (LIPN), Mathilde Bouvel (LIAFA)","submitted_at":"2010-02-20T10:53:57Z","abstract_excerpt":"We present an algorithm running in time O(n ln n) which decides if a wreath-closed permutation class Av(B) given by its finite basis B contains a finite number of simple permutations. The method we use is based on an article of Brignall, Ruskuc and Vatter which presents a decision procedure (of high complexity) for solving this question, without the assumption that Av(B) is wreath-closed. Using combinatorial, algorithmic and language theoretic arguments together with one of our previous results on pin-permutations, we are able to transform the problem into a co-finiteness problem in a complete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.3866","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":"1002.3866","created_at":"2026-05-18T04:25:37.889038+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.3866v3","created_at":"2026-05-18T04:25:37.889038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.3866","created_at":"2026-05-18T04:25:37.889038+00:00"},{"alias_kind":"pith_short_12","alias_value":"B2W3KGDPF64X","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"B2W3KGDPF64XWA5Y","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"B2W3KGDP","created_at":"2026-05-18T12:26:05.355336+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/B2W3KGDPF64XWA5YTAU37FOR75","json":"https://pith.science/pith/B2W3KGDPF64XWA5YTAU37FOR75.json","graph_json":"https://pith.science/api/pith-number/B2W3KGDPF64XWA5YTAU37FOR75/graph.json","events_json":"https://pith.science/api/pith-number/B2W3KGDPF64XWA5YTAU37FOR75/events.json","paper":"https://pith.science/paper/B2W3KGDP"},"agent_actions":{"view_html":"https://pith.science/pith/B2W3KGDPF64XWA5YTAU37FOR75","download_json":"https://pith.science/pith/B2W3KGDPF64XWA5YTAU37FOR75.json","view_paper":"https://pith.science/paper/B2W3KGDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.3866&json=true","fetch_graph":"https://pith.science/api/pith-number/B2W3KGDPF64XWA5YTAU37FOR75/graph.json","fetch_events":"https://pith.science/api/pith-number/B2W3KGDPF64XWA5YTAU37FOR75/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B2W3KGDPF64XWA5YTAU37FOR75/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B2W3KGDPF64XWA5YTAU37FOR75/action/storage_attestation","attest_author":"https://pith.science/pith/B2W3KGDPF64XWA5YTAU37FOR75/action/author_attestation","sign_citation":"https://pith.science/pith/B2W3KGDPF64XWA5YTAU37FOR75/action/citation_signature","submit_replication":"https://pith.science/pith/B2W3KGDPF64XWA5YTAU37FOR75/action/replication_record"}},"created_at":"2026-05-18T04:25:37.889038+00:00","updated_at":"2026-05-18T04:25:37.889038+00:00"}