{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OWTZPPHYRGB7GAMGN2R25SFQLM","short_pith_number":"pith:OWTZPPHY","schema_version":"1.0","canonical_sha256":"75a797bcf88983f301866ea3aec8b05b032096fde3479fa7921963d463d7b118","source":{"kind":"arxiv","id":"1405.5603","version":1},"attestation_state":"computed","paper":{"title":"Operations on Automata with All States Final","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Galina Jir\\'askov\\'a, Juraj \\v{S}ebej, Krist\\'ina \\v{C}evorov\\'a, Mat\\'u\\v{s} Palmovsk\\'y, Peter Mlyn\\'ar\\v{c}ik","submitted_at":"2014-05-22T02:13:37Z","abstract_excerpt":"We study the complexity of basic regular operations on languages represented by incomplete deterministic or nondeterministic automata, in which all states are final. Such languages are known to be prefix-closed. We get tight bounds on both incomplete and nondeterministic state complexity of complement, intersection, union, concatenation, star, and reversal on prefix-closed languages."},"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":"1405.5603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-05-22T02:13:37Z","cross_cats_sorted":[],"title_canon_sha256":"bb8dfda5ebc39b92a9e313e9c09a0cb54ffe8f3ccfd32cd6742ecdf27a46eb89","abstract_canon_sha256":"5f91fa5278a96c79a0868de7e2a3305916a4eff8ea8e773ce969da455504990d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:16.217677Z","signature_b64":"sV8y7vqZHwtgSPWNvIU4iOhDiFJmFgznxmjKnOHeIgQpQkMsNb22/Th+Alx/Ij/UQ0nHt9IuRNMGcCGtgH4WBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75a797bcf88983f301866ea3aec8b05b032096fde3479fa7921963d463d7b118","last_reissued_at":"2026-05-18T02:51:16.217097Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:16.217097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Operations on Automata with All States Final","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Galina Jir\\'askov\\'a, Juraj \\v{S}ebej, Krist\\'ina \\v{C}evorov\\'a, Mat\\'u\\v{s} Palmovsk\\'y, Peter Mlyn\\'ar\\v{c}ik","submitted_at":"2014-05-22T02:13:37Z","abstract_excerpt":"We study the complexity of basic regular operations on languages represented by incomplete deterministic or nondeterministic automata, in which all states are final. Such languages are known to be prefix-closed. We get tight bounds on both incomplete and nondeterministic state complexity of complement, intersection, union, concatenation, star, and reversal on prefix-closed languages."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5603","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":"1405.5603","created_at":"2026-05-18T02:51:16.217181+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5603v1","created_at":"2026-05-18T02:51:16.217181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5603","created_at":"2026-05-18T02:51:16.217181+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWTZPPHYRGB7","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWTZPPHYRGB7GAMG","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWTZPPHY","created_at":"2026-05-18T12:28:43.426989+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/OWTZPPHYRGB7GAMGN2R25SFQLM","json":"https://pith.science/pith/OWTZPPHYRGB7GAMGN2R25SFQLM.json","graph_json":"https://pith.science/api/pith-number/OWTZPPHYRGB7GAMGN2R25SFQLM/graph.json","events_json":"https://pith.science/api/pith-number/OWTZPPHYRGB7GAMGN2R25SFQLM/events.json","paper":"https://pith.science/paper/OWTZPPHY"},"agent_actions":{"view_html":"https://pith.science/pith/OWTZPPHYRGB7GAMGN2R25SFQLM","download_json":"https://pith.science/pith/OWTZPPHYRGB7GAMGN2R25SFQLM.json","view_paper":"https://pith.science/paper/OWTZPPHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5603&json=true","fetch_graph":"https://pith.science/api/pith-number/OWTZPPHYRGB7GAMGN2R25SFQLM/graph.json","fetch_events":"https://pith.science/api/pith-number/OWTZPPHYRGB7GAMGN2R25SFQLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWTZPPHYRGB7GAMGN2R25SFQLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWTZPPHYRGB7GAMGN2R25SFQLM/action/storage_attestation","attest_author":"https://pith.science/pith/OWTZPPHYRGB7GAMGN2R25SFQLM/action/author_attestation","sign_citation":"https://pith.science/pith/OWTZPPHYRGB7GAMGN2R25SFQLM/action/citation_signature","submit_replication":"https://pith.science/pith/OWTZPPHYRGB7GAMGN2R25SFQLM/action/replication_record"}},"created_at":"2026-05-18T02:51:16.217181+00:00","updated_at":"2026-05-18T02:51:16.217181+00:00"}