{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:W4PRS5W4HV2SSOTWU7DWCBU3PH","short_pith_number":"pith:W4PRS5W4","schema_version":"1.0","canonical_sha256":"b71f1976dc3d75293a76a7c761069b79ddb14f0eaee37cbdb9fe6a513c95d7c8","source":{"kind":"arxiv","id":"1408.5248","version":2},"attestation_state":"computed","paper":{"title":"Strong inapproximability of the shortest reset word","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Damian Straszak, Pawel Gawrychowski","submitted_at":"2014-08-22T10:06:08Z","abstract_excerpt":"The \\v{C}ern\\'y conjecture states that every $n$-state synchronizing automaton has a reset word of length at most $(n-1)^2$. We study the hardness of finding short reset words. It is known that the exact version of the problem, i.e., finding the shortest reset word, is NP-hard and coNP-hard, and complete for the DP class, and that approximating the length of the shortest reset word within a factor of $O(\\log n)$ is NP-hard [Gerbush and Heeringa, CIAA'10], even for the binary alphabet [Berlinkov, DLT'13]. We significantly improve on these results by showing that, for every $\\epsilon>0$, it is N"},"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":"1408.5248","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-08-22T10:06:08Z","cross_cats_sorted":[],"title_canon_sha256":"4956fa7b35ff1d4af2d1d3fd6989ba8db5a34d1454d08d98d76612c319d6021a","abstract_canon_sha256":"fdfcee900a87408318328502877ec4036fdcb9016ed33db6384e6a4e6107c7eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:42.894455Z","signature_b64":"K/C48on/bRFqwpoi9jsJU57+JwLt6xp1u+pfK8hD9IKdYuer4IcU1y9YTKKaPqA0P/glK6Ly6r13aTMUBnJJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b71f1976dc3d75293a76a7c761069b79ddb14f0eaee37cbdb9fe6a513c95d7c8","last_reissued_at":"2026-05-18T01:55:42.893618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:42.893618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong inapproximability of the shortest reset word","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Damian Straszak, Pawel Gawrychowski","submitted_at":"2014-08-22T10:06:08Z","abstract_excerpt":"The \\v{C}ern\\'y conjecture states that every $n$-state synchronizing automaton has a reset word of length at most $(n-1)^2$. We study the hardness of finding short reset words. It is known that the exact version of the problem, i.e., finding the shortest reset word, is NP-hard and coNP-hard, and complete for the DP class, and that approximating the length of the shortest reset word within a factor of $O(\\log n)$ is NP-hard [Gerbush and Heeringa, CIAA'10], even for the binary alphabet [Berlinkov, DLT'13]. We significantly improve on these results by showing that, for every $\\epsilon>0$, it is N"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5248","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":"1408.5248","created_at":"2026-05-18T01:55:42.893762+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.5248v2","created_at":"2026-05-18T01:55:42.893762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5248","created_at":"2026-05-18T01:55:42.893762+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4PRS5W4HV2S","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4PRS5W4HV2SSOTW","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4PRS5W4","created_at":"2026-05-18T12:28:54.890064+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/W4PRS5W4HV2SSOTWU7DWCBU3PH","json":"https://pith.science/pith/W4PRS5W4HV2SSOTWU7DWCBU3PH.json","graph_json":"https://pith.science/api/pith-number/W4PRS5W4HV2SSOTWU7DWCBU3PH/graph.json","events_json":"https://pith.science/api/pith-number/W4PRS5W4HV2SSOTWU7DWCBU3PH/events.json","paper":"https://pith.science/paper/W4PRS5W4"},"agent_actions":{"view_html":"https://pith.science/pith/W4PRS5W4HV2SSOTWU7DWCBU3PH","download_json":"https://pith.science/pith/W4PRS5W4HV2SSOTWU7DWCBU3PH.json","view_paper":"https://pith.science/paper/W4PRS5W4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.5248&json=true","fetch_graph":"https://pith.science/api/pith-number/W4PRS5W4HV2SSOTWU7DWCBU3PH/graph.json","fetch_events":"https://pith.science/api/pith-number/W4PRS5W4HV2SSOTWU7DWCBU3PH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4PRS5W4HV2SSOTWU7DWCBU3PH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4PRS5W4HV2SSOTWU7DWCBU3PH/action/storage_attestation","attest_author":"https://pith.science/pith/W4PRS5W4HV2SSOTWU7DWCBU3PH/action/author_attestation","sign_citation":"https://pith.science/pith/W4PRS5W4HV2SSOTWU7DWCBU3PH/action/citation_signature","submit_replication":"https://pith.science/pith/W4PRS5W4HV2SSOTWU7DWCBU3PH/action/replication_record"}},"created_at":"2026-05-18T01:55:42.893762+00:00","updated_at":"2026-05-18T01:55:42.893762+00:00"}