{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3B4JCYT72CJL5HBV4D3OPLXIDH","short_pith_number":"pith:3B4JCYT7","schema_version":"1.0","canonical_sha256":"d87891627fd092be9c35e0f6e7aee819de8e519124a733089c9dba3954069f45","source":{"kind":"arxiv","id":"1703.07995","version":1},"attestation_state":"computed","paper":{"title":"Synchronizing non-deterministic finite automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"Hans Zantema, Henk Don","submitted_at":"2017-03-23T10:45:28Z","abstract_excerpt":"In this paper, we show that every D3-directing CNFA can be mapped uniquely to a DFA with the same synchronizing word length. This implies that \\v{C}ern\\'y's conjecture generalizes to CNFAs and that the general upper bound for the length of a shortest D3-directing word is equal to the Pin-Frankl bound for DFAs. As a second consequence, for several classes of CNFAs sharper bounds are established. Finally, our results allow us to detect all critical CNFAs on at most 6 states. It turns out that only very few critical CNFAs exist."},"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":"1703.07995","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-23T10:45:28Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"ce0e1a35c7c08c01c0ad01926e439d3b358e787c580684f6a3ad20fa4ac5bb11","abstract_canon_sha256":"043a3a66c6f6d9230c51d27cb83d12dddec8ae8fe36d50df197ad75d64dfd1b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:04.160495Z","signature_b64":"BN/Inm2Au+oZu6XjAgaKjDxnZhYs4QTgUNEejAPUK1BfTUCtxJMyiZw2aRwX+yrLzJaz+oQgURZi0U7xl/7ZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d87891627fd092be9c35e0f6e7aee819de8e519124a733089c9dba3954069f45","last_reissued_at":"2026-05-18T00:48:04.159714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:04.159714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synchronizing non-deterministic finite automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"Hans Zantema, Henk Don","submitted_at":"2017-03-23T10:45:28Z","abstract_excerpt":"In this paper, we show that every D3-directing CNFA can be mapped uniquely to a DFA with the same synchronizing word length. This implies that \\v{C}ern\\'y's conjecture generalizes to CNFAs and that the general upper bound for the length of a shortest D3-directing word is equal to the Pin-Frankl bound for DFAs. As a second consequence, for several classes of CNFAs sharper bounds are established. Finally, our results allow us to detect all critical CNFAs on at most 6 states. It turns out that only very few critical CNFAs exist."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07995","kind":"arxiv","version":1},"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":"1703.07995","created_at":"2026-05-18T00:48:04.159848+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07995v1","created_at":"2026-05-18T00:48:04.159848+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07995","created_at":"2026-05-18T00:48:04.159848+00:00"},{"alias_kind":"pith_short_12","alias_value":"3B4JCYT72CJL","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3B4JCYT72CJL5HBV","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3B4JCYT7","created_at":"2026-05-18T12:30:58.224056+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/3B4JCYT72CJL5HBV4D3OPLXIDH","json":"https://pith.science/pith/3B4JCYT72CJL5HBV4D3OPLXIDH.json","graph_json":"https://pith.science/api/pith-number/3B4JCYT72CJL5HBV4D3OPLXIDH/graph.json","events_json":"https://pith.science/api/pith-number/3B4JCYT72CJL5HBV4D3OPLXIDH/events.json","paper":"https://pith.science/paper/3B4JCYT7"},"agent_actions":{"view_html":"https://pith.science/pith/3B4JCYT72CJL5HBV4D3OPLXIDH","download_json":"https://pith.science/pith/3B4JCYT72CJL5HBV4D3OPLXIDH.json","view_paper":"https://pith.science/paper/3B4JCYT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07995&json=true","fetch_graph":"https://pith.science/api/pith-number/3B4JCYT72CJL5HBV4D3OPLXIDH/graph.json","fetch_events":"https://pith.science/api/pith-number/3B4JCYT72CJL5HBV4D3OPLXIDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3B4JCYT72CJL5HBV4D3OPLXIDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3B4JCYT72CJL5HBV4D3OPLXIDH/action/storage_attestation","attest_author":"https://pith.science/pith/3B4JCYT72CJL5HBV4D3OPLXIDH/action/author_attestation","sign_citation":"https://pith.science/pith/3B4JCYT72CJL5HBV4D3OPLXIDH/action/citation_signature","submit_replication":"https://pith.science/pith/3B4JCYT72CJL5HBV4D3OPLXIDH/action/replication_record"}},"created_at":"2026-05-18T00:48:04.159848+00:00","updated_at":"2026-05-18T00:48:04.159848+00:00"}