{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3QX5GEVB6TPCGLFOSSTV63PKCO","short_pith_number":"pith:3QX5GEVB","schema_version":"1.0","canonical_sha256":"dc2fd312a1f4de232cae94a75f6dea13a5e0a3a8b48b04c87a94f2cac4e6aa65","source":{"kind":"arxiv","id":"1705.04109","version":1},"attestation_state":"computed","paper":{"title":"Automatic discovery of structural rules of permutation classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bjarki Gudmundsson, Christian Bean, Henning Ulfarsson","submitted_at":"2017-05-11T11:05:13Z","abstract_excerpt":"We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of \"rules\"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an enumeration. The algorithm is successful on different inputs than other algorithms and can succeed with any polynomial permutation class. We apply it to every non-polynomial permutation class avoiding a set of length four patterns. The structures found by the algorithm can sometimes allow an enumeration of the permutation class with respect to permutation statistics"},"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":"1705.04109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-11T11:05:13Z","cross_cats_sorted":[],"title_canon_sha256":"fc0b4ab6fd7294797d02d112188e4f4b4380ac740b22b9ee7ffb62b0876190bc","abstract_canon_sha256":"be0ef0e3f1142f1e9cee2780e292cfb12c0aab62a37ea939af9b970e790f6233"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:41.406559Z","signature_b64":"SI+VSD2qAQicK69nMqKN2D9N3iC8YNeCYUf0vr/uhaXpmX4xj9CSKAz4aMgiQ9Ba9zSZYyde63+I96BvI0fcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc2fd312a1f4de232cae94a75f6dea13a5e0a3a8b48b04c87a94f2cac4e6aa65","last_reissued_at":"2026-05-18T00:44:41.406058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:41.406058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic discovery of structural rules of permutation classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bjarki Gudmundsson, Christian Bean, Henning Ulfarsson","submitted_at":"2017-05-11T11:05:13Z","abstract_excerpt":"We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of \"rules\"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an enumeration. The algorithm is successful on different inputs than other algorithms and can succeed with any polynomial permutation class. We apply it to every non-polynomial permutation class avoiding a set of length four patterns. The structures found by the algorithm can sometimes allow an enumeration of the permutation class with respect to permutation statistics"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04109","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":""},"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":"1705.04109","created_at":"2026-05-18T00:44:41.406126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.04109v1","created_at":"2026-05-18T00:44:41.406126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04109","created_at":"2026-05-18T00:44:41.406126+00:00"},{"alias_kind":"pith_short_12","alias_value":"3QX5GEVB6TPC","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3QX5GEVB6TPCGLFO","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3QX5GEVB","created_at":"2026-05-18T12:30:58.224056+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/3QX5GEVB6TPCGLFOSSTV63PKCO","json":"https://pith.science/pith/3QX5GEVB6TPCGLFOSSTV63PKCO.json","graph_json":"https://pith.science/api/pith-number/3QX5GEVB6TPCGLFOSSTV63PKCO/graph.json","events_json":"https://pith.science/api/pith-number/3QX5GEVB6TPCGLFOSSTV63PKCO/events.json","paper":"https://pith.science/paper/3QX5GEVB"},"agent_actions":{"view_html":"https://pith.science/pith/3QX5GEVB6TPCGLFOSSTV63PKCO","download_json":"https://pith.science/pith/3QX5GEVB6TPCGLFOSSTV63PKCO.json","view_paper":"https://pith.science/paper/3QX5GEVB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.04109&json=true","fetch_graph":"https://pith.science/api/pith-number/3QX5GEVB6TPCGLFOSSTV63PKCO/graph.json","fetch_events":"https://pith.science/api/pith-number/3QX5GEVB6TPCGLFOSSTV63PKCO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3QX5GEVB6TPCGLFOSSTV63PKCO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3QX5GEVB6TPCGLFOSSTV63PKCO/action/storage_attestation","attest_author":"https://pith.science/pith/3QX5GEVB6TPCGLFOSSTV63PKCO/action/author_attestation","sign_citation":"https://pith.science/pith/3QX5GEVB6TPCGLFOSSTV63PKCO/action/citation_signature","submit_replication":"https://pith.science/pith/3QX5GEVB6TPCGLFOSSTV63PKCO/action/replication_record"}},"created_at":"2026-05-18T00:44:41.406126+00:00","updated_at":"2026-05-18T00:44:41.406126+00:00"}