{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HEQDNX325PEEGKD4OAFMLJQ6JJ","short_pith_number":"pith:HEQDNX32","schema_version":"1.0","canonical_sha256":"392036df7aebc843287c700ac5a61e4a5b12e36ffe6d3eab6a472611e55d5fc4","source":{"kind":"arxiv","id":"1803.09570","version":1},"attestation_state":"computed","paper":{"title":"Encodings of Bounded Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bernd Finkbeiner, Leander Tentrup, Markus N. Rabe, Peter Faymonville","submitted_at":"2018-03-26T13:16:59Z","abstract_excerpt":"The reactive synthesis problem is to compute a system satisfying a given specification in temporal logic. Bounded synthesis is the approach to bound the maximum size of the system that we accept as a solution to the reactive synthesis problem. As a result, bounded synthesis is decidable whenever the corresponding verification problem is decidable, and can be applied in settings where classic synthesis fails, such as in the synthesis of distributed systems. In this paper, we study the constraint solving problem behind bounded synthesis. We consider different reductions of the bounded synthesis "},"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":"1803.09570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-03-26T13:16:59Z","cross_cats_sorted":[],"title_canon_sha256":"f5c8c3a01444b0e3d825d919ebbeac6e24420b7439c7d308c852a46deb192d77","abstract_canon_sha256":"9cede69ea98766f8debdcf8924b6c00d95af4d101c3498785219668b873efb88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:11.084689Z","signature_b64":"sdeVPnNxxNS3HytNTRBEeW5MiDkkRYEWyLrszE+iLDStK65+Wkuhdz2XpKaLtRWzuzM0BZ8d69ozdG4V+UZOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"392036df7aebc843287c700ac5a61e4a5b12e36ffe6d3eab6a472611e55d5fc4","last_reissued_at":"2026-05-18T00:20:11.084016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:11.084016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Encodings of Bounded Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bernd Finkbeiner, Leander Tentrup, Markus N. Rabe, Peter Faymonville","submitted_at":"2018-03-26T13:16:59Z","abstract_excerpt":"The reactive synthesis problem is to compute a system satisfying a given specification in temporal logic. Bounded synthesis is the approach to bound the maximum size of the system that we accept as a solution to the reactive synthesis problem. As a result, bounded synthesis is decidable whenever the corresponding verification problem is decidable, and can be applied in settings where classic synthesis fails, such as in the synthesis of distributed systems. In this paper, we study the constraint solving problem behind bounded synthesis. We consider different reductions of the bounded synthesis "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09570","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":"1803.09570","created_at":"2026-05-18T00:20:11.084122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.09570v1","created_at":"2026-05-18T00:20:11.084122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09570","created_at":"2026-05-18T00:20:11.084122+00:00"},{"alias_kind":"pith_short_12","alias_value":"HEQDNX325PEE","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HEQDNX325PEEGKD4","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HEQDNX32","created_at":"2026-05-18T12:32:28.185984+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/HEQDNX325PEEGKD4OAFMLJQ6JJ","json":"https://pith.science/pith/HEQDNX325PEEGKD4OAFMLJQ6JJ.json","graph_json":"https://pith.science/api/pith-number/HEQDNX325PEEGKD4OAFMLJQ6JJ/graph.json","events_json":"https://pith.science/api/pith-number/HEQDNX325PEEGKD4OAFMLJQ6JJ/events.json","paper":"https://pith.science/paper/HEQDNX32"},"agent_actions":{"view_html":"https://pith.science/pith/HEQDNX325PEEGKD4OAFMLJQ6JJ","download_json":"https://pith.science/pith/HEQDNX325PEEGKD4OAFMLJQ6JJ.json","view_paper":"https://pith.science/paper/HEQDNX32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.09570&json=true","fetch_graph":"https://pith.science/api/pith-number/HEQDNX325PEEGKD4OAFMLJQ6JJ/graph.json","fetch_events":"https://pith.science/api/pith-number/HEQDNX325PEEGKD4OAFMLJQ6JJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HEQDNX325PEEGKD4OAFMLJQ6JJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HEQDNX325PEEGKD4OAFMLJQ6JJ/action/storage_attestation","attest_author":"https://pith.science/pith/HEQDNX325PEEGKD4OAFMLJQ6JJ/action/author_attestation","sign_citation":"https://pith.science/pith/HEQDNX325PEEGKD4OAFMLJQ6JJ/action/citation_signature","submit_replication":"https://pith.science/pith/HEQDNX325PEEGKD4OAFMLJQ6JJ/action/replication_record"}},"created_at":"2026-05-18T00:20:11.084122+00:00","updated_at":"2026-05-18T00:20:11.084122+00:00"}