{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TCHO73FXVVCWQC7AVGHA3X3X4E","short_pith_number":"pith:TCHO73FX","canonical_record":{"source":{"id":"1203.3402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-03-15T16:00:50Z","cross_cats_sorted":[],"title_canon_sha256":"d03ae3778d7fbd5689ef0fcddec069473803ffd4d3fe9ea1d9194198e7a8106b","abstract_canon_sha256":"acc52d23e8bc52522e29f0d5308ebc907bbc8451104c235313d3301ca1d81009"},"schema_version":"1.0"},"canonical_sha256":"988eefecb7ad45680be0a98e0ddf77e12e9257075fd2c0d31131ace9f335e333","source":{"kind":"arxiv","id":"1203.3402","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3402","created_at":"2026-05-18T04:00:01Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3402v1","created_at":"2026-05-18T04:00:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3402","created_at":"2026-05-18T04:00:01Z"},{"alias_kind":"pith_short_12","alias_value":"TCHO73FXVVCW","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TCHO73FXVVCWQC7A","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TCHO73FX","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TCHO73FXVVCWQC7AVGHA3X3X4E","target":"record","payload":{"canonical_record":{"source":{"id":"1203.3402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-03-15T16:00:50Z","cross_cats_sorted":[],"title_canon_sha256":"d03ae3778d7fbd5689ef0fcddec069473803ffd4d3fe9ea1d9194198e7a8106b","abstract_canon_sha256":"acc52d23e8bc52522e29f0d5308ebc907bbc8451104c235313d3301ca1d81009"},"schema_version":"1.0"},"canonical_sha256":"988eefecb7ad45680be0a98e0ddf77e12e9257075fd2c0d31131ace9f335e333","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:01.729392Z","signature_b64":"hLjKc6iLVsec0joYh3Cc8oENModEFOctHEd4/mORKgnurOb936ZL/U3klK4CkFNvRK+Ss6HAgQwirRsIsnrQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"988eefecb7ad45680be0a98e0ddf77e12e9257075fd2c0d31131ace9f335e333","last_reissued_at":"2026-05-18T04:00:01.728915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:01.728915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.3402","source_version":1,"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-18T04:00:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kW0ZiMWT5wnHmThCum/bEwxCpY82w/IVRV0Vc1iEHQNHxI9TRnNke2UVBIa2ot5kEuiuDc8aq7cah2RGrE5ZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:01:35.337269Z"},"content_sha256":"12f3c8740be800c853d10bf36e77afb387de8973acfc526532b8e7132ae77c67","schema_version":"1.0","event_id":"sha256:12f3c8740be800c853d10bf36e77afb387de8973acfc526532b8e7132ae77c67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TCHO73FXVVCWQC7AVGHA3X3X4E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Synchronizing Automata on Quasi Eulerian Digraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Mikhail V. Berlinkov","submitted_at":"2012-03-15T16:00:50Z","abstract_excerpt":"In 1964 \\v{C}ern\\'{y} conjectured that each $n$-state synchronizing automaton posesses a reset word of length at most $(n-1)^2$. From the other side the best known upper bound on the reset length (minimum length of reset words) is cubic in $n$. Thus the main problem here is to prove quadratic (in $n$) upper bounds. Since 1964, this problem has been solved for few special classes of \\sa. One of this result is due to Kari \\cite{Ka03} for automata with Eulerian digraphs. In this paper we introduce a new approach to prove quadratic upper bounds and explain it in terms of Markov chains and Perron-F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3402","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"},"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-18T04:00:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nN1ER0rCu2gzj74oloJtpfEYl0k17k79EYsyuyWEksIziGTZv53BdedIiHzgG7OCQa1D0mVR9+dIlAzD0963Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:01:35.337625Z"},"content_sha256":"26398d7ac34f780604f4ac3f0bb16e10cc80a9b3c99f98d80c25c9254c3559bf","schema_version":"1.0","event_id":"sha256:26398d7ac34f780604f4ac3f0bb16e10cc80a9b3c99f98d80c25c9254c3559bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TCHO73FXVVCWQC7AVGHA3X3X4E/bundle.json","state_url":"https://pith.science/pith/TCHO73FXVVCWQC7AVGHA3X3X4E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TCHO73FXVVCWQC7AVGHA3X3X4E/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-02T02:01:35Z","links":{"resolver":"https://pith.science/pith/TCHO73FXVVCWQC7AVGHA3X3X4E","bundle":"https://pith.science/pith/TCHO73FXVVCWQC7AVGHA3X3X4E/bundle.json","state":"https://pith.science/pith/TCHO73FXVVCWQC7AVGHA3X3X4E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TCHO73FXVVCWQC7AVGHA3X3X4E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TCHO73FXVVCWQC7AVGHA3X3X4E","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":"acc52d23e8bc52522e29f0d5308ebc907bbc8451104c235313d3301ca1d81009","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-03-15T16:00:50Z","title_canon_sha256":"d03ae3778d7fbd5689ef0fcddec069473803ffd4d3fe9ea1d9194198e7a8106b"},"schema_version":"1.0","source":{"id":"1203.3402","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3402","created_at":"2026-05-18T04:00:01Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3402v1","created_at":"2026-05-18T04:00:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3402","created_at":"2026-05-18T04:00:01Z"},{"alias_kind":"pith_short_12","alias_value":"TCHO73FXVVCW","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TCHO73FXVVCWQC7A","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TCHO73FX","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:26398d7ac34f780604f4ac3f0bb16e10cc80a9b3c99f98d80c25c9254c3559bf","target":"graph","created_at":"2026-05-18T04:00:01Z","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":"In 1964 \\v{C}ern\\'{y} conjectured that each $n$-state synchronizing automaton posesses a reset word of length at most $(n-1)^2$. From the other side the best known upper bound on the reset length (minimum length of reset words) is cubic in $n$. Thus the main problem here is to prove quadratic (in $n$) upper bounds. Since 1964, this problem has been solved for few special classes of \\sa. One of this result is due to Kari \\cite{Ka03} for automata with Eulerian digraphs. In this paper we introduce a new approach to prove quadratic upper bounds and explain it in terms of Markov chains and Perron-F","authors_text":"Mikhail V. Berlinkov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-03-15T16:00:50Z","title":"Synchronizing Automata on Quasi Eulerian Digraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3402","kind":"arxiv","version":1},"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:12f3c8740be800c853d10bf36e77afb387de8973acfc526532b8e7132ae77c67","target":"record","created_at":"2026-05-18T04:00:01Z","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":"acc52d23e8bc52522e29f0d5308ebc907bbc8451104c235313d3301ca1d81009","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-03-15T16:00:50Z","title_canon_sha256":"d03ae3778d7fbd5689ef0fcddec069473803ffd4d3fe9ea1d9194198e7a8106b"},"schema_version":"1.0","source":{"id":"1203.3402","kind":"arxiv","version":1}},"canonical_sha256":"988eefecb7ad45680be0a98e0ddf77e12e9257075fd2c0d31131ace9f335e333","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"988eefecb7ad45680be0a98e0ddf77e12e9257075fd2c0d31131ace9f335e333","first_computed_at":"2026-05-18T04:00:01.728915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:01.728915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hLjKc6iLVsec0joYh3Cc8oENModEFOctHEd4/mORKgnurOb936ZL/U3klK4CkFNvRK+Ss6HAgQwirRsIsnrQDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:01.729392Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3402","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12f3c8740be800c853d10bf36e77afb387de8973acfc526532b8e7132ae77c67","sha256:26398d7ac34f780604f4ac3f0bb16e10cc80a9b3c99f98d80c25c9254c3559bf"],"state_sha256":"9bf4454d7ec5432672514edc37b2ccc7bbd15cf31aee8fbd741a6b5aa4b3ea98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C1+2+wS58XZkNQ+u3MXJyIaRUDf/isFxPk6rMzf16Lfzp37hS7UquVAaSXhKAYqZfonxPG9Aj9i9pdcwJvX0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:01:35.339484Z","bundle_sha256":"0284ca278cf1c71ae35ec224ccbfe8ac8fc2ed0d8c14cd1f78031e778a7069a3"}}