{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KIJXOX3LXZCHQGOPSQUOXA2U63","short_pith_number":"pith:KIJXOX3L","canonical_record":{"source":{"id":"1703.07618","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-22T12:28:34Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"4c9ba094a31508adea1a44f8589080f2dc0b7620ae0db0e8570600cbd6b5c6ed","abstract_canon_sha256":"4f1ed686f73bd9240a8ca5fd82f382f2e6b96fb327cf3f7bc1be17e9d698f5dc"},"schema_version":"1.0"},"canonical_sha256":"5213775f6bbe447819cf9428eb8354f6d1f8a552a0a654ac8c7ef31cd91d59a7","source":{"kind":"arxiv","id":"1703.07618","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07618","created_at":"2026-05-18T00:42:17Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07618v3","created_at":"2026-05-18T00:42:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07618","created_at":"2026-05-18T00:42:17Z"},{"alias_kind":"pith_short_12","alias_value":"KIJXOX3LXZCH","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KIJXOX3LXZCHQGOP","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KIJXOX3L","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KIJXOX3LXZCHQGOPSQUOXA2U63","target":"record","payload":{"canonical_record":{"source":{"id":"1703.07618","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-22T12:28:34Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"4c9ba094a31508adea1a44f8589080f2dc0b7620ae0db0e8570600cbd6b5c6ed","abstract_canon_sha256":"4f1ed686f73bd9240a8ca5fd82f382f2e6b96fb327cf3f7bc1be17e9d698f5dc"},"schema_version":"1.0"},"canonical_sha256":"5213775f6bbe447819cf9428eb8354f6d1f8a552a0a654ac8c7ef31cd91d59a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:17.235088Z","signature_b64":"QwvSs/xk9oguZjKBTG7eSu9n4QNPvn4GIty/fYDuGfweT8QHPT+mps4lyZmeVHSQZa4wEj01H2Sx7nYxS9pCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5213775f6bbe447819cf9428eb8354f6d1f8a552a0a654ac8c7ef31cd91d59a7","last_reissued_at":"2026-05-18T00:42:17.234348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:17.234348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.07618","source_version":3,"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:42:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DC4uV6VPOwSojpOSY29zt+BeLvlmffghEYouzCu6C7FlNsedyAiPMaGuD2BeTeE/yqjWT+gATG59HPnnKli0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:13:44.332502Z"},"content_sha256":"2fb2158a712a9143cf982a93b0ba4a4dfc4927a98eadacb5f90426e10a489284","schema_version":"1.0","event_id":"sha256:2fb2158a712a9143cf982a93b0ba4a4dfc4927a98eadacb5f90426e10a489284"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KIJXOX3LXZCHQGOPSQUOXA2U63","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DFAs and PFAs with Long Shortest Synchronizing Word Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"Hans Zantema, Henk Don, Michiel de Bondt","submitted_at":"2017-03-22T12:28:34Z","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. Until now a full analysis of all DFAs reaching this bound was only given for $n \\leq 4$, and with bounds on the number of symbols for $n \\leq 10$. Here we give the full analysis for $n \\leq 6$, without bounds on the number of symbols.\n  For PFAs the bound is much higher. For $n \\leq 6$ we do a similar analysis as for DFAs and find the maximal shortest synchronizing word lengths, ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07618","kind":"arxiv","version":3},"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:42:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EGbgCQFvfH1+z5fRBiZ8bl+zSPET+Ms8fJSWfRGjRLPXfJefRLbSl6Id/WqXbzkFb6kZE46tkZHAuuv6xVPqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:13:44.333049Z"},"content_sha256":"72305ee6bab19cf3df5d38c1729e316246b6a83bcfa501404de3fcf2dbf92a15","schema_version":"1.0","event_id":"sha256:72305ee6bab19cf3df5d38c1729e316246b6a83bcfa501404de3fcf2dbf92a15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KIJXOX3LXZCHQGOPSQUOXA2U63/bundle.json","state_url":"https://pith.science/pith/KIJXOX3LXZCHQGOPSQUOXA2U63/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KIJXOX3LXZCHQGOPSQUOXA2U63/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-05T05:13:44Z","links":{"resolver":"https://pith.science/pith/KIJXOX3LXZCHQGOPSQUOXA2U63","bundle":"https://pith.science/pith/KIJXOX3LXZCHQGOPSQUOXA2U63/bundle.json","state":"https://pith.science/pith/KIJXOX3LXZCHQGOPSQUOXA2U63/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KIJXOX3LXZCHQGOPSQUOXA2U63/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KIJXOX3LXZCHQGOPSQUOXA2U63","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":"4f1ed686f73bd9240a8ca5fd82f382f2e6b96fb327cf3f7bc1be17e9d698f5dc","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-22T12:28:34Z","title_canon_sha256":"4c9ba094a31508adea1a44f8589080f2dc0b7620ae0db0e8570600cbd6b5c6ed"},"schema_version":"1.0","source":{"id":"1703.07618","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07618","created_at":"2026-05-18T00:42:17Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07618v3","created_at":"2026-05-18T00:42:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07618","created_at":"2026-05-18T00:42:17Z"},{"alias_kind":"pith_short_12","alias_value":"KIJXOX3LXZCH","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KIJXOX3LXZCHQGOP","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KIJXOX3L","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:72305ee6bab19cf3df5d38c1729e316246b6a83bcfa501404de3fcf2dbf92a15","target":"graph","created_at":"2026-05-18T00:42:17Z","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. Until now a full analysis of all DFAs reaching this bound was only given for $n \\leq 4$, and with bounds on the number of symbols for $n \\leq 10$. Here we give the full analysis for $n \\leq 6$, without bounds on the number of symbols.\n  For PFAs the bound is much higher. For $n \\leq 6$ we do a similar analysis as for DFAs and find the maximal shortest synchronizing word lengths, ex","authors_text":"Hans Zantema, Henk Don, Michiel de Bondt","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-22T12:28:34Z","title":"DFAs and PFAs with Long Shortest Synchronizing Word Length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07618","kind":"arxiv","version":3},"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:2fb2158a712a9143cf982a93b0ba4a4dfc4927a98eadacb5f90426e10a489284","target":"record","created_at":"2026-05-18T00:42:17Z","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":"4f1ed686f73bd9240a8ca5fd82f382f2e6b96fb327cf3f7bc1be17e9d698f5dc","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-22T12:28:34Z","title_canon_sha256":"4c9ba094a31508adea1a44f8589080f2dc0b7620ae0db0e8570600cbd6b5c6ed"},"schema_version":"1.0","source":{"id":"1703.07618","kind":"arxiv","version":3}},"canonical_sha256":"5213775f6bbe447819cf9428eb8354f6d1f8a552a0a654ac8c7ef31cd91d59a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5213775f6bbe447819cf9428eb8354f6d1f8a552a0a654ac8c7ef31cd91d59a7","first_computed_at":"2026-05-18T00:42:17.234348Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:17.234348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QwvSs/xk9oguZjKBTG7eSu9n4QNPvn4GIty/fYDuGfweT8QHPT+mps4lyZmeVHSQZa4wEj01H2Sx7nYxS9pCDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:17.235088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.07618","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fb2158a712a9143cf982a93b0ba4a4dfc4927a98eadacb5f90426e10a489284","sha256:72305ee6bab19cf3df5d38c1729e316246b6a83bcfa501404de3fcf2dbf92a15"],"state_sha256":"0c932ba4de72797d21e7dd7166d859253fa266afcf1db7833a2a31e8f88f6164"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gkKr9n9uIxE77mJtmhF2cuEiYgsRvGQw25vlo5ZuDfspfp3jeAJw5lq3S71jurFJzND56sfwExMy4oeUt4RuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:13:44.335812Z","bundle_sha256":"27f768e5be8f732bb90095fc46e5cff44c9555b4399f66c35e5bf4b8e3013ecc"}}