{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MPOG7EV52Q4AK7PNI6INHYRNHQ","short_pith_number":"pith:MPOG7EV5","schema_version":"1.0","canonical_sha256":"63dc6f92bdd438057ded4790d3e22d3c22d2526e0898df6f96aecbfada2a5930","source":{"kind":"arxiv","id":"1708.04864","version":1},"attestation_state":"computed","paper":{"title":"Synchronizing automata and the language of minimal reset words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Emanuele Rodaro","submitted_at":"2017-08-16T12:52:47Z","abstract_excerpt":"We study a connection between synchronizing automata and its set $M$ of minimal reset words, i.e., such that no proper factor is a reset word. We first show that any synchronizing automaton having the set of minimal reset words whose set of factors does not contain a word of length at most $\\frac{1}{4}\\min\\{|u|: u\\in I\\}+\\frac{1}{16}$ has a reset word of length at most $(n-\\frac{1}{2})^{2}$ In the last part of the paper we focus on the existence of synchronizing automata with a given ideal $I$ that serves as the set of reset words. To this end, we introduce the notion of the tail structure of "},"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":"1708.04864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-16T12:52:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8eeb5e12d8a3fe6afaa7fa09f5e4a8f841022ae62f734252b47d13dd6f99bf6d","abstract_canon_sha256":"76e2dbd8b2a78137a13d070ab778dde81f5b0a006743a54f3b14e7a377029780"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:55.308144Z","signature_b64":"i82dExLO6rqWIM0HVcXeYmHjOm0EsXyIF6bdVQkc5PvPFjepPKdqouObT+/JyKI64atyclxl4rjxih6uHuqSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63dc6f92bdd438057ded4790d3e22d3c22d2526e0898df6f96aecbfada2a5930","last_reissued_at":"2026-05-18T00:37:55.307672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:55.307672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synchronizing automata and the language of minimal reset words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Emanuele Rodaro","submitted_at":"2017-08-16T12:52:47Z","abstract_excerpt":"We study a connection between synchronizing automata and its set $M$ of minimal reset words, i.e., such that no proper factor is a reset word. We first show that any synchronizing automaton having the set of minimal reset words whose set of factors does not contain a word of length at most $\\frac{1}{4}\\min\\{|u|: u\\in I\\}+\\frac{1}{16}$ has a reset word of length at most $(n-\\frac{1}{2})^{2}$ In the last part of the paper we focus on the existence of synchronizing automata with a given ideal $I$ that serves as the set of reset words. To this end, we introduce the notion of the tail structure of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04864","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.04864","created_at":"2026-05-18T00:37:55.307745+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04864v1","created_at":"2026-05-18T00:37:55.307745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04864","created_at":"2026-05-18T00:37:55.307745+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPOG7EV52Q4A","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPOG7EV52Q4AK7PN","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPOG7EV5","created_at":"2026-05-18T12:31:31.346846+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/MPOG7EV52Q4AK7PNI6INHYRNHQ","json":"https://pith.science/pith/MPOG7EV52Q4AK7PNI6INHYRNHQ.json","graph_json":"https://pith.science/api/pith-number/MPOG7EV52Q4AK7PNI6INHYRNHQ/graph.json","events_json":"https://pith.science/api/pith-number/MPOG7EV52Q4AK7PNI6INHYRNHQ/events.json","paper":"https://pith.science/paper/MPOG7EV5"},"agent_actions":{"view_html":"https://pith.science/pith/MPOG7EV52Q4AK7PNI6INHYRNHQ","download_json":"https://pith.science/pith/MPOG7EV52Q4AK7PNI6INHYRNHQ.json","view_paper":"https://pith.science/paper/MPOG7EV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04864&json=true","fetch_graph":"https://pith.science/api/pith-number/MPOG7EV52Q4AK7PNI6INHYRNHQ/graph.json","fetch_events":"https://pith.science/api/pith-number/MPOG7EV52Q4AK7PNI6INHYRNHQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPOG7EV52Q4AK7PNI6INHYRNHQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPOG7EV52Q4AK7PNI6INHYRNHQ/action/storage_attestation","attest_author":"https://pith.science/pith/MPOG7EV52Q4AK7PNI6INHYRNHQ/action/author_attestation","sign_citation":"https://pith.science/pith/MPOG7EV52Q4AK7PNI6INHYRNHQ/action/citation_signature","submit_replication":"https://pith.science/pith/MPOG7EV52Q4AK7PNI6INHYRNHQ/action/replication_record"}},"created_at":"2026-05-18T00:37:55.307745+00:00","updated_at":"2026-05-18T00:37:55.307745+00:00"}