{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NI4AMWFTDGJCMBIJWTVWE6MPEG","short_pith_number":"pith:NI4AMWFT","schema_version":"1.0","canonical_sha256":"6a380658b31992260509b4eb62798f21aae11136730f4f974d8c26a028a778ee","source":{"kind":"arxiv","id":"1711.09149","version":2},"attestation_state":"computed","paper":{"title":"Most Complex Deterministic Union-Free Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Janusz A. Brzozowski, Sylvie Davies","submitted_at":"2017-11-24T21:53:17Z","abstract_excerpt":"A regular language $L$ is union-free if it can be represented by a regular expression without the union operation. A union-free language is deterministic if it can be accepted by a deterministic one-cycle-free-path finite automaton; this is an automaton which has one final state and exactly one cycle-free path from any state to the final state. Jir\\'askov\\'a and Masopust proved that the state complexities of the basic operations reversal, star, product, and boolean operations in deterministic union-free languages are exactly the same as those in the class of all regular languages. To prove tha"},"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":"1711.09149","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-11-24T21:53:17Z","cross_cats_sorted":[],"title_canon_sha256":"9dfb11d7f673842d9e552a291399f39795967201915fd01b34e7ce006280ebb0","abstract_canon_sha256":"d2e05e4c81f8f64fee71568eab9a84cec4a0cab28963b41105aca5ebfec6a611"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:49.004762Z","signature_b64":"IGuFINbBGglDPPIcnQYsj76aGPdPJgCseODsd9CEs9PHo8QD7izxglTnNixMVKQJXCUnVleXyz9shJ0rrMLWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a380658b31992260509b4eb62798f21aae11136730f4f974d8c26a028a778ee","last_reissued_at":"2026-05-18T00:26:49.003918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:49.003918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Most Complex Deterministic Union-Free Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Janusz A. Brzozowski, Sylvie Davies","submitted_at":"2017-11-24T21:53:17Z","abstract_excerpt":"A regular language $L$ is union-free if it can be represented by a regular expression without the union operation. A union-free language is deterministic if it can be accepted by a deterministic one-cycle-free-path finite automaton; this is an automaton which has one final state and exactly one cycle-free path from any state to the final state. Jir\\'askov\\'a and Masopust proved that the state complexities of the basic operations reversal, star, product, and boolean operations in deterministic union-free languages are exactly the same as those in the class of all regular languages. To prove tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09149","kind":"arxiv","version":2},"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":"1711.09149","created_at":"2026-05-18T00:26:49.004063+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.09149v2","created_at":"2026-05-18T00:26:49.004063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09149","created_at":"2026-05-18T00:26:49.004063+00:00"},{"alias_kind":"pith_short_12","alias_value":"NI4AMWFTDGJC","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NI4AMWFTDGJCMBIJ","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NI4AMWFT","created_at":"2026-05-18T12:31:31.346846+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/NI4AMWFTDGJCMBIJWTVWE6MPEG","json":"https://pith.science/pith/NI4AMWFTDGJCMBIJWTVWE6MPEG.json","graph_json":"https://pith.science/api/pith-number/NI4AMWFTDGJCMBIJWTVWE6MPEG/graph.json","events_json":"https://pith.science/api/pith-number/NI4AMWFTDGJCMBIJWTVWE6MPEG/events.json","paper":"https://pith.science/paper/NI4AMWFT"},"agent_actions":{"view_html":"https://pith.science/pith/NI4AMWFTDGJCMBIJWTVWE6MPEG","download_json":"https://pith.science/pith/NI4AMWFTDGJCMBIJWTVWE6MPEG.json","view_paper":"https://pith.science/paper/NI4AMWFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.09149&json=true","fetch_graph":"https://pith.science/api/pith-number/NI4AMWFTDGJCMBIJWTVWE6MPEG/graph.json","fetch_events":"https://pith.science/api/pith-number/NI4AMWFTDGJCMBIJWTVWE6MPEG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NI4AMWFTDGJCMBIJWTVWE6MPEG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NI4AMWFTDGJCMBIJWTVWE6MPEG/action/storage_attestation","attest_author":"https://pith.science/pith/NI4AMWFTDGJCMBIJWTVWE6MPEG/action/author_attestation","sign_citation":"https://pith.science/pith/NI4AMWFTDGJCMBIJWTVWE6MPEG/action/citation_signature","submit_replication":"https://pith.science/pith/NI4AMWFTDGJCMBIJWTVWE6MPEG/action/replication_record"}},"created_at":"2026-05-18T00:26:49.004063+00:00","updated_at":"2026-05-18T00:26:49.004063+00:00"}