{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZD7LIOV2VPEBBZ43M2ONAZIQTC","short_pith_number":"pith:ZD7LIOV2","schema_version":"1.0","canonical_sha256":"c8feb43abaabc810e79b669cd0651098a58aca4b879c19bdb939bc4ee0013101","source":{"kind":"arxiv","id":"1903.00728","version":3},"attestation_state":"computed","paper":{"title":"Monadic Decomposability of Regular Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Anthony W. Lin, Chih-Duo Hong, Pablo Barcelo, Reino Niskanen, Xuan-Bach Le","submitted_at":"2019-03-02T16:16:32Z","abstract_excerpt":"Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful tool for devising a decision procedure for a given logical theory. In this paper, we revisit a classical decision problem in automata theory: given a regular (a.k.a. synchronized rational) relation, determine whether it is recognizable, i.e., it has a monadic decomposition (that is, a representation as a boolean combination of cartesian products of regular languages). Regular relations are expressive formalisms which"},"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":"1903.00728","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-03-02T16:16:32Z","cross_cats_sorted":[],"title_canon_sha256":"5028659dcdf62a6568aa09d46474b9c790a69d9f95d977391191ae95801b2c76","abstract_canon_sha256":"bfdb5489d43b23fbfc105b01fab6fbfc0a74f0523922f3b5e6ecb331f48cf237"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:45.693815Z","signature_b64":"oP618mrtG0c87m3k+jHYYQnOi3EOaC6l2ItY2ATCNeEjV8J4df1ygh3CFf4AIllU8kGULvUTC341XuOCtLBtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8feb43abaabc810e79b669cd0651098a58aca4b879c19bdb939bc4ee0013101","last_reissued_at":"2026-05-17T23:46:45.693334Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:45.693334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monadic Decomposability of Regular Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Anthony W. Lin, Chih-Duo Hong, Pablo Barcelo, Reino Niskanen, Xuan-Bach Le","submitted_at":"2019-03-02T16:16:32Z","abstract_excerpt":"Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful tool for devising a decision procedure for a given logical theory. In this paper, we revisit a classical decision problem in automata theory: given a regular (a.k.a. synchronized rational) relation, determine whether it is recognizable, i.e., it has a monadic decomposition (that is, a representation as a boolean combination of cartesian products of regular languages). Regular relations are expressive formalisms which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00728","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":"1903.00728","created_at":"2026-05-17T23:46:45.693404+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.00728v3","created_at":"2026-05-17T23:46:45.693404+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00728","created_at":"2026-05-17T23:46:45.693404+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZD7LIOV2VPEB","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZD7LIOV2VPEBBZ43","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZD7LIOV2","created_at":"2026-05-18T12:33:33.725879+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/ZD7LIOV2VPEBBZ43M2ONAZIQTC","json":"https://pith.science/pith/ZD7LIOV2VPEBBZ43M2ONAZIQTC.json","graph_json":"https://pith.science/api/pith-number/ZD7LIOV2VPEBBZ43M2ONAZIQTC/graph.json","events_json":"https://pith.science/api/pith-number/ZD7LIOV2VPEBBZ43M2ONAZIQTC/events.json","paper":"https://pith.science/paper/ZD7LIOV2"},"agent_actions":{"view_html":"https://pith.science/pith/ZD7LIOV2VPEBBZ43M2ONAZIQTC","download_json":"https://pith.science/pith/ZD7LIOV2VPEBBZ43M2ONAZIQTC.json","view_paper":"https://pith.science/paper/ZD7LIOV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.00728&json=true","fetch_graph":"https://pith.science/api/pith-number/ZD7LIOV2VPEBBZ43M2ONAZIQTC/graph.json","fetch_events":"https://pith.science/api/pith-number/ZD7LIOV2VPEBBZ43M2ONAZIQTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZD7LIOV2VPEBBZ43M2ONAZIQTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZD7LIOV2VPEBBZ43M2ONAZIQTC/action/storage_attestation","attest_author":"https://pith.science/pith/ZD7LIOV2VPEBBZ43M2ONAZIQTC/action/author_attestation","sign_citation":"https://pith.science/pith/ZD7LIOV2VPEBBZ43M2ONAZIQTC/action/citation_signature","submit_replication":"https://pith.science/pith/ZD7LIOV2VPEBBZ43M2ONAZIQTC/action/replication_record"}},"created_at":"2026-05-17T23:46:45.693404+00:00","updated_at":"2026-05-17T23:46:45.693404+00:00"}