{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZD7LIOV2VPEBBZ43M2ONAZIQTC","short_pith_number":"pith:ZD7LIOV2","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"},"canonical_sha256":"c8feb43abaabc810e79b669cd0651098a58aca4b879c19bdb939bc4ee0013101","source":{"kind":"arxiv","id":"1903.00728","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00728","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00728v3","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00728","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZD7LIOV2VPEB","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZD7LIOV2VPEBBZ43","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZD7LIOV2","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZD7LIOV2VPEBBZ43M2ONAZIQTC","target":"record","payload":{"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"},"canonical_sha256":"c8feb43abaabc810e79b669cd0651098a58aca4b879c19bdb939bc4ee0013101","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"},"source_kind":"arxiv","source_id":"1903.00728","source_version":3,"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-17T23:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/AsdFcELuOp7iPlpVwkTeBRiJiiUt/P/VW0FLhnWQ5tJm5gDB+yw+bTQ9+EVDmwWvzVatBcFQ4xMbYPiQH3TAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:29:42.154655Z"},"content_sha256":"e09234a60a68dfebde4a3d3620b3993da77b95b119c99e7baab346655ebb7f99","schema_version":"1.0","event_id":"sha256:e09234a60a68dfebde4a3d3620b3993da77b95b119c99e7baab346655ebb7f99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZD7LIOV2VPEBBZ43M2ONAZIQTC","target":"graph","payload":{"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"},"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-17T23:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcvuiV2j4Hq1HF1TbYYQL92V16PZWafTwFwJ5DkH+dq7kc9Vv9j9V/H2nTNVf/6c5wOkUg35fjvcOL4kzBgTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:29:42.155003Z"},"content_sha256":"d0fcafaa88f6f611ee0fde3fff08197ca6ce494b83abe2719bd92ebbfdbefe7a","schema_version":"1.0","event_id":"sha256:d0fcafaa88f6f611ee0fde3fff08197ca6ce494b83abe2719bd92ebbfdbefe7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZD7LIOV2VPEBBZ43M2ONAZIQTC/bundle.json","state_url":"https://pith.science/pith/ZD7LIOV2VPEBBZ43M2ONAZIQTC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZD7LIOV2VPEBBZ43M2ONAZIQTC/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-03T14:29:42Z","links":{"resolver":"https://pith.science/pith/ZD7LIOV2VPEBBZ43M2ONAZIQTC","bundle":"https://pith.science/pith/ZD7LIOV2VPEBBZ43M2ONAZIQTC/bundle.json","state":"https://pith.science/pith/ZD7LIOV2VPEBBZ43M2ONAZIQTC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZD7LIOV2VPEBBZ43M2ONAZIQTC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZD7LIOV2VPEBBZ43M2ONAZIQTC","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":"bfdb5489d43b23fbfc105b01fab6fbfc0a74f0523922f3b5e6ecb331f48cf237","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-03-02T16:16:32Z","title_canon_sha256":"5028659dcdf62a6568aa09d46474b9c790a69d9f95d977391191ae95801b2c76"},"schema_version":"1.0","source":{"id":"1903.00728","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00728","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00728v3","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00728","created_at":"2026-05-17T23:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZD7LIOV2VPEB","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZD7LIOV2VPEBBZ43","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZD7LIOV2","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:d0fcafaa88f6f611ee0fde3fff08197ca6ce494b83abe2719bd92ebbfdbefe7a","target":"graph","created_at":"2026-05-17T23:46:45Z","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":"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","authors_text":"Anthony W. Lin, Chih-Duo Hong, Pablo Barcelo, Reino Niskanen, Xuan-Bach Le","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-03-02T16:16:32Z","title":"Monadic Decomposability of Regular Relations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00728","kind":"arxiv","version":3},"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:e09234a60a68dfebde4a3d3620b3993da77b95b119c99e7baab346655ebb7f99","target":"record","created_at":"2026-05-17T23:46:45Z","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":"bfdb5489d43b23fbfc105b01fab6fbfc0a74f0523922f3b5e6ecb331f48cf237","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-03-02T16:16:32Z","title_canon_sha256":"5028659dcdf62a6568aa09d46474b9c790a69d9f95d977391191ae95801b2c76"},"schema_version":"1.0","source":{"id":"1903.00728","kind":"arxiv","version":3}},"canonical_sha256":"c8feb43abaabc810e79b669cd0651098a58aca4b879c19bdb939bc4ee0013101","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8feb43abaabc810e79b669cd0651098a58aca4b879c19bdb939bc4ee0013101","first_computed_at":"2026-05-17T23:46:45.693334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:45.693334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oP618mrtG0c87m3k+jHYYQnOi3EOaC6l2ItY2ATCNeEjV8J4df1ygh3CFf4AIllU8kGULvUTC341XuOCtLBtBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:45.693815Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.00728","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e09234a60a68dfebde4a3d3620b3993da77b95b119c99e7baab346655ebb7f99","sha256:d0fcafaa88f6f611ee0fde3fff08197ca6ce494b83abe2719bd92ebbfdbefe7a"],"state_sha256":"39178c8bceae35df6078ca7fbf02bed9c69f67c18d10254d1820d305ea17d8c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DpCiD7Bt3eyVdPsLIJA9L+PoYa5voplGjkfbgu/KgzbA42kl4+ChB5lGH6Gikf4p0O7E1+U76YVmiY76g7icAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:29:42.156954Z","bundle_sha256":"126c6f869093c1f2f1bd8d2885efffbe21b91f3cb04b70cb7e2ea76a1cb303da"}}