{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PCURYRZXRLDFEXKDWBEXJDM3C2","short_pith_number":"pith:PCURYRZX","schema_version":"1.0","canonical_sha256":"78a91c47378ac6525d43b049748d9b1686d3361ffdd28f9c836892a206dbebd0","source":{"kind":"arxiv","id":"1004.3246","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of Finding Reset Words in Finite Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.FL","authors_text":"J\\\"org Olschewski, Michael Ummels","submitted_at":"2010-04-19T16:27:03Z","abstract_excerpt":"We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word has length k is complete for the complexity class DP. This result answers a question posed by Volkov. For the search problems of finding a shortest reset word and the length of a shortest reset word, we establish membership in the complexity classes FP^NP and FP^NP[log], respectively. Moreover, we show that both these problems are hard for FP^NP[log]. Finally, we observe that computing a reset word of a given length is"},"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":"1004.3246","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-04-19T16:27:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"46509df29906a115b4ef9bf7bfc329219164c394849ebb93b95c6578133c1cd7","abstract_canon_sha256":"a30ef90d86efa8fdc45ff5abab4b5e10676e3cf47f6717802841cec69c9c95fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:21.706552Z","signature_b64":"1cqSRFXO6a/mFU1qSYuTAg8fOQoXTg/8bchHjjBO0Bhl3SRpmTcY6myUOtDRnOxjhIImUyFm83Y/LlL0Gd8UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78a91c47378ac6525d43b049748d9b1686d3361ffdd28f9c836892a206dbebd0","last_reissued_at":"2026-05-18T04:28:21.706103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:21.706103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Finding Reset Words in Finite Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.FL","authors_text":"J\\\"org Olschewski, Michael Ummels","submitted_at":"2010-04-19T16:27:03Z","abstract_excerpt":"We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word has length k is complete for the complexity class DP. This result answers a question posed by Volkov. For the search problems of finding a shortest reset word and the length of a shortest reset word, we establish membership in the complexity classes FP^NP and FP^NP[log], respectively. Moreover, we show that both these problems are hard for FP^NP[log]. Finally, we observe that computing a reset word of a given length is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.3246","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":"1004.3246","created_at":"2026-05-18T04:28:21.706164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.3246v2","created_at":"2026-05-18T04:28:21.706164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.3246","created_at":"2026-05-18T04:28:21.706164+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCURYRZXRLDF","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCURYRZXRLDFEXKD","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCURYRZX","created_at":"2026-05-18T12:26:12.377268+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/PCURYRZXRLDFEXKDWBEXJDM3C2","json":"https://pith.science/pith/PCURYRZXRLDFEXKDWBEXJDM3C2.json","graph_json":"https://pith.science/api/pith-number/PCURYRZXRLDFEXKDWBEXJDM3C2/graph.json","events_json":"https://pith.science/api/pith-number/PCURYRZXRLDFEXKDWBEXJDM3C2/events.json","paper":"https://pith.science/paper/PCURYRZX"},"agent_actions":{"view_html":"https://pith.science/pith/PCURYRZXRLDFEXKDWBEXJDM3C2","download_json":"https://pith.science/pith/PCURYRZXRLDFEXKDWBEXJDM3C2.json","view_paper":"https://pith.science/paper/PCURYRZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.3246&json=true","fetch_graph":"https://pith.science/api/pith-number/PCURYRZXRLDFEXKDWBEXJDM3C2/graph.json","fetch_events":"https://pith.science/api/pith-number/PCURYRZXRLDFEXKDWBEXJDM3C2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCURYRZXRLDFEXKDWBEXJDM3C2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCURYRZXRLDFEXKDWBEXJDM3C2/action/storage_attestation","attest_author":"https://pith.science/pith/PCURYRZXRLDFEXKDWBEXJDM3C2/action/author_attestation","sign_citation":"https://pith.science/pith/PCURYRZXRLDFEXKDWBEXJDM3C2/action/citation_signature","submit_replication":"https://pith.science/pith/PCURYRZXRLDFEXKDWBEXJDM3C2/action/replication_record"}},"created_at":"2026-05-18T04:28:21.706164+00:00","updated_at":"2026-05-18T04:28:21.706164+00:00"}