{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FCJVR2B4NERMETREMUWFCPKCSX","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":"24852ba4ccc8808d8258a92850d10d86616c79bcdad67d77f140cfa3bb4fb27f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-12-08T15:24:47Z","title_canon_sha256":"26d4e373fe3fe93e70ca8a217d5abafc16b460a2599b5f793bb82ea5d2b08b17"},"schema_version":"1.0","source":{"id":"1312.2226","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2226","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2226v4","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2226","created_at":"2026-05-18T00:20:22Z"},{"alias_kind":"pith_short_12","alias_value":"FCJVR2B4NERM","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FCJVR2B4NERMETRE","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FCJVR2B4","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:3b9f713f184213506113a086f0350fe37291817fae8b8fd8729de20601a7d04e","target":"graph","created_at":"2026-05-18T00:20:22Z","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":"Under the assumption $\\mathcal{P} \\neq \\mathcal{NP}$, we prove that two natural problems from the theory of synchronizing automata cannot be solved in polynomial time. The first problem is to decide whether a given reachable partial automaton is synchronizing. The second one is, given an $n$-state binary complete synchronizing automaton, to compute its reset threshold within performance ratio less than $d \\ln{(n)}$ for a specific constant $d>0$.","authors_text":"Mikhail V. Berlinkov","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-12-08T15:24:47Z","title":"On two Algorithmic Problems about Synchronizing Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2226","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:ddee60b3fca95b66c5ef7fc620ed0b6833a55c6640fe6de001f1fd703ea6813b","target":"record","created_at":"2026-05-18T00:20:22Z","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":"24852ba4ccc8808d8258a92850d10d86616c79bcdad67d77f140cfa3bb4fb27f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-12-08T15:24:47Z","title_canon_sha256":"26d4e373fe3fe93e70ca8a217d5abafc16b460a2599b5f793bb82ea5d2b08b17"},"schema_version":"1.0","source":{"id":"1312.2226","kind":"arxiv","version":4}},"canonical_sha256":"289358e83c6922c24e24652c513d4295eee223f8ff4d66f1c18904330fd65a0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"289358e83c6922c24e24652c513d4295eee223f8ff4d66f1c18904330fd65a0e","first_computed_at":"2026-05-18T00:20:22.650509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:22.650509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fSJHZlHsdTs+10njz3LdP1CLbvf0gykpjFZye5FJeuGCTtmJPaGPnU0TcYnsHDyvd1wBF4NDJeH/4iy++bUSAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:22.651168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2226","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ddee60b3fca95b66c5ef7fc620ed0b6833a55c6640fe6de001f1fd703ea6813b","sha256:3b9f713f184213506113a086f0350fe37291817fae8b8fd8729de20601a7d04e"],"state_sha256":"be0dc432087f1e5cc78b157495005389398b2dd1ab0507a22ea8a13966373cb5"}