{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DGVPVZKPJVOFGQAYBSSC5JIFCV","short_pith_number":"pith:DGVPVZKP","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"},"canonical_sha256":"19aafae54f4d5c5340180ca42ea5051555528d55ed9a7fad9b183ab611267506","source":{"kind":"arxiv","id":"1604.07064","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07064","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07064v1","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07064","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"pith_short_12","alias_value":"DGVPVZKPJVOF","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DGVPVZKPJVOFGQAY","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DGVPVZKP","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DGVPVZKPJVOFGQAYBSSC5JIFCV","target":"record","payload":{"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"},"canonical_sha256":"19aafae54f4d5c5340180ca42ea5051555528d55ed9a7fad9b183ab611267506","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"},"source_kind":"arxiv","source_id":"1604.07064","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-18T01:16:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ur8SH65kpuQ1sKzeoQoXWO/5pKOUl1cM2EU21DBhBJRN0KA9dmhQq4XkBvmJ07Znb553fmjvVtGOw5YKKBvDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:37:26.300600Z"},"content_sha256":"27ba6a623db04a4da0c7e1aa1f4c97fff6acbb0878d648d4983cee168927d389","schema_version":"1.0","event_id":"sha256:27ba6a623db04a4da0c7e1aa1f4c97fff6acbb0878d648d4983cee168927d389"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DGVPVZKPJVOFGQAYBSSC5JIFCV","target":"graph","payload":{"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"},"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-18T01:16:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1baQlabIahACEgZekFALW5BiSBFCivxRLRxzV7vXgh545kkMmR1OAf6P6SoqouqloOSZC7/zHJBsRJppIIGyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:37:26.301241Z"},"content_sha256":"0bc2a7a0e6bcd51e2f6a4f2470e3c14d907af6902cf22f9b6ab00685df7cb3cb","schema_version":"1.0","event_id":"sha256:0bc2a7a0e6bcd51e2f6a4f2470e3c14d907af6902cf22f9b6ab00685df7cb3cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DGVPVZKPJVOFGQAYBSSC5JIFCV/bundle.json","state_url":"https://pith.science/pith/DGVPVZKPJVOFGQAYBSSC5JIFCV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DGVPVZKPJVOFGQAYBSSC5JIFCV/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-05-24T21:37:26Z","links":{"resolver":"https://pith.science/pith/DGVPVZKPJVOFGQAYBSSC5JIFCV","bundle":"https://pith.science/pith/DGVPVZKPJVOFGQAYBSSC5JIFCV/bundle.json","state":"https://pith.science/pith/DGVPVZKPJVOFGQAYBSSC5JIFCV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DGVPVZKPJVOFGQAYBSSC5JIFCV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DGVPVZKPJVOFGQAYBSSC5JIFCV","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":"e554f118ef45bfb5f752a8e060b6b33e4ffa392e7b89ba5c34feb1e023bcc30b","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-04-24T17:58:38Z","title_canon_sha256":"f008b1d8f64b6b10ac8a76f9b753fa11be5d1a7152d4e3ee7c354c90c2ba5aa5"},"schema_version":"1.0","source":{"id":"1604.07064","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07064","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07064v1","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07064","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"pith_short_12","alias_value":"DGVPVZKPJVOF","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DGVPVZKPJVOFGQAY","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DGVPVZKP","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:0bc2a7a0e6bcd51e2f6a4f2470e3c14d907af6902cf22f9b6ab00685df7cb3cb","target":"graph","created_at":"2026-05-18T01:16:23Z","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":"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","authors_text":"Orna Kupferman, Shaull Almagor, Yaron Velner","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-04-24T17:58:38Z","title":"Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07064","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:27ba6a623db04a4da0c7e1aa1f4c97fff6acbb0878d648d4983cee168927d389","target":"record","created_at":"2026-05-18T01:16:23Z","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":"e554f118ef45bfb5f752a8e060b6b33e4ffa392e7b89ba5c34feb1e023bcc30b","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-04-24T17:58:38Z","title_canon_sha256":"f008b1d8f64b6b10ac8a76f9b753fa11be5d1a7152d4e3ee7c354c90c2ba5aa5"},"schema_version":"1.0","source":{"id":"1604.07064","kind":"arxiv","version":1}},"canonical_sha256":"19aafae54f4d5c5340180ca42ea5051555528d55ed9a7fad9b183ab611267506","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19aafae54f4d5c5340180ca42ea5051555528d55ed9a7fad9b183ab611267506","first_computed_at":"2026-05-18T01:16:23.147723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:23.147723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gl2rHqafg/xzGceBrrf8+ebkcT76l0Idn7WNo6OHC5k7SdapuQhItkvYFQHVXkEzyTpvZ1KJRFN3PNmtxZpTDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:23.148453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07064","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27ba6a623db04a4da0c7e1aa1f4c97fff6acbb0878d648d4983cee168927d389","sha256:0bc2a7a0e6bcd51e2f6a4f2470e3c14d907af6902cf22f9b6ab00685df7cb3cb"],"state_sha256":"53212e40b1f6b964fc07922a15b79d8cb6d732c1c4571f9dda78a597ef4da5d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"47LTyCt7Y02CJc4oAWfJxdScw+dU7cc/213uUlojAMjynYaMvPd9o5EOOxRmPE68fAT9BwEvbuC4OndrxmcxDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T21:37:26.304869Z","bundle_sha256":"3211b14417aa6eaa57cfc81c07da9dc242f3c99ab66c4e2841954cf5207419f8"}}