{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5HN5I7R46LWU6MKAZZQI2OEJZZ","short_pith_number":"pith:5HN5I7R4","schema_version":"1.0","canonical_sha256":"e9dbd47e3cf2ed4f3140ce608d3889ce6445eab598f91e352ae3662ec1b25d49","source":{"kind":"arxiv","id":"1608.01268","version":1},"attestation_state":"computed","paper":{"title":"Synchronizing Automata with Extremal Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Andrzej Kisielewicz, Marek Szyku{\\l}a","submitted_at":"2016-08-03T17:59:19Z","abstract_excerpt":"We present a few classes of synchronizing automata exhibiting certain extremal properties with regard to synchronization. The first is a series of automata with subsets whose shortest extending words are of length $\\varTheta(n^2)$, where $n$ is the number of states of the automaton. This disproves a conjecture that every subset in a strongly connected synchronizing automaton is $cn$-extendable, for some constant $c$, and in particular, shows that the cubic upper bound on the length of the shortest reset words cannot be improved generally by means of the extension method. A detailed analysis sh"},"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":"1608.01268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-08-03T17:59:19Z","cross_cats_sorted":[],"title_canon_sha256":"d78d6ecdc74aad79425e617afcf0958080a3a6be109890aa11698b7df8b0b639","abstract_canon_sha256":"d4fb0ee44b582bf3ee4e630009550c11bd25edd019a1f4ad333203692be97bdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:56.017858Z","signature_b64":"1CBwGSa3g3dJPK+LJNf9ot9yFuGnfDyodiuXUW9PvpuCvvsVWcJrKH6lUdL26WJelPU5/flTZze+Uf0/TH3PAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9dbd47e3cf2ed4f3140ce608d3889ce6445eab598f91e352ae3662ec1b25d49","last_reissued_at":"2026-05-18T01:09:56.017119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:56.017119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synchronizing Automata with Extremal Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Andrzej Kisielewicz, Marek Szyku{\\l}a","submitted_at":"2016-08-03T17:59:19Z","abstract_excerpt":"We present a few classes of synchronizing automata exhibiting certain extremal properties with regard to synchronization. The first is a series of automata with subsets whose shortest extending words are of length $\\varTheta(n^2)$, where $n$ is the number of states of the automaton. This disproves a conjecture that every subset in a strongly connected synchronizing automaton is $cn$-extendable, for some constant $c$, and in particular, shows that the cubic upper bound on the length of the shortest reset words cannot be improved generally by means of the extension method. A detailed analysis sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01268","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":"1608.01268","created_at":"2026-05-18T01:09:56.017224+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.01268v1","created_at":"2026-05-18T01:09:56.017224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01268","created_at":"2026-05-18T01:09:56.017224+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HN5I7R46LWU","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HN5I7R46LWU6MKA","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HN5I7R4","created_at":"2026-05-18T12:30:01.593930+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/5HN5I7R46LWU6MKAZZQI2OEJZZ","json":"https://pith.science/pith/5HN5I7R46LWU6MKAZZQI2OEJZZ.json","graph_json":"https://pith.science/api/pith-number/5HN5I7R46LWU6MKAZZQI2OEJZZ/graph.json","events_json":"https://pith.science/api/pith-number/5HN5I7R46LWU6MKAZZQI2OEJZZ/events.json","paper":"https://pith.science/paper/5HN5I7R4"},"agent_actions":{"view_html":"https://pith.science/pith/5HN5I7R46LWU6MKAZZQI2OEJZZ","download_json":"https://pith.science/pith/5HN5I7R46LWU6MKAZZQI2OEJZZ.json","view_paper":"https://pith.science/paper/5HN5I7R4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.01268&json=true","fetch_graph":"https://pith.science/api/pith-number/5HN5I7R46LWU6MKAZZQI2OEJZZ/graph.json","fetch_events":"https://pith.science/api/pith-number/5HN5I7R46LWU6MKAZZQI2OEJZZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HN5I7R46LWU6MKAZZQI2OEJZZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HN5I7R46LWU6MKAZZQI2OEJZZ/action/storage_attestation","attest_author":"https://pith.science/pith/5HN5I7R46LWU6MKAZZQI2OEJZZ/action/author_attestation","sign_citation":"https://pith.science/pith/5HN5I7R46LWU6MKAZZQI2OEJZZ/action/citation_signature","submit_replication":"https://pith.science/pith/5HN5I7R46LWU6MKAZZQI2OEJZZ/action/replication_record"}},"created_at":"2026-05-18T01:09:56.017224+00:00","updated_at":"2026-05-18T01:09:56.017224+00:00"}