{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EG4WKS72ENDIAS5RWCV6NMAVBU","short_pith_number":"pith:EG4WKS72","schema_version":"1.0","canonical_sha256":"21b9654bfa2346804bb1b0abe6b0150d08d24e30b172bea1e64d4aebdac1e31e","source":{"kind":"arxiv","id":"1812.06347","version":1},"attestation_state":"computed","paper":{"title":"Optimal Regular Expressions for Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Antonio Molina Lovett, Jeffrey Shallit","submitted_at":"2018-12-15T20:22:31Z","abstract_excerpt":"The permutation language $P_n$ consists of all words that are permutations of a fixed alphabet of size $n$. Using divide-and-conquer, we construct a regular expression $R_n$ that specifies $P_n$. We then give explicit bounds for the length of $R_n$, which we find to be $4^n n^{-(\\lg n)/4+\\Theta(1)}$, and use these bounds to show that $R_n$ has minimum size over all regular expressions specifying $P_n$."},"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":"1812.06347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-12-15T20:22:31Z","cross_cats_sorted":[],"title_canon_sha256":"980cd7dfc872793ac9cd9763a2b2ac071bea724dead8d4c7de474f44fde7ddff","abstract_canon_sha256":"388dc42dd812e8d91460315c9d200c30267b62dca92bf8b07a2320b1090f25b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:10.497556Z","signature_b64":"nUKwyttUn7gEWfgtFtW+KMEXseSN6y+9+BD3tWVbHMvamrPw48O0L4pIn9oSH5bfvwSMbTRzo++eDcXz5UirAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21b9654bfa2346804bb1b0abe6b0150d08d24e30b172bea1e64d4aebdac1e31e","last_reissued_at":"2026-05-17T23:58:10.496951Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:10.496951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Regular Expressions for Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Antonio Molina Lovett, Jeffrey Shallit","submitted_at":"2018-12-15T20:22:31Z","abstract_excerpt":"The permutation language $P_n$ consists of all words that are permutations of a fixed alphabet of size $n$. Using divide-and-conquer, we construct a regular expression $R_n$ that specifies $P_n$. We then give explicit bounds for the length of $R_n$, which we find to be $4^n n^{-(\\lg n)/4+\\Theta(1)}$, and use these bounds to show that $R_n$ has minimum size over all regular expressions specifying $P_n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06347","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":"1812.06347","created_at":"2026-05-17T23:58:10.497054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.06347v1","created_at":"2026-05-17T23:58:10.497054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06347","created_at":"2026-05-17T23:58:10.497054+00:00"},{"alias_kind":"pith_short_12","alias_value":"EG4WKS72ENDI","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EG4WKS72ENDIAS5R","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EG4WKS72","created_at":"2026-05-18T12:32:22.470017+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/EG4WKS72ENDIAS5RWCV6NMAVBU","json":"https://pith.science/pith/EG4WKS72ENDIAS5RWCV6NMAVBU.json","graph_json":"https://pith.science/api/pith-number/EG4WKS72ENDIAS5RWCV6NMAVBU/graph.json","events_json":"https://pith.science/api/pith-number/EG4WKS72ENDIAS5RWCV6NMAVBU/events.json","paper":"https://pith.science/paper/EG4WKS72"},"agent_actions":{"view_html":"https://pith.science/pith/EG4WKS72ENDIAS5RWCV6NMAVBU","download_json":"https://pith.science/pith/EG4WKS72ENDIAS5RWCV6NMAVBU.json","view_paper":"https://pith.science/paper/EG4WKS72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.06347&json=true","fetch_graph":"https://pith.science/api/pith-number/EG4WKS72ENDIAS5RWCV6NMAVBU/graph.json","fetch_events":"https://pith.science/api/pith-number/EG4WKS72ENDIAS5RWCV6NMAVBU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EG4WKS72ENDIAS5RWCV6NMAVBU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EG4WKS72ENDIAS5RWCV6NMAVBU/action/storage_attestation","attest_author":"https://pith.science/pith/EG4WKS72ENDIAS5RWCV6NMAVBU/action/author_attestation","sign_citation":"https://pith.science/pith/EG4WKS72ENDIAS5RWCV6NMAVBU/action/citation_signature","submit_replication":"https://pith.science/pith/EG4WKS72ENDIAS5RWCV6NMAVBU/action/replication_record"}},"created_at":"2026-05-17T23:58:10.497054+00:00","updated_at":"2026-05-17T23:58:10.497054+00:00"}