{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TIJQXNKHUMIBQ5SYJUQNI7J5WG","short_pith_number":"pith:TIJQXNKH","schema_version":"1.0","canonical_sha256":"9a130bb547a3101876584d20d47d3db18e2a747802ba78b1a1a2824124bde0cf","source":{"kind":"arxiv","id":"1702.00877","version":3},"attestation_state":"computed","paper":{"title":"Primitivity, Uniform Minimality and State Complexity of Boolean Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"cs.FL","authors_text":"Sylvie Davies","submitted_at":"2017-02-03T00:23:02Z","abstract_excerpt":"A minimal deterministic finite automaton (DFA) is uniformly minimal if it always remains minimal when the final state set is replaced by a non-empty proper subset of the state set. We prove that a permutation DFA is uniformly minimal if and only if its transition monoid is a primitive group. We use this to study boolean operations on group languages, which are recognized by direct products of permutation DFAs. A direct product cannot be uniformly minimal, except in the trivial case where one of the DFAs in the product is a one-state DFA. However, non-trivial direct products can satisfy a weake"},"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":"1702.00877","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-03T00:23:02Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"2174f9905e13f00007faa8dcc73fcab7a7fac8fe79091b29e588f374d9fb82e8","abstract_canon_sha256":"70ae37ce50cd4161a19559ab3b2b6682a7584e17942f820e5a6bdd2b5ea3afa3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:17.426447Z","signature_b64":"+Mr1VX011+j/0yh8ROYRrDi7e0noHYkLovypb5DlSJpKpJcok2sR128jygOfKwGf9p56U7IpF9P9EvxDiRNZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a130bb547a3101876584d20d47d3db18e2a747802ba78b1a1a2824124bde0cf","last_reissued_at":"2026-05-18T00:20:17.425882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:17.425882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Primitivity, Uniform Minimality and State Complexity of Boolean Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"cs.FL","authors_text":"Sylvie Davies","submitted_at":"2017-02-03T00:23:02Z","abstract_excerpt":"A minimal deterministic finite automaton (DFA) is uniformly minimal if it always remains minimal when the final state set is replaced by a non-empty proper subset of the state set. We prove that a permutation DFA is uniformly minimal if and only if its transition monoid is a primitive group. We use this to study boolean operations on group languages, which are recognized by direct products of permutation DFAs. A direct product cannot be uniformly minimal, except in the trivial case where one of the DFAs in the product is a one-state DFA. However, non-trivial direct products can satisfy a weake"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00877","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":"1702.00877","created_at":"2026-05-18T00:20:17.425980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.00877v3","created_at":"2026-05-18T00:20:17.425980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00877","created_at":"2026-05-18T00:20:17.425980+00:00"},{"alias_kind":"pith_short_12","alias_value":"TIJQXNKHUMIB","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TIJQXNKHUMIBQ5SY","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TIJQXNKH","created_at":"2026-05-18T12:31:46.661854+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/TIJQXNKHUMIBQ5SYJUQNI7J5WG","json":"https://pith.science/pith/TIJQXNKHUMIBQ5SYJUQNI7J5WG.json","graph_json":"https://pith.science/api/pith-number/TIJQXNKHUMIBQ5SYJUQNI7J5WG/graph.json","events_json":"https://pith.science/api/pith-number/TIJQXNKHUMIBQ5SYJUQNI7J5WG/events.json","paper":"https://pith.science/paper/TIJQXNKH"},"agent_actions":{"view_html":"https://pith.science/pith/TIJQXNKHUMIBQ5SYJUQNI7J5WG","download_json":"https://pith.science/pith/TIJQXNKHUMIBQ5SYJUQNI7J5WG.json","view_paper":"https://pith.science/paper/TIJQXNKH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.00877&json=true","fetch_graph":"https://pith.science/api/pith-number/TIJQXNKHUMIBQ5SYJUQNI7J5WG/graph.json","fetch_events":"https://pith.science/api/pith-number/TIJQXNKHUMIBQ5SYJUQNI7J5WG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TIJQXNKHUMIBQ5SYJUQNI7J5WG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TIJQXNKHUMIBQ5SYJUQNI7J5WG/action/storage_attestation","attest_author":"https://pith.science/pith/TIJQXNKHUMIBQ5SYJUQNI7J5WG/action/author_attestation","sign_citation":"https://pith.science/pith/TIJQXNKHUMIBQ5SYJUQNI7J5WG/action/citation_signature","submit_replication":"https://pith.science/pith/TIJQXNKHUMIBQ5SYJUQNI7J5WG/action/replication_record"}},"created_at":"2026-05-18T00:20:17.425980+00:00","updated_at":"2026-05-18T00:20:17.425980+00:00"}