{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DUFIOCJDGQ3Q2LQE44DYWGGKY4","short_pith_number":"pith:DUFIOCJD","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"},"canonical_sha256":"1d0a87092334370d2e04e7078b18cac707af692b8214fa83c490aef09adb6a39","source":{"kind":"arxiv","id":"1401.2553","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2553","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2553v4","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2553","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"pith_short_12","alias_value":"DUFIOCJDGQ3Q","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DUFIOCJDGQ3Q2LQE","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DUFIOCJD","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DUFIOCJDGQ3Q2LQE44DYWGGKY4","target":"record","payload":{"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"},"canonical_sha256":"1d0a87092334370d2e04e7078b18cac707af692b8214fa83c490aef09adb6a39","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"},"source_kind":"arxiv","source_id":"1401.2553","source_version":4,"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-17T23:51:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"verd1DxSBL6vMfK+QKKygfQJxbXSaDsFtgx6guEIKx0nK7faU21SgjYzj5bkTvwosiRLP0hOYl6OO3zZ6kFZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:50:53.103141Z"},"content_sha256":"805663ab7def6b0de9c52c90707d9e4e78637f07067e2a268e82fb322a73458f","schema_version":"1.0","event_id":"sha256:805663ab7def6b0de9c52c90707d9e4e78637f07067e2a268e82fb322a73458f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DUFIOCJDGQ3Q2LQE44DYWGGKY4","target":"graph","payload":{"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"},"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-17T23:51:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9rgSp9HOW/rZE/hPMTB6reQrMBuSOVfp18T+0Q1xTb1WuueIqt5208o9NBNlgxlFFYTw1iCbEJfgnE91UR/LBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:50:53.103856Z"},"content_sha256":"d26d1136ac1a2d5c09e0859420a4dcb6a184d7faee9c65fcb01334e6313d6b7e","schema_version":"1.0","event_id":"sha256:d26d1136ac1a2d5c09e0859420a4dcb6a184d7faee9c65fcb01334e6313d6b7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUFIOCJDGQ3Q2LQE44DYWGGKY4/bundle.json","state_url":"https://pith.science/pith/DUFIOCJDGQ3Q2LQE44DYWGGKY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUFIOCJDGQ3Q2LQE44DYWGGKY4/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-01T02:50:53Z","links":{"resolver":"https://pith.science/pith/DUFIOCJDGQ3Q2LQE44DYWGGKY4","bundle":"https://pith.science/pith/DUFIOCJDGQ3Q2LQE44DYWGGKY4/bundle.json","state":"https://pith.science/pith/DUFIOCJDGQ3Q2LQE44DYWGGKY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUFIOCJDGQ3Q2LQE44DYWGGKY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DUFIOCJDGQ3Q2LQE44DYWGGKY4","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":"284e6dda0f2ed3b8a07565f5d4fc76f00ba98e2d98a1ca78683c4950c7d66458","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-11T18:04:38Z","title_canon_sha256":"e81b9d16f32dcc73e1a9108027eaf7c98e59698e93e3a6ae1a4cbca93423e67b"},"schema_version":"1.0","source":{"id":"1401.2553","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2553","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2553v4","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2553","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"pith_short_12","alias_value":"DUFIOCJDGQ3Q","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DUFIOCJDGQ3Q2LQE","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DUFIOCJD","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:d26d1136ac1a2d5c09e0859420a4dcb6a184d7faee9c65fcb01334e6313d6b7e","target":"graph","created_at":"2026-05-17T23:51:00Z","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":"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","authors_text":"Mikhail V. Berlinkov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-11T18:04:38Z","title":"Testing for Synchronization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2553","kind":"arxiv","version":4},"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:805663ab7def6b0de9c52c90707d9e4e78637f07067e2a268e82fb322a73458f","target":"record","created_at":"2026-05-17T23:51:00Z","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":"284e6dda0f2ed3b8a07565f5d4fc76f00ba98e2d98a1ca78683c4950c7d66458","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-11T18:04:38Z","title_canon_sha256":"e81b9d16f32dcc73e1a9108027eaf7c98e59698e93e3a6ae1a4cbca93423e67b"},"schema_version":"1.0","source":{"id":"1401.2553","kind":"arxiv","version":4}},"canonical_sha256":"1d0a87092334370d2e04e7078b18cac707af692b8214fa83c490aef09adb6a39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d0a87092334370d2e04e7078b18cac707af692b8214fa83c490aef09adb6a39","first_computed_at":"2026-05-17T23:51:00.779673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:00.779673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bZY+iYPJpjoDz6ANmpbKkYuDft89qsaYWiDNZNIQYLal327YB9buM0KFM+n6/f+lsNbubPrJNGlEg7L/FIhuBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:00.780189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2553","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:805663ab7def6b0de9c52c90707d9e4e78637f07067e2a268e82fb322a73458f","sha256:d26d1136ac1a2d5c09e0859420a4dcb6a184d7faee9c65fcb01334e6313d6b7e"],"state_sha256":"66ca3c894f268755fefade8f912e8ab7dfc9d8f3c81f6a1c29921ded7a094002"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvkOQBj+kFkCilJ+H4RpL3hZ5Nl6c6dyZk0N7Wal0xdHqWODRrfJUoZl+TsCCcsaDqVjsZkjZ1cFR2j98Je5Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:50:53.106593Z","bundle_sha256":"f34573fdfd05c9aa8ef56c2f74b97c22221fd42d059056c12d9a193c65ed39aa"}}