{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PF2QTDFRA3UUIEBARQT25IQPBA","short_pith_number":"pith:PF2QTDFR","schema_version":"1.0","canonical_sha256":"7975098cb106e94410208c27aea20f08127400c85176967764fd131fdd7c73bc","source":{"kind":"arxiv","id":"1607.04025","version":1},"attestation_state":"computed","paper":{"title":"Experiments with Synchronizing Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Andrzej Kisielewicz, Jakub Kowalski, Marek Szyku{\\l}a","submitted_at":"2016-07-14T08:11:26Z","abstract_excerpt":"We have improved an algorithm generating synchronizing automata with a large length of the shortest reset words. This has been done by refining some known results concerning bounds on the reset length. Our improvements make possible to consider a number of conjectures and open questions concerning synchronizing automata, checking them for automata with a small number of states and discussing the results. In particular, we have verified the \\v{C}ern\\'y conjecture for all binary automata with at most 12 states, and all ternary automata with at most 8 states."},"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":"1607.04025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-07-14T08:11:26Z","cross_cats_sorted":[],"title_canon_sha256":"01ab80d11b1454a58f283790be654a4851b1a03c24b5cb21faa5ed4b3be1e858","abstract_canon_sha256":"8c3434d9524b4ee800f3c96e3468f7ea5bec91f0322180555361d876016a8b1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:04.291469Z","signature_b64":"tEOHnPYyk0besInqMYaG30nGGQjxyhKsDsrlVn+Tey8H7Wg56cXdrMSINok94hh2wz8+J9KCPyigM4LMZNVdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7975098cb106e94410208c27aea20f08127400c85176967764fd131fdd7c73bc","last_reissued_at":"2026-05-18T01:11:04.290944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:04.290944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Experiments with Synchronizing Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Andrzej Kisielewicz, Jakub Kowalski, Marek Szyku{\\l}a","submitted_at":"2016-07-14T08:11:26Z","abstract_excerpt":"We have improved an algorithm generating synchronizing automata with a large length of the shortest reset words. This has been done by refining some known results concerning bounds on the reset length. Our improvements make possible to consider a number of conjectures and open questions concerning synchronizing automata, checking them for automata with a small number of states and discussing the results. In particular, we have verified the \\v{C}ern\\'y conjecture for all binary automata with at most 12 states, and all ternary automata with at most 8 states."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04025","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":"1607.04025","created_at":"2026-05-18T01:11:04.291022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04025v1","created_at":"2026-05-18T01:11:04.291022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04025","created_at":"2026-05-18T01:11:04.291022+00:00"},{"alias_kind":"pith_short_12","alias_value":"PF2QTDFRA3UU","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PF2QTDFRA3UUIEBA","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PF2QTDFR","created_at":"2026-05-18T12:30:39.010887+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/PF2QTDFRA3UUIEBARQT25IQPBA","json":"https://pith.science/pith/PF2QTDFRA3UUIEBARQT25IQPBA.json","graph_json":"https://pith.science/api/pith-number/PF2QTDFRA3UUIEBARQT25IQPBA/graph.json","events_json":"https://pith.science/api/pith-number/PF2QTDFRA3UUIEBARQT25IQPBA/events.json","paper":"https://pith.science/paper/PF2QTDFR"},"agent_actions":{"view_html":"https://pith.science/pith/PF2QTDFRA3UUIEBARQT25IQPBA","download_json":"https://pith.science/pith/PF2QTDFRA3UUIEBARQT25IQPBA.json","view_paper":"https://pith.science/paper/PF2QTDFR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04025&json=true","fetch_graph":"https://pith.science/api/pith-number/PF2QTDFRA3UUIEBARQT25IQPBA/graph.json","fetch_events":"https://pith.science/api/pith-number/PF2QTDFRA3UUIEBARQT25IQPBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PF2QTDFRA3UUIEBARQT25IQPBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PF2QTDFRA3UUIEBARQT25IQPBA/action/storage_attestation","attest_author":"https://pith.science/pith/PF2QTDFRA3UUIEBARQT25IQPBA/action/author_attestation","sign_citation":"https://pith.science/pith/PF2QTDFRA3UUIEBARQT25IQPBA/action/citation_signature","submit_replication":"https://pith.science/pith/PF2QTDFRA3UUIEBARQT25IQPBA/action/replication_record"}},"created_at":"2026-05-18T01:11:04.291022+00:00","updated_at":"2026-05-18T01:11:04.291022+00:00"}