{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3EZDPIRYMAODML3CDFXMXSHJ5Z","short_pith_number":"pith:3EZDPIRY","schema_version":"1.0","canonical_sha256":"d93237a238601c362f62196ecbc8e9ee50c3b6be3abe6c4f6d88040cf7f92fa3","source":{"kind":"arxiv","id":"1703.04281","version":3},"attestation_state":"computed","paper":{"title":"Exact Affine Counter Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","quant-ph"],"primary_cat":"cs.FL","authors_text":"Abuzer Yakary{\\i}lmaz (University of Latvia, Art, Center for Quantum Computer Science, Center for Quantum Computer Science), Faculty of Computing, Institute of Computational Mathematics, IT), Jevg\\=enijs Vihrovs (University of Latvia, Kamil Khadiev (University of Latvia, Kazan Federal University, Kri\\v{s}j\\=anis Pr\\=usis (University of Latvia, Masaki Nakanishi (Department of Education, Science, Yamagata University)","submitted_at":"2017-03-13T07:50:35Z","abstract_excerpt":"We introduce an affine generalization of counter automata, and analyze their ability as well as affine finite automata. Our contributions are as follows. We show that there is a language that can be recognized by exact realtime affine counter automata but by neither 1-way deterministic pushdown automata nor realtime deterministic k-counter automata. We also show that a certain promise problem, which is conjectured not to be solved by two-way quantum finite automata in polynomial time, can be solved by Las Vegas affine finite automata. Lastly, we show that how a counter helps for affine finite "},"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":"1703.04281","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-03-13T07:50:35Z","cross_cats_sorted":["cs.CC","quant-ph"],"title_canon_sha256":"67ea6a811c2d14d1fa19722290f25acf839d04a1a628d436451c79f47d59cb7e","abstract_canon_sha256":"c0174119bd9bf06ce52301290ec1687e9a3d791a975c59dbb83933d285ae3ac9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:42.057556Z","signature_b64":"V/WzDMhAlwo2/ZTxvL+1zNTSK7NuQOSphk9QsV5KAID7xVXdEXb15z0VDcx8n6oux62lrEwmdwA3jSEAbFmuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d93237a238601c362f62196ecbc8e9ee50c3b6be3abe6c4f6d88040cf7f92fa3","last_reissued_at":"2026-05-18T00:37:42.056987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:42.056987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Affine Counter Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","quant-ph"],"primary_cat":"cs.FL","authors_text":"Abuzer Yakary{\\i}lmaz (University of Latvia, Art, Center for Quantum Computer Science, Center for Quantum Computer Science), Faculty of Computing, Institute of Computational Mathematics, IT), Jevg\\=enijs Vihrovs (University of Latvia, Kamil Khadiev (University of Latvia, Kazan Federal University, Kri\\v{s}j\\=anis Pr\\=usis (University of Latvia, Masaki Nakanishi (Department of Education, Science, Yamagata University)","submitted_at":"2017-03-13T07:50:35Z","abstract_excerpt":"We introduce an affine generalization of counter automata, and analyze their ability as well as affine finite automata. Our contributions are as follows. We show that there is a language that can be recognized by exact realtime affine counter automata but by neither 1-way deterministic pushdown automata nor realtime deterministic k-counter automata. We also show that a certain promise problem, which is conjectured not to be solved by two-way quantum finite automata in polynomial time, can be solved by Las Vegas affine finite automata. Lastly, we show that how a counter helps for affine finite "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04281","kind":"arxiv","version":3},"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":"1703.04281","created_at":"2026-05-18T00:37:42.057083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.04281v3","created_at":"2026-05-18T00:37:42.057083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04281","created_at":"2026-05-18T00:37:42.057083+00:00"},{"alias_kind":"pith_short_12","alias_value":"3EZDPIRYMAOD","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3EZDPIRYMAODML3C","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3EZDPIRY","created_at":"2026-05-18T12:30:58.224056+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/3EZDPIRYMAODML3CDFXMXSHJ5Z","json":"https://pith.science/pith/3EZDPIRYMAODML3CDFXMXSHJ5Z.json","graph_json":"https://pith.science/api/pith-number/3EZDPIRYMAODML3CDFXMXSHJ5Z/graph.json","events_json":"https://pith.science/api/pith-number/3EZDPIRYMAODML3CDFXMXSHJ5Z/events.json","paper":"https://pith.science/paper/3EZDPIRY"},"agent_actions":{"view_html":"https://pith.science/pith/3EZDPIRYMAODML3CDFXMXSHJ5Z","download_json":"https://pith.science/pith/3EZDPIRYMAODML3CDFXMXSHJ5Z.json","view_paper":"https://pith.science/paper/3EZDPIRY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.04281&json=true","fetch_graph":"https://pith.science/api/pith-number/3EZDPIRYMAODML3CDFXMXSHJ5Z/graph.json","fetch_events":"https://pith.science/api/pith-number/3EZDPIRYMAODML3CDFXMXSHJ5Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3EZDPIRYMAODML3CDFXMXSHJ5Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3EZDPIRYMAODML3CDFXMXSHJ5Z/action/storage_attestation","attest_author":"https://pith.science/pith/3EZDPIRYMAODML3CDFXMXSHJ5Z/action/author_attestation","sign_citation":"https://pith.science/pith/3EZDPIRYMAODML3CDFXMXSHJ5Z/action/citation_signature","submit_replication":"https://pith.science/pith/3EZDPIRYMAODML3CDFXMXSHJ5Z/action/replication_record"}},"created_at":"2026-05-18T00:37:42.057083+00:00","updated_at":"2026-05-18T00:37:42.057083+00:00"}