{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TIJQXNKHUMIBQ5SYJUQNI7J5WG","short_pith_number":"pith:TIJQXNKH","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"},"canonical_sha256":"9a130bb547a3101876584d20d47d3db18e2a747802ba78b1a1a2824124bde0cf","source":{"kind":"arxiv","id":"1702.00877","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00877","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00877v3","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00877","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"pith_short_12","alias_value":"TIJQXNKHUMIB","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TIJQXNKHUMIBQ5SY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TIJQXNKH","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TIJQXNKHUMIBQ5SYJUQNI7J5WG","target":"record","payload":{"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"},"canonical_sha256":"9a130bb547a3101876584d20d47d3db18e2a747802ba78b1a1a2824124bde0cf","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"},"source_kind":"arxiv","source_id":"1702.00877","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:20:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mqWRNSzB6MP8tPCh6+IJ7KGLsU+M65e5VOX8hDppBUKIWsAkcOaH+Glna2Wn4TSjX++CdrIyx/U2R2/HsJiEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T10:58:36.073378Z"},"content_sha256":"264de3184b7e9a4795d46ab850c0c28a7a5d805c9fbce0760c308f72890fdec9","schema_version":"1.0","event_id":"sha256:264de3184b7e9a4795d46ab850c0c28a7a5d805c9fbce0760c308f72890fdec9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TIJQXNKHUMIBQ5SYJUQNI7J5WG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:20:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M03HwWmYbH27ZP/WpmJVOQLeNSffunLSnkSVX6P6Iyr4+4HqA3Q4TbrDCt37VqNpds5EX4X81qdIowUzOByYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T10:58:36.073720Z"},"content_sha256":"41a6dbc04b81ba2e2b698027b182238149c0e492b55bb0db47365449eeb735bd","schema_version":"1.0","event_id":"sha256:41a6dbc04b81ba2e2b698027b182238149c0e492b55bb0db47365449eeb735bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TIJQXNKHUMIBQ5SYJUQNI7J5WG/bundle.json","state_url":"https://pith.science/pith/TIJQXNKHUMIBQ5SYJUQNI7J5WG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TIJQXNKHUMIBQ5SYJUQNI7J5WG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T10:58:36Z","links":{"resolver":"https://pith.science/pith/TIJQXNKHUMIBQ5SYJUQNI7J5WG","bundle":"https://pith.science/pith/TIJQXNKHUMIBQ5SYJUQNI7J5WG/bundle.json","state":"https://pith.science/pith/TIJQXNKHUMIBQ5SYJUQNI7J5WG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TIJQXNKHUMIBQ5SYJUQNI7J5WG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TIJQXNKHUMIBQ5SYJUQNI7J5WG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"70ae37ce50cd4161a19559ab3b2b6682a7584e17942f820e5a6bdd2b5ea3afa3","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-03T00:23:02Z","title_canon_sha256":"2174f9905e13f00007faa8dcc73fcab7a7fac8fe79091b29e588f374d9fb82e8"},"schema_version":"1.0","source":{"id":"1702.00877","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00877","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00877v3","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00877","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"pith_short_12","alias_value":"TIJQXNKHUMIB","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TIJQXNKHUMIBQ5SY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TIJQXNKH","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:41a6dbc04b81ba2e2b698027b182238149c0e492b55bb0db47365449eeb735bd","target":"graph","created_at":"2026-05-18T00:20:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Sylvie Davies","cross_cats":["math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-03T00:23:02Z","title":"Primitivity, Uniform Minimality and State Complexity of Boolean Operations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00877","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:264de3184b7e9a4795d46ab850c0c28a7a5d805c9fbce0760c308f72890fdec9","target":"record","created_at":"2026-05-18T00:20:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"70ae37ce50cd4161a19559ab3b2b6682a7584e17942f820e5a6bdd2b5ea3afa3","cross_cats_sorted":["math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-03T00:23:02Z","title_canon_sha256":"2174f9905e13f00007faa8dcc73fcab7a7fac8fe79091b29e588f374d9fb82e8"},"schema_version":"1.0","source":{"id":"1702.00877","kind":"arxiv","version":3}},"canonical_sha256":"9a130bb547a3101876584d20d47d3db18e2a747802ba78b1a1a2824124bde0cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a130bb547a3101876584d20d47d3db18e2a747802ba78b1a1a2824124bde0cf","first_computed_at":"2026-05-18T00:20:17.425882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:17.425882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Mr1VX011+j/0yh8ROYRrDi7e0noHYkLovypb5DlSJpKpJcok2sR128jygOfKwGf9p56U7IpF9P9EvxDiRNZBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:17.426447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.00877","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:264de3184b7e9a4795d46ab850c0c28a7a5d805c9fbce0760c308f72890fdec9","sha256:41a6dbc04b81ba2e2b698027b182238149c0e492b55bb0db47365449eeb735bd"],"state_sha256":"7b61f0a3a7c5300e810baf2270b22856e36ee95e74c7d0cf9bee17a9324821b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ncUXBI/0WsYRppWkO3Ht81UVGs9zrCAzTo7cVPOlyb8cGkLlUpRIVXaS6jpzFUSL1080sVi5kUBHrYe3XdmPCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T10:58:36.075632Z","bundle_sha256":"0bf3d7b8d304fd95584f405d8521912348d7a3b92976aed15a084a33c172449f"}}