{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:C5LAG4OPBLBLSHZZMY3VPCVNIX","short_pith_number":"pith:C5LAG4OP","canonical_record":{"source":{"id":"1612.01870","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2016-12-06T15:36:57Z","cross_cats_sorted":[],"title_canon_sha256":"a059f0c342d4050545fa84efa20c94de010850ed7dadefa9c6f643d90467a23b","abstract_canon_sha256":"37361ac8ebc3c0f08e690cf653e6a7c6a6990e1c83698ca232a2e44feb95a306"},"schema_version":"1.0"},"canonical_sha256":"17560371cf0ac2b91f396637578aad45ee4f292625814a33ac72f0e05bad28a1","source":{"kind":"arxiv","id":"1612.01870","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01870","created_at":"2026-05-18T00:13:07Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01870v1","created_at":"2026-05-18T00:13:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01870","created_at":"2026-05-18T00:13:07Z"},{"alias_kind":"pith_short_12","alias_value":"C5LAG4OPBLBL","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C5LAG4OPBLBLSHZZ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C5LAG4OP","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:C5LAG4OPBLBLSHZZMY3VPCVNIX","target":"record","payload":{"canonical_record":{"source":{"id":"1612.01870","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2016-12-06T15:36:57Z","cross_cats_sorted":[],"title_canon_sha256":"a059f0c342d4050545fa84efa20c94de010850ed7dadefa9c6f643d90467a23b","abstract_canon_sha256":"37361ac8ebc3c0f08e690cf653e6a7c6a6990e1c83698ca232a2e44feb95a306"},"schema_version":"1.0"},"canonical_sha256":"17560371cf0ac2b91f396637578aad45ee4f292625814a33ac72f0e05bad28a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:07.880141Z","signature_b64":"BZMcL2+ProDLe/xXj7Rsth6HDBtTDDeFe7YPDHjkSrA22X9hI4+Ntpist3D7CE0NMv3zYNPyGmczZ42DuPAvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17560371cf0ac2b91f396637578aad45ee4f292625814a33ac72f0e05bad28a1","last_reissued_at":"2026-05-18T00:13:07.879410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:07.879410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.01870","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:13:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UIclOGenT0oK6kjX+yIPKUcCVqwpyn/w7l/CJDIAfnvh8M4FIPj9HYJPxg3EqDlSb+iBUDPp454a1Psqi/7iAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:29:57.345521Z"},"content_sha256":"9cea2468d96b5a41e4d130d79f4e7f1e2c350202e8ab30d0b9116814c6c77a53","schema_version":"1.0","event_id":"sha256:9cea2468d96b5a41e4d130d79f4e7f1e2c350202e8ab30d0b9116814c6c77a53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:C5LAG4OPBLBLSHZZMY3VPCVNIX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the computational power of affine automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Abuzer Yakary{\\i}lmaz, Etienne Moutot, Mika Hirvensalo","submitted_at":"2016-12-06T15:36:57Z","abstract_excerpt":"We investigate the computational power of affine automata (AfAs) introduced in [4]. In particular, we present a simpler proof for how to change the cutpoint for any affine language and a method how to reduce error in bounded error case. Moreover, we address to the question of [4] by showing that any affine language can be recognized by an AfA with certain limitation on the entries of affine states and transition matrices. Lastly, we present the first languages shown to be not recognized by AfAs with bounded-error."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01870","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:13:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j/qTGw4hfmckFrwe9zb9w+5oMNzmtrF04MnzsaPJGghr+dI8oC+WVkaGdC4TeOn+cVbglJdzyF6prI/JtIwzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:29:57.345876Z"},"content_sha256":"4fd53a0471d229954b36299ded550608f3cbfb493996815810bc51a4f3a2f15d","schema_version":"1.0","event_id":"sha256:4fd53a0471d229954b36299ded550608f3cbfb493996815810bc51a4f3a2f15d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5LAG4OPBLBLSHZZMY3VPCVNIX/bundle.json","state_url":"https://pith.science/pith/C5LAG4OPBLBLSHZZMY3VPCVNIX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5LAG4OPBLBLSHZZMY3VPCVNIX/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-03T21:29:57Z","links":{"resolver":"https://pith.science/pith/C5LAG4OPBLBLSHZZMY3VPCVNIX","bundle":"https://pith.science/pith/C5LAG4OPBLBLSHZZMY3VPCVNIX/bundle.json","state":"https://pith.science/pith/C5LAG4OPBLBLSHZZMY3VPCVNIX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5LAG4OPBLBLSHZZMY3VPCVNIX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C5LAG4OPBLBLSHZZMY3VPCVNIX","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":"37361ac8ebc3c0f08e690cf653e6a7c6a6990e1c83698ca232a2e44feb95a306","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2016-12-06T15:36:57Z","title_canon_sha256":"a059f0c342d4050545fa84efa20c94de010850ed7dadefa9c6f643d90467a23b"},"schema_version":"1.0","source":{"id":"1612.01870","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01870","created_at":"2026-05-18T00:13:07Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01870v1","created_at":"2026-05-18T00:13:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01870","created_at":"2026-05-18T00:13:07Z"},{"alias_kind":"pith_short_12","alias_value":"C5LAG4OPBLBL","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C5LAG4OPBLBLSHZZ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C5LAG4OP","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:4fd53a0471d229954b36299ded550608f3cbfb493996815810bc51a4f3a2f15d","target":"graph","created_at":"2026-05-18T00:13:07Z","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":"We investigate the computational power of affine automata (AfAs) introduced in [4]. In particular, we present a simpler proof for how to change the cutpoint for any affine language and a method how to reduce error in bounded error case. Moreover, we address to the question of [4] by showing that any affine language can be recognized by an AfA with certain limitation on the entries of affine states and transition matrices. Lastly, we present the first languages shown to be not recognized by AfAs with bounded-error.","authors_text":"Abuzer Yakary{\\i}lmaz, Etienne Moutot, Mika Hirvensalo","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2016-12-06T15:36:57Z","title":"On the computational power of affine automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01870","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:9cea2468d96b5a41e4d130d79f4e7f1e2c350202e8ab30d0b9116814c6c77a53","target":"record","created_at":"2026-05-18T00:13:07Z","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":"37361ac8ebc3c0f08e690cf653e6a7c6a6990e1c83698ca232a2e44feb95a306","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2016-12-06T15:36:57Z","title_canon_sha256":"a059f0c342d4050545fa84efa20c94de010850ed7dadefa9c6f643d90467a23b"},"schema_version":"1.0","source":{"id":"1612.01870","kind":"arxiv","version":1}},"canonical_sha256":"17560371cf0ac2b91f396637578aad45ee4f292625814a33ac72f0e05bad28a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17560371cf0ac2b91f396637578aad45ee4f292625814a33ac72f0e05bad28a1","first_computed_at":"2026-05-18T00:13:07.879410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:07.879410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BZMcL2+ProDLe/xXj7Rsth6HDBtTDDeFe7YPDHjkSrA22X9hI4+Ntpist3D7CE0NMv3zYNPyGmczZ42DuPAvAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:07.880141Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01870","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cea2468d96b5a41e4d130d79f4e7f1e2c350202e8ab30d0b9116814c6c77a53","sha256:4fd53a0471d229954b36299ded550608f3cbfb493996815810bc51a4f3a2f15d"],"state_sha256":"d2c39cf56174040afc07d43733528a0ccc0feb85b0263fb9b1ecebf3a4370ba9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oiekqh5xsZOlxtxXKCnE/repTtCf2BViDCU2DfqEbhKcORxr2VfYUgagAM+8bXzH8SiQKf3W/DXskLVnGUPXAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:29:57.347839Z","bundle_sha256":"73872ac6e5ad2f3feee6e7918c2a01749e226d88cb22ce9c5d37bc69e3c4746b"}}