{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QUS4XABBL4G5DCVRAUJHZDRC6B","short_pith_number":"pith:QUS4XABB","schema_version":"1.0","canonical_sha256":"8525cb80215f0dd18ab105127c8e22f0739791df7c0083b6c555ded920f1b56e","source":{"kind":"arxiv","id":"1905.03560","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Transducer Synthesis from Multi-Sequential Specifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Emmanuel Filiot, Isma\\\"el Jecker, L\\'eo Exibard","submitted_at":"2019-05-09T12:09:52Z","abstract_excerpt":"The transducer synthesis problem on finite words asks, given a specification $S \\subseteq I \\times O$, where $I$ and $O$ are sets of finite words, whether there exists an implementation $f: I \\rightarrow O$ which (1) fulfils the specification, i.e., $(i,f(i))\\in S$ for all $i\\in I$, and (2) can be defined by some input-deterministic (aka sequential) transducer $\\mathcal{T}_f$. If such an implementation $f$ exists, the procedure should also output $\\mathcal{T}_f$. The realisability problem is the corresponding decision problem.\n  For specifications given by synchronous transducers (which read a"},"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":"1905.03560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-05-09T12:09:52Z","cross_cats_sorted":[],"title_canon_sha256":"fb5ddae0c82a5e3d2443373ca7e163cf0370112c1ead8796a6735f80b0da88ae","abstract_canon_sha256":"c18c28751ab238d58b4d90cf5fb509da3d00ab8123b9fe002e4ad8a7b08e3d9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:37.421540Z","signature_b64":"Uai8GnnqTXz7+aEhmBN4O6ZGsBCGEO/TxpnIyfii5rD80rgLDZD7nhAYlUzTlWkgihX+UqAceU6FwocdiMd7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8525cb80215f0dd18ab105127c8e22f0739791df7c0083b6c555ded920f1b56e","last_reissued_at":"2026-05-17T23:46:37.420818Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:37.420818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Transducer Synthesis from Multi-Sequential Specifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Emmanuel Filiot, Isma\\\"el Jecker, L\\'eo Exibard","submitted_at":"2019-05-09T12:09:52Z","abstract_excerpt":"The transducer synthesis problem on finite words asks, given a specification $S \\subseteq I \\times O$, where $I$ and $O$ are sets of finite words, whether there exists an implementation $f: I \\rightarrow O$ which (1) fulfils the specification, i.e., $(i,f(i))\\in S$ for all $i\\in I$, and (2) can be defined by some input-deterministic (aka sequential) transducer $\\mathcal{T}_f$. If such an implementation $f$ exists, the procedure should also output $\\mathcal{T}_f$. The realisability problem is the corresponding decision problem.\n  For specifications given by synchronous transducers (which read a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03560","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":"1905.03560","created_at":"2026-05-17T23:46:37.420953+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03560v1","created_at":"2026-05-17T23:46:37.420953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03560","created_at":"2026-05-17T23:46:37.420953+00:00"},{"alias_kind":"pith_short_12","alias_value":"QUS4XABBL4G5","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QUS4XABBL4G5DCVR","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QUS4XABB","created_at":"2026-05-18T12:33:27.125529+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/QUS4XABBL4G5DCVRAUJHZDRC6B","json":"https://pith.science/pith/QUS4XABBL4G5DCVRAUJHZDRC6B.json","graph_json":"https://pith.science/api/pith-number/QUS4XABBL4G5DCVRAUJHZDRC6B/graph.json","events_json":"https://pith.science/api/pith-number/QUS4XABBL4G5DCVRAUJHZDRC6B/events.json","paper":"https://pith.science/paper/QUS4XABB"},"agent_actions":{"view_html":"https://pith.science/pith/QUS4XABBL4G5DCVRAUJHZDRC6B","download_json":"https://pith.science/pith/QUS4XABBL4G5DCVRAUJHZDRC6B.json","view_paper":"https://pith.science/paper/QUS4XABB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03560&json=true","fetch_graph":"https://pith.science/api/pith-number/QUS4XABBL4G5DCVRAUJHZDRC6B/graph.json","fetch_events":"https://pith.science/api/pith-number/QUS4XABBL4G5DCVRAUJHZDRC6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QUS4XABBL4G5DCVRAUJHZDRC6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QUS4XABBL4G5DCVRAUJHZDRC6B/action/storage_attestation","attest_author":"https://pith.science/pith/QUS4XABBL4G5DCVRAUJHZDRC6B/action/author_attestation","sign_citation":"https://pith.science/pith/QUS4XABBL4G5DCVRAUJHZDRC6B/action/citation_signature","submit_replication":"https://pith.science/pith/QUS4XABBL4G5DCVRAUJHZDRC6B/action/replication_record"}},"created_at":"2026-05-17T23:46:37.420953+00:00","updated_at":"2026-05-17T23:46:37.420953+00:00"}