{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DUFIOCJDGQ3Q2LQE44DYWGGKY4","short_pith_number":"pith:DUFIOCJD","schema_version":"1.0","canonical_sha256":"1d0a87092334370d2e04e7078b18cac707af692b8214fa83c490aef09adb6a39","source":{"kind":"arxiv","id":"1401.2553","version":4},"attestation_state":"computed","paper":{"title":"Testing for Synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Mikhail V. Berlinkov","submitted_at":"2014-01-11T18:04:38Z","abstract_excerpt":"We consider the first problem that appears in any application of synchronizing automata, namely, the problem of deciding whether or not a given $n$-state $k$-letter automaton is synchronizing. First we generalize results from \\cite{RandSynch},\\cite{On2Problems} for the case of strongly connected partial automata. Specifically, for $k>1$ we show that an automaton is synchronizing with probability $1-O(\\frac{1}{n^{0.5k}})$ and present an algorithm with linear in $n$ expected time, while the best known algorithm is quadratic on each instance. This results are interesting due to their applications"},"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":"1401.2553","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-11T18:04:38Z","cross_cats_sorted":[],"title_canon_sha256":"e81b9d16f32dcc73e1a9108027eaf7c98e59698e93e3a6ae1a4cbca93423e67b","abstract_canon_sha256":"284e6dda0f2ed3b8a07565f5d4fc76f00ba98e2d98a1ca78683c4950c7d66458"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:00.780189Z","signature_b64":"bZY+iYPJpjoDz6ANmpbKkYuDft89qsaYWiDNZNIQYLal327YB9buM0KFM+n6/f+lsNbubPrJNGlEg7L/FIhuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d0a87092334370d2e04e7078b18cac707af692b8214fa83c490aef09adb6a39","last_reissued_at":"2026-05-17T23:51:00.779673Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:00.779673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing for Synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Mikhail V. Berlinkov","submitted_at":"2014-01-11T18:04:38Z","abstract_excerpt":"We consider the first problem that appears in any application of synchronizing automata, namely, the problem of deciding whether or not a given $n$-state $k$-letter automaton is synchronizing. First we generalize results from \\cite{RandSynch},\\cite{On2Problems} for the case of strongly connected partial automata. Specifically, for $k>1$ we show that an automaton is synchronizing with probability $1-O(\\frac{1}{n^{0.5k}})$ and present an algorithm with linear in $n$ expected time, while the best known algorithm is quadratic on each instance. This results are interesting due to their applications"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2553","kind":"arxiv","version":4},"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":"1401.2553","created_at":"2026-05-17T23:51:00.779762+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2553v4","created_at":"2026-05-17T23:51:00.779762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2553","created_at":"2026-05-17T23:51:00.779762+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUFIOCJDGQ3Q","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUFIOCJDGQ3Q2LQE","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUFIOCJD","created_at":"2026-05-18T12:28:25.294606+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/DUFIOCJDGQ3Q2LQE44DYWGGKY4","json":"https://pith.science/pith/DUFIOCJDGQ3Q2LQE44DYWGGKY4.json","graph_json":"https://pith.science/api/pith-number/DUFIOCJDGQ3Q2LQE44DYWGGKY4/graph.json","events_json":"https://pith.science/api/pith-number/DUFIOCJDGQ3Q2LQE44DYWGGKY4/events.json","paper":"https://pith.science/paper/DUFIOCJD"},"agent_actions":{"view_html":"https://pith.science/pith/DUFIOCJDGQ3Q2LQE44DYWGGKY4","download_json":"https://pith.science/pith/DUFIOCJDGQ3Q2LQE44DYWGGKY4.json","view_paper":"https://pith.science/paper/DUFIOCJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2553&json=true","fetch_graph":"https://pith.science/api/pith-number/DUFIOCJDGQ3Q2LQE44DYWGGKY4/graph.json","fetch_events":"https://pith.science/api/pith-number/DUFIOCJDGQ3Q2LQE44DYWGGKY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUFIOCJDGQ3Q2LQE44DYWGGKY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUFIOCJDGQ3Q2LQE44DYWGGKY4/action/storage_attestation","attest_author":"https://pith.science/pith/DUFIOCJDGQ3Q2LQE44DYWGGKY4/action/author_attestation","sign_citation":"https://pith.science/pith/DUFIOCJDGQ3Q2LQE44DYWGGKY4/action/citation_signature","submit_replication":"https://pith.science/pith/DUFIOCJDGQ3Q2LQE44DYWGGKY4/action/replication_record"}},"created_at":"2026-05-17T23:51:00.779762+00:00","updated_at":"2026-05-17T23:51:00.779762+00:00"}