{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:32W7KES5PIW7USD5SILZ3FEGWF","short_pith_number":"pith:32W7KES5","schema_version":"1.0","canonical_sha256":"deadf5125d7a2dfa487d92179d9486b16e4ed317c8abc306e1347c7900a54da0","source":{"kind":"arxiv","id":"1403.3972","version":4},"attestation_state":"computed","paper":{"title":"Subset Synchronization and Careful Synchronization of Binary Finite Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Vojt\\v{e}ch Vorel","submitted_at":"2014-03-16T23:29:14Z","abstract_excerpt":"We present a strongly exponential lower bound that applies both to the subset synchronization threshold for binary deterministic automata and to the careful synchronization threshold for binary partial automata. In the later form, the result finishes the research initiated by Martyugin (2013). Moreover, we show that both the thresholds remain strongly exponential even if restricted to strongly connected binary automata. In addition, we apply our methods to computational complexity. Existence of a subset reset word is known to be PSPACE-complete; we show that this holds even under the restricti"},"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":"1403.3972","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-03-16T23:29:14Z","cross_cats_sorted":[],"title_canon_sha256":"798e5400614e66babce22bbaffbaeafbcfbbae93178e3f1fc966bd93de6b420d","abstract_canon_sha256":"b04c834890667efba33287deb1f83c3ac38107d66fb9dd44c0dea03fba5283d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:50.713869Z","signature_b64":"5OO1fJXTOlivlyBq+J98jcPCTnRrknKQktP8tTolDDJE/aqmwNlgGNXVaiP7gnB41l9OZG1818fuwDupH7ysAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deadf5125d7a2dfa487d92179d9486b16e4ed317c8abc306e1347c7900a54da0","last_reissued_at":"2026-05-18T01:20:50.713468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:50.713468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subset Synchronization and Careful Synchronization of Binary Finite Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Vojt\\v{e}ch Vorel","submitted_at":"2014-03-16T23:29:14Z","abstract_excerpt":"We present a strongly exponential lower bound that applies both to the subset synchronization threshold for binary deterministic automata and to the careful synchronization threshold for binary partial automata. In the later form, the result finishes the research initiated by Martyugin (2013). Moreover, we show that both the thresholds remain strongly exponential even if restricted to strongly connected binary automata. In addition, we apply our methods to computational complexity. Existence of a subset reset word is known to be PSPACE-complete; we show that this holds even under the restricti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3972","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":"1403.3972","created_at":"2026-05-18T01:20:50.713536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.3972v4","created_at":"2026-05-18T01:20:50.713536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3972","created_at":"2026-05-18T01:20:50.713536+00:00"},{"alias_kind":"pith_short_12","alias_value":"32W7KES5PIW7","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"32W7KES5PIW7USD5","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"32W7KES5","created_at":"2026-05-18T12:28:11.866339+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/32W7KES5PIW7USD5SILZ3FEGWF","json":"https://pith.science/pith/32W7KES5PIW7USD5SILZ3FEGWF.json","graph_json":"https://pith.science/api/pith-number/32W7KES5PIW7USD5SILZ3FEGWF/graph.json","events_json":"https://pith.science/api/pith-number/32W7KES5PIW7USD5SILZ3FEGWF/events.json","paper":"https://pith.science/paper/32W7KES5"},"agent_actions":{"view_html":"https://pith.science/pith/32W7KES5PIW7USD5SILZ3FEGWF","download_json":"https://pith.science/pith/32W7KES5PIW7USD5SILZ3FEGWF.json","view_paper":"https://pith.science/paper/32W7KES5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.3972&json=true","fetch_graph":"https://pith.science/api/pith-number/32W7KES5PIW7USD5SILZ3FEGWF/graph.json","fetch_events":"https://pith.science/api/pith-number/32W7KES5PIW7USD5SILZ3FEGWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/32W7KES5PIW7USD5SILZ3FEGWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/32W7KES5PIW7USD5SILZ3FEGWF/action/storage_attestation","attest_author":"https://pith.science/pith/32W7KES5PIW7USD5SILZ3FEGWF/action/author_attestation","sign_citation":"https://pith.science/pith/32W7KES5PIW7USD5SILZ3FEGWF/action/citation_signature","submit_replication":"https://pith.science/pith/32W7KES5PIW7USD5SILZ3FEGWF/action/replication_record"}},"created_at":"2026-05-18T01:20:50.713536+00:00","updated_at":"2026-05-18T01:20:50.713536+00:00"}