{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:USA62NU2QJYBO22BHU653Y6FVH","short_pith_number":"pith:USA62NU2","schema_version":"1.0","canonical_sha256":"a481ed369a8270176b413d3ddde3c5a9fac3ee01f5d49bd753da51a43813e594","source":{"kind":"arxiv","id":"1701.03944","version":1},"attestation_state":"computed","paper":{"title":"Most Complex Non-Returning 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-01-14T16:29:01Z","abstract_excerpt":"A regular language $L$ is non-returning if in the minimal deterministic finite automaton accepting it there are no transitions into the initial state. Eom, Han and Jir\\'askov\\'a derived upper bounds on the state complexity of boolean operations and Kleene star, and proved that these bounds are tight using two different binary witnesses. They derived upper bounds for concatenation and reversal using three different ternary witnesses. These five witnesses use a total of six different transformations. We show that for each $n\\ge 4$ there exists a ternary witness of state complexity $n$ that meets"},"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":"1701.03944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-01-14T16:29:01Z","cross_cats_sorted":[],"title_canon_sha256":"7d849eea569ab05fdd1de6aad662ed4c8615ee1f607e7db659cdfd8db4835cc5","abstract_canon_sha256":"52e2d78479518b621faacb005a1bcc522567efe47a2a09fa8f4e3d23a9208b3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:48.350284Z","signature_b64":"+wPWACvuKDq8M6xNPROMMs0qL8vHcC8YOObGU8CXe+XXsrxLlC00dt75hsTQsWv/XgATBhFymjJI9EXtcmzCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a481ed369a8270176b413d3ddde3c5a9fac3ee01f5d49bd753da51a43813e594","last_reissued_at":"2026-05-18T00:52:48.349572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:48.349572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Most Complex Non-Returning 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-01-14T16:29:01Z","abstract_excerpt":"A regular language $L$ is non-returning if in the minimal deterministic finite automaton accepting it there are no transitions into the initial state. Eom, Han and Jir\\'askov\\'a derived upper bounds on the state complexity of boolean operations and Kleene star, and proved that these bounds are tight using two different binary witnesses. They derived upper bounds for concatenation and reversal using three different ternary witnesses. These five witnesses use a total of six different transformations. We show that for each $n\\ge 4$ there exists a ternary witness of state complexity $n$ that meets"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03944","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":"1701.03944","created_at":"2026-05-18T00:52:48.349705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.03944v1","created_at":"2026-05-18T00:52:48.349705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03944","created_at":"2026-05-18T00:52:48.349705+00:00"},{"alias_kind":"pith_short_12","alias_value":"USA62NU2QJYB","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"USA62NU2QJYBO22B","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"USA62NU2","created_at":"2026-05-18T12:31:49.984773+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/USA62NU2QJYBO22BHU653Y6FVH","json":"https://pith.science/pith/USA62NU2QJYBO22BHU653Y6FVH.json","graph_json":"https://pith.science/api/pith-number/USA62NU2QJYBO22BHU653Y6FVH/graph.json","events_json":"https://pith.science/api/pith-number/USA62NU2QJYBO22BHU653Y6FVH/events.json","paper":"https://pith.science/paper/USA62NU2"},"agent_actions":{"view_html":"https://pith.science/pith/USA62NU2QJYBO22BHU653Y6FVH","download_json":"https://pith.science/pith/USA62NU2QJYBO22BHU653Y6FVH.json","view_paper":"https://pith.science/paper/USA62NU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.03944&json=true","fetch_graph":"https://pith.science/api/pith-number/USA62NU2QJYBO22BHU653Y6FVH/graph.json","fetch_events":"https://pith.science/api/pith-number/USA62NU2QJYBO22BHU653Y6FVH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USA62NU2QJYBO22BHU653Y6FVH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USA62NU2QJYBO22BHU653Y6FVH/action/storage_attestation","attest_author":"https://pith.science/pith/USA62NU2QJYBO22BHU653Y6FVH/action/author_attestation","sign_citation":"https://pith.science/pith/USA62NU2QJYBO22BHU653Y6FVH/action/citation_signature","submit_replication":"https://pith.science/pith/USA62NU2QJYBO22BHU653Y6FVH/action/replication_record"}},"created_at":"2026-05-18T00:52:48.349705+00:00","updated_at":"2026-05-18T00:52:48.349705+00:00"}