{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JASPTRYVPKMAEUWPUHPEDRVTS4","short_pith_number":"pith:JASPTRYV","schema_version":"1.0","canonical_sha256":"4824f9c7157a980252cfa1de41c6b397340c56a0e5ea19542a9cb2734d43de32","source":{"kind":"arxiv","id":"1805.02154","version":1},"attestation_state":"computed","paper":{"title":"Synchronizing Random Almost-Group Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Cyril Nicaud, Mikhail V. Berlinkov","submitted_at":"2018-05-06T05:59:40Z","abstract_excerpt":"In this paper we address the question of synchronizing random automata in the critical settings of almost-group automata. Group automata are automata where all letters act as permutations on the set of states, and they are not synchronizing (unless they have one state). In almost-group automata, one of the letters acts as a permutation on $n-1$ states, and the others as permutations. We prove that this small change is enough for automata to become synchronizing with high probability. More precisely, we establish that the probability that a strongly connected almost-group automaton is not synch"},"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":"1805.02154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-06T05:59:40Z","cross_cats_sorted":[],"title_canon_sha256":"4604c6516dc9f5ab542e25655a652e2984e46264fa5ccaaa71114bdb7863dbda","abstract_canon_sha256":"e8032850457ab299fedd10a2982b407a93a765a87fff849114b97ff05c4b0372"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:40.810134Z","signature_b64":"iehy05W7s2lMzGj4I7oE+dRw/2bf666QWjqgaKZ4/o2xXOHF6zzdgja9cjjtMjQf+bRLBab3ONI49xODkH7aDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4824f9c7157a980252cfa1de41c6b397340c56a0e5ea19542a9cb2734d43de32","last_reissued_at":"2026-05-18T00:16:40.809520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:40.809520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synchronizing Random Almost-Group Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Cyril Nicaud, Mikhail V. Berlinkov","submitted_at":"2018-05-06T05:59:40Z","abstract_excerpt":"In this paper we address the question of synchronizing random automata in the critical settings of almost-group automata. Group automata are automata where all letters act as permutations on the set of states, and they are not synchronizing (unless they have one state). In almost-group automata, one of the letters acts as a permutation on $n-1$ states, and the others as permutations. We prove that this small change is enough for automata to become synchronizing with high probability. More precisely, we establish that the probability that a strongly connected almost-group automaton is not synch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02154","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":"1805.02154","created_at":"2026-05-18T00:16:40.809612+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.02154v1","created_at":"2026-05-18T00:16:40.809612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02154","created_at":"2026-05-18T00:16:40.809612+00:00"},{"alias_kind":"pith_short_12","alias_value":"JASPTRYVPKMA","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JASPTRYVPKMAEUWP","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JASPTRYV","created_at":"2026-05-18T12:32:31.084164+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/JASPTRYVPKMAEUWPUHPEDRVTS4","json":"https://pith.science/pith/JASPTRYVPKMAEUWPUHPEDRVTS4.json","graph_json":"https://pith.science/api/pith-number/JASPTRYVPKMAEUWPUHPEDRVTS4/graph.json","events_json":"https://pith.science/api/pith-number/JASPTRYVPKMAEUWPUHPEDRVTS4/events.json","paper":"https://pith.science/paper/JASPTRYV"},"agent_actions":{"view_html":"https://pith.science/pith/JASPTRYVPKMAEUWPUHPEDRVTS4","download_json":"https://pith.science/pith/JASPTRYVPKMAEUWPUHPEDRVTS4.json","view_paper":"https://pith.science/paper/JASPTRYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.02154&json=true","fetch_graph":"https://pith.science/api/pith-number/JASPTRYVPKMAEUWPUHPEDRVTS4/graph.json","fetch_events":"https://pith.science/api/pith-number/JASPTRYVPKMAEUWPUHPEDRVTS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JASPTRYVPKMAEUWPUHPEDRVTS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JASPTRYVPKMAEUWPUHPEDRVTS4/action/storage_attestation","attest_author":"https://pith.science/pith/JASPTRYVPKMAEUWPUHPEDRVTS4/action/author_attestation","sign_citation":"https://pith.science/pith/JASPTRYVPKMAEUWPUHPEDRVTS4/action/citation_signature","submit_replication":"https://pith.science/pith/JASPTRYVPKMAEUWPUHPEDRVTS4/action/replication_record"}},"created_at":"2026-05-18T00:16:40.809612+00:00","updated_at":"2026-05-18T00:16:40.809612+00:00"}