{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BO4WZWZH276UAO2QE6B7GK6NGA","short_pith_number":"pith:BO4WZWZH","canonical_record":{"source":{"id":"1507.06070","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-22T06:39:14Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"65f18646833c21024b63dc2a22967c1b7d109fbeb8285e7a3a9da7fd34bd5e7f","abstract_canon_sha256":"84a241d211dbbfd58cf16c425471d8a43c55d088c87bc311ee6a379d7f7ea3a2"},"schema_version":"1.0"},"canonical_sha256":"0bb96cdb27d7fd403b502783f32bcd302768289570db6c259e85040f061bde61","source":{"kind":"arxiv","id":"1507.06070","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06070","created_at":"2026-05-18T01:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06070v2","created_at":"2026-05-18T01:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06070","created_at":"2026-05-18T01:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"BO4WZWZH276U","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BO4WZWZH276UAO2Q","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BO4WZWZH","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BO4WZWZH276UAO2QE6B7GK6NGA","target":"record","payload":{"canonical_record":{"source":{"id":"1507.06070","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-22T06:39:14Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"65f18646833c21024b63dc2a22967c1b7d109fbeb8285e7a3a9da7fd34bd5e7f","abstract_canon_sha256":"84a241d211dbbfd58cf16c425471d8a43c55d088c87bc311ee6a379d7f7ea3a2"},"schema_version":"1.0"},"canonical_sha256":"0bb96cdb27d7fd403b502783f32bcd302768289570db6c259e85040f061bde61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:05.903813Z","signature_b64":"jix3RODfZWXm9gop8Mj2wAR0DoX69h2T3nxWQgx/bunBrC2xUVqC1FDbhsTGy0F256SdIfudg8aqYOJ+AXdpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bb96cdb27d7fd403b502783f32bcd302768289570db6c259e85040f061bde61","last_reissued_at":"2026-05-18T01:04:05.903384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:05.903384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.06070","source_version":2,"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-18T01:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bgYW9iYlxPv+ZZYV97gnCrBreldewVDFin49a0EgjtfUWCjPxrSJQ3kYML3LlAjcU71sAVGLDN6eLeVS6Uw8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:46:49.996513Z"},"content_sha256":"1fcbeb9a5e93663227b3faf51346d58a8a443cecbaa852c71b3e81f5aafa3ea7","schema_version":"1.0","event_id":"sha256:1fcbeb9a5e93663227b3faf51346d58a8a443cecbaa852c71b3e81f5aafa3ea7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BO4WZWZH276UAO2QE6B7GK6NGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Cerny conjecture and 1-contracting automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"Henk Don","submitted_at":"2015-07-22T06:39:14Z","abstract_excerpt":"A deterministic finite automaton is synchronizing if there exists a word that sends all states of the automaton to the same state. \\v{C}ern\\'y conjectured in 1964 that a synchronizing automaton with $n$ states has a synchronizing word of length at most $(n-1)^2$. We introduce the notion of aperiodically $1-$contracting automata and prove that in these automata all subsets of the state set are reachable, so that in particular they are synchronizing. Furthermore, we give a sufficient condition under which the \\v{C}ern\\'y conjecture holds for aperiodically $1-$contracting automata. As a special c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06070","kind":"arxiv","version":2},"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-18T01:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UYd0+/V1YNAVCky61ENbkmwHhCOv4allBOI6NPZghg1udH8+MdrXSyQmPne2oIX8E5avdYeO+vikhYFxdOMJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:46:49.996860Z"},"content_sha256":"ee95fc7c58e9d50b7cf3b580e824d59227d37e02ff376cc954e747251cec6c45","schema_version":"1.0","event_id":"sha256:ee95fc7c58e9d50b7cf3b580e824d59227d37e02ff376cc954e747251cec6c45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BO4WZWZH276UAO2QE6B7GK6NGA/bundle.json","state_url":"https://pith.science/pith/BO4WZWZH276UAO2QE6B7GK6NGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BO4WZWZH276UAO2QE6B7GK6NGA/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-24T01:46:49Z","links":{"resolver":"https://pith.science/pith/BO4WZWZH276UAO2QE6B7GK6NGA","bundle":"https://pith.science/pith/BO4WZWZH276UAO2QE6B7GK6NGA/bundle.json","state":"https://pith.science/pith/BO4WZWZH276UAO2QE6B7GK6NGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BO4WZWZH276UAO2QE6B7GK6NGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BO4WZWZH276UAO2QE6B7GK6NGA","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":"84a241d211dbbfd58cf16c425471d8a43c55d088c87bc311ee6a379d7f7ea3a2","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-22T06:39:14Z","title_canon_sha256":"65f18646833c21024b63dc2a22967c1b7d109fbeb8285e7a3a9da7fd34bd5e7f"},"schema_version":"1.0","source":{"id":"1507.06070","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06070","created_at":"2026-05-18T01:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06070v2","created_at":"2026-05-18T01:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06070","created_at":"2026-05-18T01:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"BO4WZWZH276U","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BO4WZWZH276UAO2Q","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BO4WZWZH","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:ee95fc7c58e9d50b7cf3b580e824d59227d37e02ff376cc954e747251cec6c45","target":"graph","created_at":"2026-05-18T01:04:05Z","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":"A deterministic finite automaton is synchronizing if there exists a word that sends all states of the automaton to the same state. \\v{C}ern\\'y conjectured in 1964 that a synchronizing automaton with $n$ states has a synchronizing word of length at most $(n-1)^2$. We introduce the notion of aperiodically $1-$contracting automata and prove that in these automata all subsets of the state set are reachable, so that in particular they are synchronizing. Furthermore, we give a sufficient condition under which the \\v{C}ern\\'y conjecture holds for aperiodically $1-$contracting automata. As a special c","authors_text":"Henk Don","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-22T06:39:14Z","title":"The Cerny conjecture and 1-contracting automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06070","kind":"arxiv","version":2},"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:1fcbeb9a5e93663227b3faf51346d58a8a443cecbaa852c71b3e81f5aafa3ea7","target":"record","created_at":"2026-05-18T01:04:05Z","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":"84a241d211dbbfd58cf16c425471d8a43c55d088c87bc311ee6a379d7f7ea3a2","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-22T06:39:14Z","title_canon_sha256":"65f18646833c21024b63dc2a22967c1b7d109fbeb8285e7a3a9da7fd34bd5e7f"},"schema_version":"1.0","source":{"id":"1507.06070","kind":"arxiv","version":2}},"canonical_sha256":"0bb96cdb27d7fd403b502783f32bcd302768289570db6c259e85040f061bde61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bb96cdb27d7fd403b502783f32bcd302768289570db6c259e85040f061bde61","first_computed_at":"2026-05-18T01:04:05.903384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:05.903384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jix3RODfZWXm9gop8Mj2wAR0DoX69h2T3nxWQgx/bunBrC2xUVqC1FDbhsTGy0F256SdIfudg8aqYOJ+AXdpAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:05.903813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.06070","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fcbeb9a5e93663227b3faf51346d58a8a443cecbaa852c71b3e81f5aafa3ea7","sha256:ee95fc7c58e9d50b7cf3b580e824d59227d37e02ff376cc954e747251cec6c45"],"state_sha256":"564dfa5a28bb5ca8e4abba34bc54ba0d60be894399f5919d7f7b1628667cbce8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OpIPCYDaaqCPMyC9Unp/Xn8X9QiP5tXzNSbKdNUkzMRANRwpOX69dzzwBZJ+KWzo9AD7/WYKcQspbzoUspevCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T01:46:49.998942Z","bundle_sha256":"83c6823aff73fae0c33c20bc75cadbf9543c48a6e4fc45337c004c62a5f6da35"}}