{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ZJO5DO2KP6O7TFCRE7SRYQB3PO","short_pith_number":"pith:ZJO5DO2K","schema_version":"1.0","canonical_sha256":"ca5dd1bb4a7f9df9945127e51c403b7bbad41bf95a4a330a1ea3ddf515d97532","source":{"kind":"arxiv","id":"2211.16484","version":3},"attestation_state":"computed","paper":{"title":"A Finite Axiomatisation of Finite-State Automata Using String Diagrams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Fabio Zanasi, Robin Piedeleu","submitted_at":"2022-11-29T18:54:14Z","abstract_excerpt":"We develop a fully diagrammatic approach to finite-state automata, based on reinterpreting their usual state-transition graphical representation as a two-dimensional syntax of string diagrams. In this setting, we are able to provide a complete equational theory for language equivalence, with two notable features. First, the proposed axiomatisation is finite. Second, the Kleene star is a derived concept, as it can be decomposed into more primitive algebraic blocks."},"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":"2211.16484","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-11-29T18:54:14Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"a7127dfcbaddd35cdcf9063c0d8963e02f2bf76ff609599dbb7359b9e24d4017","abstract_canon_sha256":"2e0da4d79b223ad60306cd65a6f0cb0fe0863752ac5db89bb643445f28b1c60b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:00.541748Z","signature_b64":"BzL2ovE57ISGs+CSWwdUbi4+7N66k3JJ836LFjJW5QSyjtp1hmeFnR368/9WAYVJhv/T4poHKoR8RUIgjjC6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca5dd1bb4a7f9df9945127e51c403b7bbad41bf95a4a330a1ea3ddf515d97532","last_reissued_at":"2026-07-05T06:23:00.541310Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:00.541310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Finite Axiomatisation of Finite-State Automata Using String Diagrams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Fabio Zanasi, Robin Piedeleu","submitted_at":"2022-11-29T18:54:14Z","abstract_excerpt":"We develop a fully diagrammatic approach to finite-state automata, based on reinterpreting their usual state-transition graphical representation as a two-dimensional syntax of string diagrams. In this setting, we are able to provide a complete equational theory for language equivalence, with two notable features. First, the proposed axiomatisation is finite. Second, the Kleene star is a derived concept, as it can be decomposed into more primitive algebraic blocks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.16484","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.16484/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2211.16484","created_at":"2026-07-05T06:23:00.541380+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.16484v3","created_at":"2026-07-05T06:23:00.541380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.16484","created_at":"2026-07-05T06:23:00.541380+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJO5DO2KP6O7","created_at":"2026-07-05T06:23:00.541380+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJO5DO2KP6O7TFCR","created_at":"2026-07-05T06:23:00.541380+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJO5DO2K","created_at":"2026-07-05T06:23:00.541380+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08497","citing_title":"Foundations of Digital Circuits: Denotation, Operational, and Algebraic Semantics","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZJO5DO2KP6O7TFCRE7SRYQB3PO","json":"https://pith.science/pith/ZJO5DO2KP6O7TFCRE7SRYQB3PO.json","graph_json":"https://pith.science/api/pith-number/ZJO5DO2KP6O7TFCRE7SRYQB3PO/graph.json","events_json":"https://pith.science/api/pith-number/ZJO5DO2KP6O7TFCRE7SRYQB3PO/events.json","paper":"https://pith.science/paper/ZJO5DO2K"},"agent_actions":{"view_html":"https://pith.science/pith/ZJO5DO2KP6O7TFCRE7SRYQB3PO","download_json":"https://pith.science/pith/ZJO5DO2KP6O7TFCRE7SRYQB3PO.json","view_paper":"https://pith.science/paper/ZJO5DO2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.16484&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJO5DO2KP6O7TFCRE7SRYQB3PO/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJO5DO2KP6O7TFCRE7SRYQB3PO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJO5DO2KP6O7TFCRE7SRYQB3PO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJO5DO2KP6O7TFCRE7SRYQB3PO/action/storage_attestation","attest_author":"https://pith.science/pith/ZJO5DO2KP6O7TFCRE7SRYQB3PO/action/author_attestation","sign_citation":"https://pith.science/pith/ZJO5DO2KP6O7TFCRE7SRYQB3PO/action/citation_signature","submit_replication":"https://pith.science/pith/ZJO5DO2KP6O7TFCRE7SRYQB3PO/action/replication_record"}},"created_at":"2026-07-05T06:23:00.541380+00:00","updated_at":"2026-07-05T06:23:00.541380+00:00"}