{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:R5UXOXK4E3HTBCKSCGLD3QGUPQ","short_pith_number":"pith:R5UXOXK4","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"},"canonical_sha256":"8f69775d5c26cf30895211963dc0d47c0af05c36bb9c28707e679d2f41d277d2","source":{"kind":"arxiv","id":"0710.4743","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0710.4743","created_at":"2026-05-18T04:09:05Z"},{"alias_kind":"arxiv_version","alias_value":"0710.4743v1","created_at":"2026-05-18T04:09:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.4743","created_at":"2026-05-18T04:09:05Z"},{"alias_kind":"pith_short_12","alias_value":"R5UXOXK4E3HT","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"R5UXOXK4E3HTBCKS","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"R5UXOXK4","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:R5UXOXK4E3HTBCKSCGLD3QGUPQ","target":"record","payload":{"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"},"canonical_sha256":"8f69775d5c26cf30895211963dc0d47c0af05c36bb9c28707e679d2f41d277d2","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"},"source_kind":"arxiv","source_id":"0710.4743","source_version":1,"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-18T04:09:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c4ok9x3NPsDb03758Ylu9J4nqUvtSlPNTL4clQ1+uFWUWmo7K+jDELobxdQbH6zpJr+1sXJGzA7eFvvgm1q7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:01:20.718861Z"},"content_sha256":"74a50710981275e127cdcceb55069e464de3232769190019712fa754bf4394fd","schema_version":"1.0","event_id":"sha256:74a50710981275e127cdcceb55069e464de3232769190019712fa754bf4394fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:R5UXOXK4E3HTBCKSCGLD3QGUPQ","target":"graph","payload":{"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"},"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-18T04:09:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yv+kTU1RiqdncXZHchRPDqcCh3JHRuB4zi1Yn8gqksyEAikuvPhQ2IJ5aFnnupAxbCcaVcOkI2kkSnqWKMQ9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:01:20.719725Z"},"content_sha256":"0a346025f5912b2664a9136bbf1efe0d10e98be6b93e44de3bf6edd817449ee6","schema_version":"1.0","event_id":"sha256:0a346025f5912b2664a9136bbf1efe0d10e98be6b93e44de3bf6edd817449ee6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R5UXOXK4E3HTBCKSCGLD3QGUPQ/bundle.json","state_url":"https://pith.science/pith/R5UXOXK4E3HTBCKSCGLD3QGUPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R5UXOXK4E3HTBCKSCGLD3QGUPQ/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-11T01:01:20Z","links":{"resolver":"https://pith.science/pith/R5UXOXK4E3HTBCKSCGLD3QGUPQ","bundle":"https://pith.science/pith/R5UXOXK4E3HTBCKSCGLD3QGUPQ/bundle.json","state":"https://pith.science/pith/R5UXOXK4E3HTBCKSCGLD3QGUPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R5UXOXK4E3HTBCKSCGLD3QGUPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:R5UXOXK4E3HTBCKSCGLD3QGUPQ","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":"40bba70a8dc39ed484b08084a91ba2204ddf21091f428ff56cd0d31416e1d8b4","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2007-10-25T09:45:31Z","title_canon_sha256":"96fce2678c659dc098979d95b9e42530d6431c75944b42b0d3093eb012c81cc3"},"schema_version":"1.0","source":{"id":"0710.4743","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0710.4743","created_at":"2026-05-18T04:09:05Z"},{"alias_kind":"arxiv_version","alias_value":"0710.4743v1","created_at":"2026-05-18T04:09:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.4743","created_at":"2026-05-18T04:09:05Z"},{"alias_kind":"pith_short_12","alias_value":"R5UXOXK4E3HT","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"R5UXOXK4E3HTBCKS","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"R5UXOXK4","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:0a346025f5912b2664a9136bbf1efe0d10e98be6b93e44de3bf6edd817449ee6","target":"graph","created_at":"2026-05-18T04:09:05Z","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":"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","authors_text":"Alan Mishchenko, Nina Yevtushenko, Robert Brayton, Roland Jiang, Tiziano Villa","cross_cats":[],"headline":"","license":"","primary_cat":"cs.LO","submitted_at":"2007-10-25T09:45:31Z","title":"Efficient Solution of Language Equations Using Partitioned Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.4743","kind":"arxiv","version":1},"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:74a50710981275e127cdcceb55069e464de3232769190019712fa754bf4394fd","target":"record","created_at":"2026-05-18T04:09:05Z","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":"40bba70a8dc39ed484b08084a91ba2204ddf21091f428ff56cd0d31416e1d8b4","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2007-10-25T09:45:31Z","title_canon_sha256":"96fce2678c659dc098979d95b9e42530d6431c75944b42b0d3093eb012c81cc3"},"schema_version":"1.0","source":{"id":"0710.4743","kind":"arxiv","version":1}},"canonical_sha256":"8f69775d5c26cf30895211963dc0d47c0af05c36bb9c28707e679d2f41d277d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f69775d5c26cf30895211963dc0d47c0af05c36bb9c28707e679d2f41d277d2","first_computed_at":"2026-05-18T04:09:05.484252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:05.484252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rL3uBCV9LrHwC58SR1K+EFdrg/aTyyPkbucdgypAWiqgbk1zkuxb7VMJtgHRwdFJuIo5p9xUFnetCbvE/vd8Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:05.484952Z","signed_message":"canonical_sha256_bytes"},"source_id":"0710.4743","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74a50710981275e127cdcceb55069e464de3232769190019712fa754bf4394fd","sha256:0a346025f5912b2664a9136bbf1efe0d10e98be6b93e44de3bf6edd817449ee6"],"state_sha256":"cf9af2815f2de221eec3a6e371551d8163780b52aae1a375a9b2f33506594768"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9P9QfPiAJAAqy9Lrnx1WBq7MwnS6zOpvSOOiFDmcSCVZ5QywKAGWcK72c6g1mF57phZSErqtSwnUNBlY7+6wCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:01:20.723553Z","bundle_sha256":"87d9f1fef70ce4ba26f0563128f68ae3c097718ae49251032a71f4bc5650fb27"}}