{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DMDL5I755L6TKTCC6SP3HVZDN2","short_pith_number":"pith:DMDL5I75","schema_version":"1.0","canonical_sha256":"1b06bea3fdeafd354c42f49fb3d7236eaf54fffedfd91b5a5deeee54e7d22391","source":{"kind":"arxiv","id":"1308.4946","version":3},"attestation_state":"computed","paper":{"title":"On the effective and automatic enumeration of polynomial permutation classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheyne Homberger, Vince Vatter","submitted_at":"2013-08-22T18:32:43Z","abstract_excerpt":"We describe an algorithm, implemented in Python, which can enumerate any permutation class with polynomial enumeration from a structural description of the class. In particular, this allows us to find formulas for the number of permutations of length n which can be obtained by a finite number of block sorting operations (e.g., reversals, block transpositions, cut-and-paste moves)."},"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":"1308.4946","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-22T18:32:43Z","cross_cats_sorted":[],"title_canon_sha256":"7680d10544a2c4e1dd0f5913109604ae2a01084865cfb9245849dc3a20419d8d","abstract_canon_sha256":"e099cc66e3c21e5299413c9da06bb2b3e63c4eddba3cc721ed33f0dcc0782315"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:58.573189Z","signature_b64":"8+BP+nSKf+qBz2Z9cxUXM+CGU7F1S3VXbKZ5vkk8Fk33R5zgHbrFZb7L/znXXk0IGXuBQPS4JR9vaxkakxKpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b06bea3fdeafd354c42f49fb3d7236eaf54fffedfd91b5a5deeee54e7d22391","last_reissued_at":"2026-05-18T01:26:58.572784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:58.572784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the effective and automatic enumeration of polynomial permutation classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cheyne Homberger, Vince Vatter","submitted_at":"2013-08-22T18:32:43Z","abstract_excerpt":"We describe an algorithm, implemented in Python, which can enumerate any permutation class with polynomial enumeration from a structural description of the class. In particular, this allows us to find formulas for the number of permutations of length n which can be obtained by a finite number of block sorting operations (e.g., reversals, block transpositions, cut-and-paste moves)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4946","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":"1308.4946","created_at":"2026-05-18T01:26:58.572843+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.4946v3","created_at":"2026-05-18T01:26:58.572843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4946","created_at":"2026-05-18T01:26:58.572843+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMDL5I755L6T","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMDL5I755L6TKTCC","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMDL5I75","created_at":"2026-05-18T12:27:43.054852+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/DMDL5I755L6TKTCC6SP3HVZDN2","json":"https://pith.science/pith/DMDL5I755L6TKTCC6SP3HVZDN2.json","graph_json":"https://pith.science/api/pith-number/DMDL5I755L6TKTCC6SP3HVZDN2/graph.json","events_json":"https://pith.science/api/pith-number/DMDL5I755L6TKTCC6SP3HVZDN2/events.json","paper":"https://pith.science/paper/DMDL5I75"},"agent_actions":{"view_html":"https://pith.science/pith/DMDL5I755L6TKTCC6SP3HVZDN2","download_json":"https://pith.science/pith/DMDL5I755L6TKTCC6SP3HVZDN2.json","view_paper":"https://pith.science/paper/DMDL5I75","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.4946&json=true","fetch_graph":"https://pith.science/api/pith-number/DMDL5I755L6TKTCC6SP3HVZDN2/graph.json","fetch_events":"https://pith.science/api/pith-number/DMDL5I755L6TKTCC6SP3HVZDN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMDL5I755L6TKTCC6SP3HVZDN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMDL5I755L6TKTCC6SP3HVZDN2/action/storage_attestation","attest_author":"https://pith.science/pith/DMDL5I755L6TKTCC6SP3HVZDN2/action/author_attestation","sign_citation":"https://pith.science/pith/DMDL5I755L6TKTCC6SP3HVZDN2/action/citation_signature","submit_replication":"https://pith.science/pith/DMDL5I755L6TKTCC6SP3HVZDN2/action/replication_record"}},"created_at":"2026-05-18T01:26:58.572843+00:00","updated_at":"2026-05-18T01:26:58.572843+00:00"}