{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:R5UXOXK4E3HTBCKSCGLD3QGUPQ","short_pith_number":"pith:R5UXOXK4","schema_version":"1.0","canonical_sha256":"8f69775d5c26cf30895211963dc0d47c0af05c36bb9c28707e679d2f41d277d2","source":{"kind":"arxiv","id":"0710.4743","version":1},"attestation_state":"computed","paper":{"title":"Efficient Solution of Language Equations Using Partitioned Representations","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alan Mishchenko, Nina Yevtushenko, Robert Brayton, Roland Jiang, Tiziano Villa","submitted_at":"2007-10-25T09:45:31Z","abstract_excerpt":"A class of discrete event synthesis problems can be reduced to solving language equations f . X ⊆ S, where F is the fixed component and S the specification. Sequential synthesis deals with FSMs when the automata for F and S are prefix closed, and are naturally represented by multi-level networks with latches. For this special case, we present an efficient computation, using partitioned representations, of the most general prefix-closed solution of the above class of language equations. The transition and the output relations of the FSMs for F and S in their partitioned form are represente"},"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":"0710.4743","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2007-10-25T09:45:31Z","cross_cats_sorted":[],"title_canon_sha256":"96fce2678c659dc098979d95b9e42530d6431c75944b42b0d3093eb012c81cc3","abstract_canon_sha256":"40bba70a8dc39ed484b08084a91ba2204ddf21091f428ff56cd0d31416e1d8b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:05.484952Z","signature_b64":"rL3uBCV9LrHwC58SR1K+EFdrg/aTyyPkbucdgypAWiqgbk1zkuxb7VMJtgHRwdFJuIo5p9xUFnetCbvE/vd8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f69775d5c26cf30895211963dc0d47c0af05c36bb9c28707e679d2f41d277d2","last_reissued_at":"2026-05-18T04:09:05.484252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:05.484252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Solution of Language Equations Using Partitioned Representations","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alan Mishchenko, Nina Yevtushenko, Robert Brayton, Roland Jiang, Tiziano Villa","submitted_at":"2007-10-25T09:45:31Z","abstract_excerpt":"A class of discrete event synthesis problems can be reduced to solving language equations f . X ⊆ S, where F is the fixed component and S the specification. Sequential synthesis deals with FSMs when the automata for F and S are prefix closed, and are naturally represented by multi-level networks with latches. For this special case, we present an efficient computation, using partitioned representations, of the most general prefix-closed solution of the above class of language equations. The transition and the output relations of the FSMs for F and S in their partitioned form are represente"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.4743","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":"0710.4743","created_at":"2026-05-18T04:09:05.484362+00:00"},{"alias_kind":"arxiv_version","alias_value":"0710.4743v1","created_at":"2026-05-18T04:09:05.484362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.4743","created_at":"2026-05-18T04:09:05.484362+00:00"},{"alias_kind":"pith_short_12","alias_value":"R5UXOXK4E3HT","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"R5UXOXK4E3HTBCKS","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"R5UXOXK4","created_at":"2026-05-18T12:25:56.245647+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/R5UXOXK4E3HTBCKSCGLD3QGUPQ","json":"https://pith.science/pith/R5UXOXK4E3HTBCKSCGLD3QGUPQ.json","graph_json":"https://pith.science/api/pith-number/R5UXOXK4E3HTBCKSCGLD3QGUPQ/graph.json","events_json":"https://pith.science/api/pith-number/R5UXOXK4E3HTBCKSCGLD3QGUPQ/events.json","paper":"https://pith.science/paper/R5UXOXK4"},"agent_actions":{"view_html":"https://pith.science/pith/R5UXOXK4E3HTBCKSCGLD3QGUPQ","download_json":"https://pith.science/pith/R5UXOXK4E3HTBCKSCGLD3QGUPQ.json","view_paper":"https://pith.science/paper/R5UXOXK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0710.4743&json=true","fetch_graph":"https://pith.science/api/pith-number/R5UXOXK4E3HTBCKSCGLD3QGUPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/R5UXOXK4E3HTBCKSCGLD3QGUPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R5UXOXK4E3HTBCKSCGLD3QGUPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R5UXOXK4E3HTBCKSCGLD3QGUPQ/action/storage_attestation","attest_author":"https://pith.science/pith/R5UXOXK4E3HTBCKSCGLD3QGUPQ/action/author_attestation","sign_citation":"https://pith.science/pith/R5UXOXK4E3HTBCKSCGLD3QGUPQ/action/citation_signature","submit_replication":"https://pith.science/pith/R5UXOXK4E3HTBCKSCGLD3QGUPQ/action/replication_record"}},"created_at":"2026-05-18T04:09:05.484362+00:00","updated_at":"2026-05-18T04:09:05.484362+00:00"}