{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KZRADJWZ3OMEPK7IG3TDLRT36G","short_pith_number":"pith:KZRADJWZ","canonical_record":{"source":{"id":"1104.2409","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-13T08:26:43Z","cross_cats_sorted":[],"title_canon_sha256":"ee98445f0d5f87a2924c0e265a3187b3e2ac4b81928add407436baf8e367de34","abstract_canon_sha256":"7e365804add508f630fa6cd06a891b5c663a0b448cddb62b26078a4fbd287ccf"},"schema_version":"1.0"},"canonical_sha256":"566201a6d9db9847abe836e635c67bf199f212a3bd02cd73731413f78a9b6b29","source":{"kind":"arxiv","id":"1104.2409","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2409","created_at":"2026-05-18T02:55:57Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2409v7","created_at":"2026-05-18T02:55:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2409","created_at":"2026-05-18T02:55:57Z"},{"alias_kind":"pith_short_12","alias_value":"KZRADJWZ3OME","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KZRADJWZ3OMEPK7I","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KZRADJWZ","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KZRADJWZ3OMEPK7IG3TDLRT36G","target":"record","payload":{"canonical_record":{"source":{"id":"1104.2409","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-13T08:26:43Z","cross_cats_sorted":[],"title_canon_sha256":"ee98445f0d5f87a2924c0e265a3187b3e2ac4b81928add407436baf8e367de34","abstract_canon_sha256":"7e365804add508f630fa6cd06a891b5c663a0b448cddb62b26078a4fbd287ccf"},"schema_version":"1.0"},"canonical_sha256":"566201a6d9db9847abe836e635c67bf199f212a3bd02cd73731413f78a9b6b29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:57.765105Z","signature_b64":"i+o0F2EMqk9KfTQFZNTbh8tHtNQeZ5B3upSPWCX2e3FcDxtn2p8yOQT9Hjj2Fq+kiO61AwydCHc1cpTXoRDXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"566201a6d9db9847abe836e635c67bf199f212a3bd02cd73731413f78a9b6b29","last_reissued_at":"2026-05-18T02:55:57.764612Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:57.764612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.2409","source_version":7,"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-18T02:55:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ztq6n9S6baiqL4O934g1Rofdq+7WhWCIW1fHj3l3rMR0t8WuOzQQHLlz6ECpCY7h67ZP1ItXs1aWNqcli46uCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T12:33:39.243748Z"},"content_sha256":"9f994bbab744d6d668f81cf9342efeacfaee7c473aef4ecc738eba70d57532b1","schema_version":"1.0","event_id":"sha256:9f994bbab744d6d668f81cf9342efeacfaee7c473aef4ecc738eba70d57532b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KZRADJWZ3OMEPK7IG3TDLRT36G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modifying the upper bound on the length of minimal synchronizing word","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"A. N. Trahtman","submitted_at":"2011-04-13T08:26:43Z","abstract_excerpt":"A word $w$ is called synchronizing (recurrent, reset, magic, directable) word of deterministic finite automaton (DFA) if $w$ sends all states of the automaton to a unique state. In 1964 Jan \\v{C}erny found a sequence of n-state complete DFA possessing a minimal synchronizing word of length $(n-1)^2$. He conjectured that it is an upper bound on the length of such words for complete DFA. Nevertheless, the best upper bound $(n^3-n)/6$ was found almost 30 years ago. We reduce the upper bound on the length of the minimal synchronizing word to $n(7n^2+6n-16)/48$. An implemented algorithm for finding"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2409","kind":"arxiv","version":7},"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-18T02:55:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kh6gRBPqYaIWI01hdqGo7q8ALSuKNihfxNm3/JY+l/DuO6Nva1RYIy0kF86k4iAlKcR3NMJ6WdJI5lUllAo4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T12:33:39.244092Z"},"content_sha256":"9c4f8ee0327f96ffe80085cbd909ed50c5244896fbf2f6d4ac23f133ec8ff18b","schema_version":"1.0","event_id":"sha256:9c4f8ee0327f96ffe80085cbd909ed50c5244896fbf2f6d4ac23f133ec8ff18b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KZRADJWZ3OMEPK7IG3TDLRT36G/bundle.json","state_url":"https://pith.science/pith/KZRADJWZ3OMEPK7IG3TDLRT36G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KZRADJWZ3OMEPK7IG3TDLRT36G/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-30T12:33:39Z","links":{"resolver":"https://pith.science/pith/KZRADJWZ3OMEPK7IG3TDLRT36G","bundle":"https://pith.science/pith/KZRADJWZ3OMEPK7IG3TDLRT36G/bundle.json","state":"https://pith.science/pith/KZRADJWZ3OMEPK7IG3TDLRT36G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KZRADJWZ3OMEPK7IG3TDLRT36G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KZRADJWZ3OMEPK7IG3TDLRT36G","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":"7e365804add508f630fa6cd06a891b5c663a0b448cddb62b26078a4fbd287ccf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-13T08:26:43Z","title_canon_sha256":"ee98445f0d5f87a2924c0e265a3187b3e2ac4b81928add407436baf8e367de34"},"schema_version":"1.0","source":{"id":"1104.2409","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2409","created_at":"2026-05-18T02:55:57Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2409v7","created_at":"2026-05-18T02:55:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2409","created_at":"2026-05-18T02:55:57Z"},{"alias_kind":"pith_short_12","alias_value":"KZRADJWZ3OME","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KZRADJWZ3OMEPK7I","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KZRADJWZ","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:9c4f8ee0327f96ffe80085cbd909ed50c5244896fbf2f6d4ac23f133ec8ff18b","target":"graph","created_at":"2026-05-18T02:55:57Z","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":"A word $w$ is called synchronizing (recurrent, reset, magic, directable) word of deterministic finite automaton (DFA) if $w$ sends all states of the automaton to a unique state. In 1964 Jan \\v{C}erny found a sequence of n-state complete DFA possessing a minimal synchronizing word of length $(n-1)^2$. He conjectured that it is an upper bound on the length of such words for complete DFA. Nevertheless, the best upper bound $(n^3-n)/6$ was found almost 30 years ago. We reduce the upper bound on the length of the minimal synchronizing word to $n(7n^2+6n-16)/48$. An implemented algorithm for finding","authors_text":"A. N. Trahtman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-13T08:26:43Z","title":"Modifying the upper bound on the length of minimal synchronizing word"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2409","kind":"arxiv","version":7},"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:9f994bbab744d6d668f81cf9342efeacfaee7c473aef4ecc738eba70d57532b1","target":"record","created_at":"2026-05-18T02:55:57Z","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":"7e365804add508f630fa6cd06a891b5c663a0b448cddb62b26078a4fbd287ccf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-13T08:26:43Z","title_canon_sha256":"ee98445f0d5f87a2924c0e265a3187b3e2ac4b81928add407436baf8e367de34"},"schema_version":"1.0","source":{"id":"1104.2409","kind":"arxiv","version":7}},"canonical_sha256":"566201a6d9db9847abe836e635c67bf199f212a3bd02cd73731413f78a9b6b29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"566201a6d9db9847abe836e635c67bf199f212a3bd02cd73731413f78a9b6b29","first_computed_at":"2026-05-18T02:55:57.764612Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:57.764612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i+o0F2EMqk9KfTQFZNTbh8tHtNQeZ5B3upSPWCX2e3FcDxtn2p8yOQT9Hjj2Fq+kiO61AwydCHc1cpTXoRDXDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:57.765105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2409","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f994bbab744d6d668f81cf9342efeacfaee7c473aef4ecc738eba70d57532b1","sha256:9c4f8ee0327f96ffe80085cbd909ed50c5244896fbf2f6d4ac23f133ec8ff18b"],"state_sha256":"fed331fbec877fb3319c4aa77b0638e3e9f0c14143b2b597be7d727728eb340d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HfvvMip7TychKlf2VJVnnB80ukdDIywBPl38S5NZKRfupSwcxGZwzsDJEmYFzuEtOCOTsglKMS0uJL9XRTdRAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T12:33:39.246623Z","bundle_sha256":"80fe58f3f71ef240584e50e15b31ec500e598c553b8cbf46199f4995b2b521b4"}}