{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:32W7KES5PIW7USD5SILZ3FEGWF","short_pith_number":"pith:32W7KES5","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"},"canonical_sha256":"deadf5125d7a2dfa487d92179d9486b16e4ed317c8abc306e1347c7900a54da0","source":{"kind":"arxiv","id":"1403.3972","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3972","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3972v4","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3972","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"32W7KES5PIW7","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"32W7KES5PIW7USD5","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"32W7KES5","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:32W7KES5PIW7USD5SILZ3FEGWF","target":"record","payload":{"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"},"canonical_sha256":"deadf5125d7a2dfa487d92179d9486b16e4ed317c8abc306e1347c7900a54da0","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"},"source_kind":"arxiv","source_id":"1403.3972","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-18T01:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"anukLMK0bx6ZF/ZLChb7TusfdqzoFchJkgJQ277OgTX7OZ9omu2u2c4oZXB3emjEyyLXKNUHOqEhtBgwa16aCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:55:31.271262Z"},"content_sha256":"9dece220da046210ccd0a72da891ad1295c50815439de6e3e9bdebac96addf23","schema_version":"1.0","event_id":"sha256:9dece220da046210ccd0a72da891ad1295c50815439de6e3e9bdebac96addf23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:32W7KES5PIW7USD5SILZ3FEGWF","target":"graph","payload":{"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"},"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-18T01:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BvK4J5+zO+Ow+yOiv4GtF4+WpT+5SjgNJi/fGFibw0YKM4kMF1g/+0mNjkFyIy3sQYZoQwf9Sv9Bv9DUxUm4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:55:31.271636Z"},"content_sha256":"9af2144aa820b742dc9b8aa1661c659670995d76834a785de458f89d3793dbdc","schema_version":"1.0","event_id":"sha256:9af2144aa820b742dc9b8aa1661c659670995d76834a785de458f89d3793dbdc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32W7KES5PIW7USD5SILZ3FEGWF/bundle.json","state_url":"https://pith.science/pith/32W7KES5PIW7USD5SILZ3FEGWF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32W7KES5PIW7USD5SILZ3FEGWF/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-25T22:55:31Z","links":{"resolver":"https://pith.science/pith/32W7KES5PIW7USD5SILZ3FEGWF","bundle":"https://pith.science/pith/32W7KES5PIW7USD5SILZ3FEGWF/bundle.json","state":"https://pith.science/pith/32W7KES5PIW7USD5SILZ3FEGWF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32W7KES5PIW7USD5SILZ3FEGWF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:32W7KES5PIW7USD5SILZ3FEGWF","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":"b04c834890667efba33287deb1f83c3ac38107d66fb9dd44c0dea03fba5283d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-03-16T23:29:14Z","title_canon_sha256":"798e5400614e66babce22bbaffbaeafbcfbbae93178e3f1fc966bd93de6b420d"},"schema_version":"1.0","source":{"id":"1403.3972","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3972","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3972v4","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3972","created_at":"2026-05-18T01:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"32W7KES5PIW7","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"32W7KES5PIW7USD5","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"32W7KES5","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:9af2144aa820b742dc9b8aa1661c659670995d76834a785de458f89d3793dbdc","target":"graph","created_at":"2026-05-18T01:20:50Z","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 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","authors_text":"Vojt\\v{e}ch Vorel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-03-16T23:29:14Z","title":"Subset Synchronization and Careful Synchronization of Binary Finite Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3972","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:9dece220da046210ccd0a72da891ad1295c50815439de6e3e9bdebac96addf23","target":"record","created_at":"2026-05-18T01:20:50Z","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":"b04c834890667efba33287deb1f83c3ac38107d66fb9dd44c0dea03fba5283d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-03-16T23:29:14Z","title_canon_sha256":"798e5400614e66babce22bbaffbaeafbcfbbae93178e3f1fc966bd93de6b420d"},"schema_version":"1.0","source":{"id":"1403.3972","kind":"arxiv","version":4}},"canonical_sha256":"deadf5125d7a2dfa487d92179d9486b16e4ed317c8abc306e1347c7900a54da0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"deadf5125d7a2dfa487d92179d9486b16e4ed317c8abc306e1347c7900a54da0","first_computed_at":"2026-05-18T01:20:50.713468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:50.713468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5OO1fJXTOlivlyBq+J98jcPCTnRrknKQktP8tTolDDJE/aqmwNlgGNXVaiP7gnB41l9OZG1818fuwDupH7ysAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:50.713869Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.3972","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9dece220da046210ccd0a72da891ad1295c50815439de6e3e9bdebac96addf23","sha256:9af2144aa820b742dc9b8aa1661c659670995d76834a785de458f89d3793dbdc"],"state_sha256":"433d5b3ee9add7d7ffb43b40b2a1aeb3108ff5fe534a88afa0608a4cf07ea538"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZIG2gBHbsALqFyG9mRLbiab4fB3OSIf0I6/vqWX8rr2i8zDIt/T0OR1yj8lXbp+RVie1BefA9nAahGkYsmvLAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T22:55:31.273658Z","bundle_sha256":"18b6e1c900a2f67eff9d83f1848365cd664ae2ba363a306b8d61a42ab8c74659"}}