{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MPOG7EV52Q4AK7PNI6INHYRNHQ","short_pith_number":"pith:MPOG7EV5","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"},"canonical_sha256":"63dc6f92bdd438057ded4790d3e22d3c22d2526e0898df6f96aecbfada2a5930","source":{"kind":"arxiv","id":"1708.04864","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04864","created_at":"2026-05-18T00:37:55Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04864v1","created_at":"2026-05-18T00:37:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04864","created_at":"2026-05-18T00:37:55Z"},{"alias_kind":"pith_short_12","alias_value":"MPOG7EV52Q4A","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MPOG7EV52Q4AK7PN","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MPOG7EV5","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MPOG7EV52Q4AK7PNI6INHYRNHQ","target":"record","payload":{"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"},"canonical_sha256":"63dc6f92bdd438057ded4790d3e22d3c22d2526e0898df6f96aecbfada2a5930","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"},"source_kind":"arxiv","source_id":"1708.04864","source_version":1,"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-18T00:37:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kXpSC48uTuN11OrZV45hzj2TzcND9OnEo88h7qGLbquS9vYJZIkcexdPskIypMdcYeV7KppIrWofyjXjSimABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:07:23.345895Z"},"content_sha256":"e68d21bbc4d47a3d831701c46039b53f1c2f89a7da02d18b2916c7d00a7cd969","schema_version":"1.0","event_id":"sha256:e68d21bbc4d47a3d831701c46039b53f1c2f89a7da02d18b2916c7d00a7cd969"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MPOG7EV52Q4AK7PNI6INHYRNHQ","target":"graph","payload":{"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"},"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-18T00:37:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/KiDyLOpiBulmN2hP/ttEtZF3aym/visJS93VeWxg9PIpBpcSh97dqRUeQP7fgWlFkmojjBeQBj2PxmugzlWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:07:23.346242Z"},"content_sha256":"0615ec7f5cfc9db6ad4296de7fe7619d54bc0f2b8fd3789c8ed4448767d79c39","schema_version":"1.0","event_id":"sha256:0615ec7f5cfc9db6ad4296de7fe7619d54bc0f2b8fd3789c8ed4448767d79c39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MPOG7EV52Q4AK7PNI6INHYRNHQ/bundle.json","state_url":"https://pith.science/pith/MPOG7EV52Q4AK7PNI6INHYRNHQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MPOG7EV52Q4AK7PNI6INHYRNHQ/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-21T21:07:23Z","links":{"resolver":"https://pith.science/pith/MPOG7EV52Q4AK7PNI6INHYRNHQ","bundle":"https://pith.science/pith/MPOG7EV52Q4AK7PNI6INHYRNHQ/bundle.json","state":"https://pith.science/pith/MPOG7EV52Q4AK7PNI6INHYRNHQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MPOG7EV52Q4AK7PNI6INHYRNHQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MPOG7EV52Q4AK7PNI6INHYRNHQ","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":"76e2dbd8b2a78137a13d070ab778dde81f5b0a006743a54f3b14e7a377029780","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-16T12:52:47Z","title_canon_sha256":"8eeb5e12d8a3fe6afaa7fa09f5e4a8f841022ae62f734252b47d13dd6f99bf6d"},"schema_version":"1.0","source":{"id":"1708.04864","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04864","created_at":"2026-05-18T00:37:55Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04864v1","created_at":"2026-05-18T00:37:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04864","created_at":"2026-05-18T00:37:55Z"},{"alias_kind":"pith_short_12","alias_value":"MPOG7EV52Q4A","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MPOG7EV52Q4AK7PN","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MPOG7EV5","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:0615ec7f5cfc9db6ad4296de7fe7619d54bc0f2b8fd3789c8ed4448767d79c39","target":"graph","created_at":"2026-05-18T00:37:55Z","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 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 ","authors_text":"Emanuele Rodaro","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-16T12:52:47Z","title":"Synchronizing automata and the language of minimal reset words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04864","kind":"arxiv","version":1},"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:e68d21bbc4d47a3d831701c46039b53f1c2f89a7da02d18b2916c7d00a7cd969","target":"record","created_at":"2026-05-18T00:37:55Z","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":"76e2dbd8b2a78137a13d070ab778dde81f5b0a006743a54f3b14e7a377029780","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-16T12:52:47Z","title_canon_sha256":"8eeb5e12d8a3fe6afaa7fa09f5e4a8f841022ae62f734252b47d13dd6f99bf6d"},"schema_version":"1.0","source":{"id":"1708.04864","kind":"arxiv","version":1}},"canonical_sha256":"63dc6f92bdd438057ded4790d3e22d3c22d2526e0898df6f96aecbfada2a5930","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63dc6f92bdd438057ded4790d3e22d3c22d2526e0898df6f96aecbfada2a5930","first_computed_at":"2026-05-18T00:37:55.307672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:55.307672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i82dExLO6rqWIM0HVcXeYmHjOm0EsXyIF6bdVQkc5PvPFjepPKdqouObT+/JyKI64atyclxl4rjxih6uHuqSAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:55.308144Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04864","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e68d21bbc4d47a3d831701c46039b53f1c2f89a7da02d18b2916c7d00a7cd969","sha256:0615ec7f5cfc9db6ad4296de7fe7619d54bc0f2b8fd3789c8ed4448767d79c39"],"state_sha256":"97da4d098c573c2aa727bf7805f1036cec4096ef2930d931ff5995ba8d34a693"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TWKRgYWBfSuaGggJZ2LStQmXUuu0skqvuP3TGM4s4KW72VpCSQjV3XbPWNdls9QI3t0fMWEsIJhFIvtnktpiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T21:07:23.348216Z","bundle_sha256":"7563f08ba42e4997b4e8aeeaafa0709be79519ed4be8fdd617a56a26a1ed20ad"}}