{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:6WDQUDCANLEUBIVSWN3W6BD5JD","short_pith_number":"pith:6WDQUDCA","schema_version":"1.0","canonical_sha256":"f5870a0c406ac940a2b2b3776f047d48e777faf4ba3dbef8b312226558f6cf42","source":{"kind":"arxiv","id":"2011.14404","version":1},"attestation_state":"computed","paper":{"title":"State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Stefan Hoffmann","submitted_at":"2020-11-29T17:56:38Z","abstract_excerpt":"Most slowly synchronizing automata over binary alphabets are circular, i.e., containing a letter permuting the states in a single cycle, and their set of synchronizing words has maximal state complexity, which also implies complete reachability.Here, we take a closer look at generalized circular and completely reachable automata. We derive that over a binary alphabet every completely reachable automaton must be circular, a consequence of a structural result stating that completely reachable automata over strictly less letters than states always contain permutational letters. We state sufficien"},"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":"2011.14404","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2020-11-29T17:56:38Z","cross_cats_sorted":[],"title_canon_sha256":"8d8808af2db9e5772fc31a6974f12c4487147df2a49c95e7fd2d7e061870c84a","abstract_canon_sha256":"52e980a050c0252afa723ae518146c254231a8857a912880d6d94d5cce749ca7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:55:20.169571Z","signature_b64":"YYsaLukPyu4ur2WrcZo6rKK3XU5ccv58ibgMr6A6/yaHnrGm3TEMNF8jXoQHyWtxXeQ68lRIfDmzlr3A+2bACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5870a0c406ac940a2b2b3776f047d48e777faf4ba3dbef8b312226558f6cf42","last_reissued_at":"2026-07-05T01:55:20.169217Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:55:20.169217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Stefan Hoffmann","submitted_at":"2020-11-29T17:56:38Z","abstract_excerpt":"Most slowly synchronizing automata over binary alphabets are circular, i.e., containing a letter permuting the states in a single cycle, and their set of synchronizing words has maximal state complexity, which also implies complete reachability.Here, we take a closer look at generalized circular and completely reachable automata. We derive that over a binary alphabet every completely reachable automaton must be circular, a consequence of a structural result stating that completely reachable automata over strictly less letters than states always contain permutational letters. We state sufficien"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.14404","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.14404/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.14404","created_at":"2026-07-05T01:55:20.169271+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.14404v1","created_at":"2026-07-05T01:55:20.169271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.14404","created_at":"2026-07-05T01:55:20.169271+00:00"},{"alias_kind":"pith_short_12","alias_value":"6WDQUDCANLEU","created_at":"2026-07-05T01:55:20.169271+00:00"},{"alias_kind":"pith_short_16","alias_value":"6WDQUDCANLEUBIVS","created_at":"2026-07-05T01:55:20.169271+00:00"},{"alias_kind":"pith_short_8","alias_value":"6WDQUDCA","created_at":"2026-07-05T01:55:20.169271+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.09783","citing_title":"Judges matter more than papers in post-publication research assessment","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6WDQUDCANLEUBIVSWN3W6BD5JD","json":"https://pith.science/pith/6WDQUDCANLEUBIVSWN3W6BD5JD.json","graph_json":"https://pith.science/api/pith-number/6WDQUDCANLEUBIVSWN3W6BD5JD/graph.json","events_json":"https://pith.science/api/pith-number/6WDQUDCANLEUBIVSWN3W6BD5JD/events.json","paper":"https://pith.science/paper/6WDQUDCA"},"agent_actions":{"view_html":"https://pith.science/pith/6WDQUDCANLEUBIVSWN3W6BD5JD","download_json":"https://pith.science/pith/6WDQUDCANLEUBIVSWN3W6BD5JD.json","view_paper":"https://pith.science/paper/6WDQUDCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.14404&json=true","fetch_graph":"https://pith.science/api/pith-number/6WDQUDCANLEUBIVSWN3W6BD5JD/graph.json","fetch_events":"https://pith.science/api/pith-number/6WDQUDCANLEUBIVSWN3W6BD5JD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6WDQUDCANLEUBIVSWN3W6BD5JD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6WDQUDCANLEUBIVSWN3W6BD5JD/action/storage_attestation","attest_author":"https://pith.science/pith/6WDQUDCANLEUBIVSWN3W6BD5JD/action/author_attestation","sign_citation":"https://pith.science/pith/6WDQUDCANLEUBIVSWN3W6BD5JD/action/citation_signature","submit_replication":"https://pith.science/pith/6WDQUDCANLEUBIVSWN3W6BD5JD/action/replication_record"}},"created_at":"2026-07-05T01:55:20.169271+00:00","updated_at":"2026-07-05T01:55:20.169271+00:00"}