{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DGVPVZKPJVOFGQAYBSSC5JIFCV","short_pith_number":"pith:DGVPVZKP","schema_version":"1.0","canonical_sha256":"19aafae54f4d5c5340180ca42ea5051555528d55ed9a7fad9b183ab611267506","source":{"kind":"arxiv","id":"1604.07064","version":1},"attestation_state":"computed","paper":{"title":"Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Orna Kupferman, Shaull Almagor, Yaron Velner","submitted_at":"2016-04-24T17:58:38Z","abstract_excerpt":"In Boolean synthesis, we are given an LTL specification, and the goal is to construct a transducer that realizes it against an adversarial environment. Often, a specification contains both Boolean requirements that should be satisfied against an adversarial environment, and multi-valued components that refer to the quality of the satisfaction and whose expected cost we would like to minimize with respect to a probabilistic environment.\n  In this work we study, for the first time, mean-payoff games in which the system aims at minimizing the expected cost against a probabilistic environment, whi"},"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":"1604.07064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-04-24T17:58:38Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"f008b1d8f64b6b10ac8a76f9b753fa11be5d1a7152d4e3ee7c354c90c2ba5aa5","abstract_canon_sha256":"e554f118ef45bfb5f752a8e060b6b33e4ffa392e7b89ba5c34feb1e023bcc30b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:23.148453Z","signature_b64":"Gl2rHqafg/xzGceBrrf8+ebkcT76l0Idn7WNo6OHC5k7SdapuQhItkvYFQHVXkEzyTpvZ1KJRFN3PNmtxZpTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19aafae54f4d5c5340180ca42ea5051555528d55ed9a7fad9b183ab611267506","last_reissued_at":"2026-05-18T01:16:23.147723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:23.147723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Orna Kupferman, Shaull Almagor, Yaron Velner","submitted_at":"2016-04-24T17:58:38Z","abstract_excerpt":"In Boolean synthesis, we are given an LTL specification, and the goal is to construct a transducer that realizes it against an adversarial environment. Often, a specification contains both Boolean requirements that should be satisfied against an adversarial environment, and multi-valued components that refer to the quality of the satisfaction and whose expected cost we would like to minimize with respect to a probabilistic environment.\n  In this work we study, for the first time, mean-payoff games in which the system aims at minimizing the expected cost against a probabilistic environment, whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07064","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":"1604.07064","created_at":"2026-05-18T01:16:23.147831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07064v1","created_at":"2026-05-18T01:16:23.147831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07064","created_at":"2026-05-18T01:16:23.147831+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGVPVZKPJVOF","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGVPVZKPJVOFGQAY","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGVPVZKP","created_at":"2026-05-18T12:30:12.583610+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/DGVPVZKPJVOFGQAYBSSC5JIFCV","json":"https://pith.science/pith/DGVPVZKPJVOFGQAYBSSC5JIFCV.json","graph_json":"https://pith.science/api/pith-number/DGVPVZKPJVOFGQAYBSSC5JIFCV/graph.json","events_json":"https://pith.science/api/pith-number/DGVPVZKPJVOFGQAYBSSC5JIFCV/events.json","paper":"https://pith.science/paper/DGVPVZKP"},"agent_actions":{"view_html":"https://pith.science/pith/DGVPVZKPJVOFGQAYBSSC5JIFCV","download_json":"https://pith.science/pith/DGVPVZKPJVOFGQAYBSSC5JIFCV.json","view_paper":"https://pith.science/paper/DGVPVZKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07064&json=true","fetch_graph":"https://pith.science/api/pith-number/DGVPVZKPJVOFGQAYBSSC5JIFCV/graph.json","fetch_events":"https://pith.science/api/pith-number/DGVPVZKPJVOFGQAYBSSC5JIFCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGVPVZKPJVOFGQAYBSSC5JIFCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGVPVZKPJVOFGQAYBSSC5JIFCV/action/storage_attestation","attest_author":"https://pith.science/pith/DGVPVZKPJVOFGQAYBSSC5JIFCV/action/author_attestation","sign_citation":"https://pith.science/pith/DGVPVZKPJVOFGQAYBSSC5JIFCV/action/citation_signature","submit_replication":"https://pith.science/pith/DGVPVZKPJVOFGQAYBSSC5JIFCV/action/replication_record"}},"created_at":"2026-05-18T01:16:23.147831+00:00","updated_at":"2026-05-18T01:16:23.147831+00:00"}