{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:W4PRS5W4HV2SSOTWU7DWCBU3PH","short_pith_number":"pith:W4PRS5W4","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"},"canonical_sha256":"b71f1976dc3d75293a76a7c761069b79ddb14f0eaee37cbdb9fe6a513c95d7c8","source":{"kind":"arxiv","id":"1408.5248","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5248","created_at":"2026-05-18T01:55:42Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5248v2","created_at":"2026-05-18T01:55:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5248","created_at":"2026-05-18T01:55:42Z"},{"alias_kind":"pith_short_12","alias_value":"W4PRS5W4HV2S","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W4PRS5W4HV2SSOTW","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W4PRS5W4","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:W4PRS5W4HV2SSOTWU7DWCBU3PH","target":"record","payload":{"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"},"canonical_sha256":"b71f1976dc3d75293a76a7c761069b79ddb14f0eaee37cbdb9fe6a513c95d7c8","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"},"source_kind":"arxiv","source_id":"1408.5248","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:55:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L9O/FusQpXxkbnqCIs0K7oQalXPW4DYBmvuj3QPWtyOTaJduChuL6MWUzJ+cMN9qoXiKKB1DOadXmJQiFbLiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:12:41.072542Z"},"content_sha256":"2ac3aebee25c7590b370d6601b7cdf130e01562e2acd73f8167911577fca8792","schema_version":"1.0","event_id":"sha256:2ac3aebee25c7590b370d6601b7cdf130e01562e2acd73f8167911577fca8792"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:W4PRS5W4HV2SSOTWU7DWCBU3PH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:55:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oj7h71t8ZO9GGvPBiwAd6lj1vqTK7Agr3OKZ1VYqtRR0yPDTCYkJ/LJksXuLDizBo65OB3FvV7iT+4vdmb/PCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:12:41.072885Z"},"content_sha256":"02522fec477bc7c3ad207804bfbc1aacd2d6de07df205e807110018a5b806072","schema_version":"1.0","event_id":"sha256:02522fec477bc7c3ad207804bfbc1aacd2d6de07df205e807110018a5b806072"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W4PRS5W4HV2SSOTWU7DWCBU3PH/bundle.json","state_url":"https://pith.science/pith/W4PRS5W4HV2SSOTWU7DWCBU3PH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W4PRS5W4HV2SSOTWU7DWCBU3PH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T17:12:41Z","links":{"resolver":"https://pith.science/pith/W4PRS5W4HV2SSOTWU7DWCBU3PH","bundle":"https://pith.science/pith/W4PRS5W4HV2SSOTWU7DWCBU3PH/bundle.json","state":"https://pith.science/pith/W4PRS5W4HV2SSOTWU7DWCBU3PH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W4PRS5W4HV2SSOTWU7DWCBU3PH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:W4PRS5W4HV2SSOTWU7DWCBU3PH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fdfcee900a87408318328502877ec4036fdcb9016ed33db6384e6a4e6107c7eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-08-22T10:06:08Z","title_canon_sha256":"4956fa7b35ff1d4af2d1d3fd6989ba8db5a34d1454d08d98d76612c319d6021a"},"schema_version":"1.0","source":{"id":"1408.5248","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5248","created_at":"2026-05-18T01:55:42Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5248v2","created_at":"2026-05-18T01:55:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5248","created_at":"2026-05-18T01:55:42Z"},{"alias_kind":"pith_short_12","alias_value":"W4PRS5W4HV2S","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W4PRS5W4HV2SSOTW","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W4PRS5W4","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:02522fec477bc7c3ad207804bfbc1aacd2d6de07df205e807110018a5b806072","target":"graph","created_at":"2026-05-18T01:55:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Damian Straszak, Pawel Gawrychowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-08-22T10:06:08Z","title":"Strong inapproximability of the shortest reset word"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5248","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2ac3aebee25c7590b370d6601b7cdf130e01562e2acd73f8167911577fca8792","target":"record","created_at":"2026-05-18T01:55:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fdfcee900a87408318328502877ec4036fdcb9016ed33db6384e6a4e6107c7eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-08-22T10:06:08Z","title_canon_sha256":"4956fa7b35ff1d4af2d1d3fd6989ba8db5a34d1454d08d98d76612c319d6021a"},"schema_version":"1.0","source":{"id":"1408.5248","kind":"arxiv","version":2}},"canonical_sha256":"b71f1976dc3d75293a76a7c761069b79ddb14f0eaee37cbdb9fe6a513c95d7c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b71f1976dc3d75293a76a7c761069b79ddb14f0eaee37cbdb9fe6a513c95d7c8","first_computed_at":"2026-05-18T01:55:42.893618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:42.893618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K/C48on/bRFqwpoi9jsJU57+JwLt6xp1u+pfK8hD9IKdYuer4IcU1y9YTKKaPqA0P/glK6Ly6r13aTMUBnJJDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:42.894455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5248","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ac3aebee25c7590b370d6601b7cdf130e01562e2acd73f8167911577fca8792","sha256:02522fec477bc7c3ad207804bfbc1aacd2d6de07df205e807110018a5b806072"],"state_sha256":"53047f28c8ecae0ada206527e544cc0501ad40c371c21aa4c22e2d43019e27ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RqbXf097TofZPnLQDDCJGLsaUsM6FCmQGaRTn9qasoR6+nmuB650zhjn8Au0GnQA2Bb3tpXhPXRvGtA3VFs2BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:12:41.074856Z","bundle_sha256":"9bb9de8f933656b84b1158f0de1ea4021985b818b6472757c1c2a2c1b60d08dd"}}