{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JASPTRYVPKMAEUWPUHPEDRVTS4","short_pith_number":"pith:JASPTRYV","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"},"canonical_sha256":"4824f9c7157a980252cfa1de41c6b397340c56a0e5ea19542a9cb2734d43de32","source":{"kind":"arxiv","id":"1805.02154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02154","created_at":"2026-05-18T00:16:40Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02154v1","created_at":"2026-05-18T00:16:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02154","created_at":"2026-05-18T00:16:40Z"},{"alias_kind":"pith_short_12","alias_value":"JASPTRYVPKMA","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JASPTRYVPKMAEUWP","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JASPTRYV","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JASPTRYVPKMAEUWPUHPEDRVTS4","target":"record","payload":{"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"},"canonical_sha256":"4824f9c7157a980252cfa1de41c6b397340c56a0e5ea19542a9cb2734d43de32","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"},"source_kind":"arxiv","source_id":"1805.02154","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:16:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RyTGuDCn0SE6XDZEYPMTmXAsWUV+UXyLN32mpw2J8blARpEi2AxKAcM7+YFXUn9ksy/s3wM5/6zzkLzXtJDWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:25:50.314009Z"},"content_sha256":"a306bf9d1eb7f54368216f893f79fe74c887b4ed859162d525cd7fdf8ccedc02","schema_version":"1.0","event_id":"sha256:a306bf9d1eb7f54368216f893f79fe74c887b4ed859162d525cd7fdf8ccedc02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JASPTRYVPKMAEUWPUHPEDRVTS4","target":"graph","payload":{"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"},"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:16:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YPFaQlxAjn16KEQK0hRtXhgtrIrFhfb0TB2ojVXIk1lMfGKNTQXC1qfjjwp77MIEr6wg3MmpHUvf84N6ZBJsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:25:50.314382Z"},"content_sha256":"085a6260ca0c2c51d68e51274c904b4746f64ce90d1393f7fb72380ce287aad5","schema_version":"1.0","event_id":"sha256:085a6260ca0c2c51d68e51274c904b4746f64ce90d1393f7fb72380ce287aad5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JASPTRYVPKMAEUWPUHPEDRVTS4/bundle.json","state_url":"https://pith.science/pith/JASPTRYVPKMAEUWPUHPEDRVTS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JASPTRYVPKMAEUWPUHPEDRVTS4/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-01T11:25:50Z","links":{"resolver":"https://pith.science/pith/JASPTRYVPKMAEUWPUHPEDRVTS4","bundle":"https://pith.science/pith/JASPTRYVPKMAEUWPUHPEDRVTS4/bundle.json","state":"https://pith.science/pith/JASPTRYVPKMAEUWPUHPEDRVTS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JASPTRYVPKMAEUWPUHPEDRVTS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JASPTRYVPKMAEUWPUHPEDRVTS4","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":"e8032850457ab299fedd10a2982b407a93a765a87fff849114b97ff05c4b0372","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-06T05:59:40Z","title_canon_sha256":"4604c6516dc9f5ab542e25655a652e2984e46264fa5ccaaa71114bdb7863dbda"},"schema_version":"1.0","source":{"id":"1805.02154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02154","created_at":"2026-05-18T00:16:40Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02154v1","created_at":"2026-05-18T00:16:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02154","created_at":"2026-05-18T00:16:40Z"},{"alias_kind":"pith_short_12","alias_value":"JASPTRYVPKMA","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JASPTRYVPKMAEUWP","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JASPTRYV","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:085a6260ca0c2c51d68e51274c904b4746f64ce90d1393f7fb72380ce287aad5","target":"graph","created_at":"2026-05-18T00:16:40Z","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":"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","authors_text":"Cyril Nicaud, Mikhail V. Berlinkov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-06T05:59:40Z","title":"Synchronizing Random Almost-Group Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02154","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:a306bf9d1eb7f54368216f893f79fe74c887b4ed859162d525cd7fdf8ccedc02","target":"record","created_at":"2026-05-18T00:16:40Z","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":"e8032850457ab299fedd10a2982b407a93a765a87fff849114b97ff05c4b0372","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-06T05:59:40Z","title_canon_sha256":"4604c6516dc9f5ab542e25655a652e2984e46264fa5ccaaa71114bdb7863dbda"},"schema_version":"1.0","source":{"id":"1805.02154","kind":"arxiv","version":1}},"canonical_sha256":"4824f9c7157a980252cfa1de41c6b397340c56a0e5ea19542a9cb2734d43de32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4824f9c7157a980252cfa1de41c6b397340c56a0e5ea19542a9cb2734d43de32","first_computed_at":"2026-05-18T00:16:40.809520Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:40.809520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iehy05W7s2lMzGj4I7oE+dRw/2bf666QWjqgaKZ4/o2xXOHF6zzdgja9cjjtMjQf+bRLBab3ONI49xODkH7aDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:40.810134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a306bf9d1eb7f54368216f893f79fe74c887b4ed859162d525cd7fdf8ccedc02","sha256:085a6260ca0c2c51d68e51274c904b4746f64ce90d1393f7fb72380ce287aad5"],"state_sha256":"9b3ccd63f854aba3d8862e31bf38f6b71ed73e3d827811eff5375dc46ccf3238"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z47avNL1BwoCCxq0LtL+vKd1mAdkC0E3JlMpP7f6vUVff7EUa8mryyRqw63pqI4gMjhOczcIDVv5j7d27YsOCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:25:50.317006Z","bundle_sha256":"456cd86fa6b2b4c3ac941ab4f00fb8a7f0cbdf35ee484d031d89f1e95c0eb5c4"}}