{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZFACH7EYEZEMPDLIA2V6JTBIBK","short_pith_number":"pith:ZFACH7EY","canonical_record":{"source":{"id":"1609.06853","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-09-22T08:02:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5cd0c729cd0c785e5cf197a69b17dc2bf99b26e46f987e3b64c03daf14743a0f","abstract_canon_sha256":"7e867c2cb1b5648f1be56da84e3427a7bbe1f478a588d1ba32c1eceea0207dcb"},"schema_version":"1.0"},"canonical_sha256":"c94023fc982648c78d6806abe4cc280a8d2bfa067e182fba00f6eed2fe5e5508","source":{"kind":"arxiv","id":"1609.06853","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06853","created_at":"2026-05-18T00:28:02Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06853v5","created_at":"2026-05-18T00:28:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06853","created_at":"2026-05-18T00:28:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZFACH7EYEZEM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZFACH7EYEZEMPDLI","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZFACH7EY","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZFACH7EYEZEMPDLIA2V6JTBIBK","target":"record","payload":{"canonical_record":{"source":{"id":"1609.06853","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-09-22T08:02:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"5cd0c729cd0c785e5cf197a69b17dc2bf99b26e46f987e3b64c03daf14743a0f","abstract_canon_sha256":"7e867c2cb1b5648f1be56da84e3427a7bbe1f478a588d1ba32c1eceea0207dcb"},"schema_version":"1.0"},"canonical_sha256":"c94023fc982648c78d6806abe4cc280a8d2bfa067e182fba00f6eed2fe5e5508","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:02.689401Z","signature_b64":"h7dIM1YpL/QHlExXw2bsoPjwqoGZewvS9yv99i1G4mWfacy42/dl+lpKGNcGas5iP4qgkwE6spKxAbyp0Y/0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c94023fc982648c78d6806abe4cc280a8d2bfa067e182fba00f6eed2fe5e5508","last_reissued_at":"2026-05-18T00:28:02.688849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:02.688849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.06853","source_version":5,"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-18T00:28:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HYXq3xxD9BXjCdFxPMKyaOR7V7XAyme5ZIr+mJD+IXKY0yArHFysYGK6AOiRvjrhJGKcPUaE3CRLJIwrb4lDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:30:33.835941Z"},"content_sha256":"d446b4f53786c75f86c68afd30ef9fadfeaa62d37aa80087069bca5c014a79a2","schema_version":"1.0","event_id":"sha256:d446b4f53786c75f86c68afd30ef9fadfeaa62d37aa80087069bca5c014a79a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZFACH7EYEZEMPDLIA2V6JTBIBK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Slowly synchronizing automata with fixed alphabet size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Hans Zantema, Henk Don, Michiel de Bondt","submitted_at":"2016-09-22T08:02:33Z","abstract_excerpt":"It was conjectured by \\v{C}ern\\'y in 1964 that a synchronizing DFA on $n$ states always has a shortest synchronizing word of length at most $(n-1)^2$, and he gave a sequence of DFAs for which this bound is reached.\n  In this paper, we investigate the role of the alphabet size. For each possible alphabet size, we count DFAs on $n \\le 6$ states which synchronize in $(n-1)^2 - e$ steps, for all $e < 2\\lceil n/2 \\rceil$. Furthermore, we give constructions of automata with any number of states, and $3$, $4$, or $5$ symbols, which synchronize slowly, namely in $n^2 - 3n + O(1)$ steps.\n  In addition,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06853","kind":"arxiv","version":5},"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-18T00:28:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Z1AQkfYSpZ01H3rGe05t+A/tXy7BhYFqO8UxPCuM4LuuXEMNefmyys/dt9WavzS6pDQjhlNYxXJgZx4vpXzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:30:33.836579Z"},"content_sha256":"0c6714b827b9b9e81d11081f344488d54ba249d1086b348e180e40e57fb7dbaf","schema_version":"1.0","event_id":"sha256:0c6714b827b9b9e81d11081f344488d54ba249d1086b348e180e40e57fb7dbaf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZFACH7EYEZEMPDLIA2V6JTBIBK/bundle.json","state_url":"https://pith.science/pith/ZFACH7EYEZEMPDLIA2V6JTBIBK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZFACH7EYEZEMPDLIA2V6JTBIBK/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-05T06:30:33Z","links":{"resolver":"https://pith.science/pith/ZFACH7EYEZEMPDLIA2V6JTBIBK","bundle":"https://pith.science/pith/ZFACH7EYEZEMPDLIA2V6JTBIBK/bundle.json","state":"https://pith.science/pith/ZFACH7EYEZEMPDLIA2V6JTBIBK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZFACH7EYEZEMPDLIA2V6JTBIBK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZFACH7EYEZEMPDLIA2V6JTBIBK","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":"7e867c2cb1b5648f1be56da84e3427a7bbe1f478a588d1ba32c1eceea0207dcb","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-09-22T08:02:33Z","title_canon_sha256":"5cd0c729cd0c785e5cf197a69b17dc2bf99b26e46f987e3b64c03daf14743a0f"},"schema_version":"1.0","source":{"id":"1609.06853","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06853","created_at":"2026-05-18T00:28:02Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06853v5","created_at":"2026-05-18T00:28:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06853","created_at":"2026-05-18T00:28:02Z"},{"alias_kind":"pith_short_12","alias_value":"ZFACH7EYEZEM","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZFACH7EYEZEMPDLI","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZFACH7EY","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:0c6714b827b9b9e81d11081f344488d54ba249d1086b348e180e40e57fb7dbaf","target":"graph","created_at":"2026-05-18T00:28:02Z","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":"It was conjectured by \\v{C}ern\\'y in 1964 that a synchronizing DFA on $n$ states always has a shortest synchronizing word of length at most $(n-1)^2$, and he gave a sequence of DFAs for which this bound is reached.\n  In this paper, we investigate the role of the alphabet size. For each possible alphabet size, we count DFAs on $n \\le 6$ states which synchronize in $(n-1)^2 - e$ steps, for all $e < 2\\lceil n/2 \\rceil$. Furthermore, we give constructions of automata with any number of states, and $3$, $4$, or $5$ symbols, which synchronize slowly, namely in $n^2 - 3n + O(1)$ steps.\n  In addition,","authors_text":"Hans Zantema, Henk Don, Michiel de Bondt","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-09-22T08:02:33Z","title":"Slowly synchronizing automata with fixed alphabet size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06853","kind":"arxiv","version":5},"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:d446b4f53786c75f86c68afd30ef9fadfeaa62d37aa80087069bca5c014a79a2","target":"record","created_at":"2026-05-18T00:28:02Z","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":"7e867c2cb1b5648f1be56da84e3427a7bbe1f478a588d1ba32c1eceea0207dcb","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-09-22T08:02:33Z","title_canon_sha256":"5cd0c729cd0c785e5cf197a69b17dc2bf99b26e46f987e3b64c03daf14743a0f"},"schema_version":"1.0","source":{"id":"1609.06853","kind":"arxiv","version":5}},"canonical_sha256":"c94023fc982648c78d6806abe4cc280a8d2bfa067e182fba00f6eed2fe5e5508","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c94023fc982648c78d6806abe4cc280a8d2bfa067e182fba00f6eed2fe5e5508","first_computed_at":"2026-05-18T00:28:02.688849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:02.688849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h7dIM1YpL/QHlExXw2bsoPjwqoGZewvS9yv99i1G4mWfacy42/dl+lpKGNcGas5iP4qgkwE6spKxAbyp0Y/0Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:02.689401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.06853","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d446b4f53786c75f86c68afd30ef9fadfeaa62d37aa80087069bca5c014a79a2","sha256:0c6714b827b9b9e81d11081f344488d54ba249d1086b348e180e40e57fb7dbaf"],"state_sha256":"7ec5b8f6707c320f9188bf889f05ccfaa78f620133a0ed43aaf6c70094672a5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ISwrbXHTPUeKhfb8GJ1KIpLVPPsopXO9Xi6v5Z6TNu+iHppIQd+bKa6oqsIOLGzaqJqrGYTTvGYvu8bDNbwCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:30:33.839529Z","bundle_sha256":"71c2e890c9939edbafba248ca384b22cbb5538bb9a4b7f57842f8d37d093c892"}}