{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7WBIJ6MPKV6MG3D75MAVOX3ERF","short_pith_number":"pith:7WBIJ6MP","schema_version":"1.0","canonical_sha256":"fd8284f98f557cc36c7feb01575f648949160b8389fb51a971bfa4064f76ad3f","source":{"kind":"arxiv","id":"1502.04898","version":1},"attestation_state":"computed","paper":{"title":"Recognisable languages over monads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Miko{\\l}aj Boja\\'nczyk","submitted_at":"2015-02-17T14:07:12Z","abstract_excerpt":"The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of composing structures into bigger structures. It so happens that category theory has an abstract concept for this, namely a monad. The goal of this paper is to propose monads as a unifying framework for discussing existing algebras and designing new algebras."},"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":"1502.04898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-02-17T14:07:12Z","cross_cats_sorted":[],"title_canon_sha256":"0c38ea63d4dad45612d55eda49750656d4839aacbe7560261d1ebe75d2aa94c8","abstract_canon_sha256":"aad17fe2c4f2e54cea473b93373290a7c121f9be77a48c9250f35d50a38ef532"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:53.590347Z","signature_b64":"xVMY4iWgF/tX4psqkLByBp5cMK3IhR3MUos6Q690Z85pprwys2CbcYWT++X6b8W1ikZ+qzlzXnX8TXEytjutAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd8284f98f557cc36c7feb01575f648949160b8389fb51a971bfa4064f76ad3f","last_reissued_at":"2026-05-18T02:26:53.589783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:53.589783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recognisable languages over monads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Miko{\\l}aj Boja\\'nczyk","submitted_at":"2015-02-17T14:07:12Z","abstract_excerpt":"The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of composing structures into bigger structures. It so happens that category theory has an abstract concept for this, namely a monad. The goal of this paper is to propose monads as a unifying framework for discussing existing algebras and designing new algebras."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04898","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.04898","created_at":"2026-05-18T02:26:53.589861+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.04898v1","created_at":"2026-05-18T02:26:53.589861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04898","created_at":"2026-05-18T02:26:53.589861+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WBIJ6MPKV6M","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WBIJ6MPKV6MG3D7","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WBIJ6MP","created_at":"2026-05-18T12:29:10.953037+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.17536","citing_title":"Dynamic Membership for Regular Tree Languages","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7WBIJ6MPKV6MG3D75MAVOX3ERF","json":"https://pith.science/pith/7WBIJ6MPKV6MG3D75MAVOX3ERF.json","graph_json":"https://pith.science/api/pith-number/7WBIJ6MPKV6MG3D75MAVOX3ERF/graph.json","events_json":"https://pith.science/api/pith-number/7WBIJ6MPKV6MG3D75MAVOX3ERF/events.json","paper":"https://pith.science/paper/7WBIJ6MP"},"agent_actions":{"view_html":"https://pith.science/pith/7WBIJ6MPKV6MG3D75MAVOX3ERF","download_json":"https://pith.science/pith/7WBIJ6MPKV6MG3D75MAVOX3ERF.json","view_paper":"https://pith.science/paper/7WBIJ6MP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.04898&json=true","fetch_graph":"https://pith.science/api/pith-number/7WBIJ6MPKV6MG3D75MAVOX3ERF/graph.json","fetch_events":"https://pith.science/api/pith-number/7WBIJ6MPKV6MG3D75MAVOX3ERF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WBIJ6MPKV6MG3D75MAVOX3ERF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WBIJ6MPKV6MG3D75MAVOX3ERF/action/storage_attestation","attest_author":"https://pith.science/pith/7WBIJ6MPKV6MG3D75MAVOX3ERF/action/author_attestation","sign_citation":"https://pith.science/pith/7WBIJ6MPKV6MG3D75MAVOX3ERF/action/citation_signature","submit_replication":"https://pith.science/pith/7WBIJ6MPKV6MG3D75MAVOX3ERF/action/replication_record"}},"created_at":"2026-05-18T02:26:53.589861+00:00","updated_at":"2026-05-18T02:26:53.589861+00:00"}