{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TJB3MQGWBU6BSL3H2ASHNBGH24","short_pith_number":"pith:TJB3MQGW","schema_version":"1.0","canonical_sha256":"9a43b640d60d3c192f67d0247684c7d7016ea82894e2f417aa59bfa9b09eba08","source":{"kind":"arxiv","id":"1201.1733","version":3},"attestation_state":"computed","paper":{"title":"On Conditional Decomposability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.SY","authors_text":"Jan H. van Schuppen, Jan Komenda, Tom\\'a\\v{s} Masopust","submitted_at":"2012-01-09T10:51:33Z","abstract_excerpt":"The requirement of a language to be conditionally decomposable is imposed on a specification language in the coordination supervisory control framework of discrete-event systems. In this paper, we present a polynomial-time algorithm for the verification whether a language is conditionally decomposable with respect to given alphabets. Moreover, we also present a polynomial-time algorithm to extend the common alphabet so that the language becomes conditionally decomposable. A relationship of conditional decomposability to nonblockingness of modular discrete-event systems is also discussed in thi"},"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":"1201.1733","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-01-09T10:51:33Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"14343dc90b0114d7fb0b7e43048a27141f0ce65aee951497154eea47718614ed","abstract_canon_sha256":"582c20c4647aeb814ab015adba14761113c0f67ddaa47ab24c3a75f246643da6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:55.285597Z","signature_b64":"B2h2vIZL6ngY4tiaI6KBBAg1V6YE4epk5G6VvM1h8wjlEJQrSpCGyWSjev6gq8ulQGvcaHpLPPG1lU4XMQQ2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a43b640d60d3c192f67d0247684c7d7016ea82894e2f417aa59bfa9b09eba08","last_reissued_at":"2026-05-18T02:30:55.284953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:55.284953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Conditional Decomposability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.SY","authors_text":"Jan H. van Schuppen, Jan Komenda, Tom\\'a\\v{s} Masopust","submitted_at":"2012-01-09T10:51:33Z","abstract_excerpt":"The requirement of a language to be conditionally decomposable is imposed on a specification language in the coordination supervisory control framework of discrete-event systems. In this paper, we present a polynomial-time algorithm for the verification whether a language is conditionally decomposable with respect to given alphabets. Moreover, we also present a polynomial-time algorithm to extend the common alphabet so that the language becomes conditionally decomposable. A relationship of conditional decomposability to nonblockingness of modular discrete-event systems is also discussed in thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1733","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":"1201.1733","created_at":"2026-05-18T02:30:55.285045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.1733v3","created_at":"2026-05-18T02:30:55.285045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1733","created_at":"2026-05-18T02:30:55.285045+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJB3MQGWBU6B","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJB3MQGWBU6BSL3H","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJB3MQGW","created_at":"2026-05-18T12:27:23.164592+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/TJB3MQGWBU6BSL3H2ASHNBGH24","json":"https://pith.science/pith/TJB3MQGWBU6BSL3H2ASHNBGH24.json","graph_json":"https://pith.science/api/pith-number/TJB3MQGWBU6BSL3H2ASHNBGH24/graph.json","events_json":"https://pith.science/api/pith-number/TJB3MQGWBU6BSL3H2ASHNBGH24/events.json","paper":"https://pith.science/paper/TJB3MQGW"},"agent_actions":{"view_html":"https://pith.science/pith/TJB3MQGWBU6BSL3H2ASHNBGH24","download_json":"https://pith.science/pith/TJB3MQGWBU6BSL3H2ASHNBGH24.json","view_paper":"https://pith.science/paper/TJB3MQGW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.1733&json=true","fetch_graph":"https://pith.science/api/pith-number/TJB3MQGWBU6BSL3H2ASHNBGH24/graph.json","fetch_events":"https://pith.science/api/pith-number/TJB3MQGWBU6BSL3H2ASHNBGH24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJB3MQGWBU6BSL3H2ASHNBGH24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJB3MQGWBU6BSL3H2ASHNBGH24/action/storage_attestation","attest_author":"https://pith.science/pith/TJB3MQGWBU6BSL3H2ASHNBGH24/action/author_attestation","sign_citation":"https://pith.science/pith/TJB3MQGWBU6BSL3H2ASHNBGH24/action/citation_signature","submit_replication":"https://pith.science/pith/TJB3MQGWBU6BSL3H2ASHNBGH24/action/replication_record"}},"created_at":"2026-05-18T02:30:55.285045+00:00","updated_at":"2026-05-18T02:30:55.285045+00:00"}