{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NZRXSJHN3IVKGDS5BI7AGJDEGZ","short_pith_number":"pith:NZRXSJHN","canonical_record":{"source":{"id":"1309.5439","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-09-21T05:44:00Z","cross_cats_sorted":["cs.FL","cs.LO"],"title_canon_sha256":"9843b751a0c1250bf59a5be7b17757fc6c2a40576b6e506ed0b6e1e7e5d59eb2","abstract_canon_sha256":"ef361aa36c6a189bfac99250c020777fac29f3fc8f3db616e9fd9c7013ec33af"},"schema_version":"1.0"},"canonical_sha256":"6e637924edda2aa30e5d0a3e032464366bc93e8abcd7894636268e0fc94d4ecd","source":{"kind":"arxiv","id":"1309.5439","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5439","created_at":"2026-05-18T01:28:26Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5439v5","created_at":"2026-05-18T01:28:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5439","created_at":"2026-05-18T01:28:26Z"},{"alias_kind":"pith_short_12","alias_value":"NZRXSJHN3IVK","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"NZRXSJHN3IVKGDS5","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"NZRXSJHN","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NZRXSJHN3IVKGDS5BI7AGJDEGZ","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5439","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-09-21T05:44:00Z","cross_cats_sorted":["cs.FL","cs.LO"],"title_canon_sha256":"9843b751a0c1250bf59a5be7b17757fc6c2a40576b6e506ed0b6e1e7e5d59eb2","abstract_canon_sha256":"ef361aa36c6a189bfac99250c020777fac29f3fc8f3db616e9fd9c7013ec33af"},"schema_version":"1.0"},"canonical_sha256":"6e637924edda2aa30e5d0a3e032464366bc93e8abcd7894636268e0fc94d4ecd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:26.288540Z","signature_b64":"yJ9/rfa1eF8bIoNORFoJjScCNrn4uyHeAC/g80mv+agKC6Ovcmez8fCxUQdQAddPyFuoXndtEI1Ex5iqgUROCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e637924edda2aa30e5d0a3e032464366bc93e8abcd7894636268e0fc94d4ecd","last_reissued_at":"2026-05-18T01:28:26.288006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:26.288006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5439","source_version":5,"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:28:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pDa0OBSHgjnA++jEXUmwSEqIPupJmHiag88Khz79HZU8TylDr3ElJ0iiFoh0ay8ja5xNmfNoV8TsEjym/QzeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:39:35.301857Z"},"content_sha256":"ab82ff06bc472869b138911b9d0d36db48a920f51059ad741547dfd9b40c97dd","schema_version":"1.0","event_id":"sha256:ab82ff06bc472869b138911b9d0d36db48a920f51059ad741547dfd9b40c97dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NZRXSJHN3IVKGDS5BI7AGJDEGZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.LO"],"primary_cat":"cs.GT","authors_text":"Emmanuel Filiot, Jean-Fran\\c{c}ois Raskin, Mickael Randour, V\\'eronique Bruy\\`ere","submitted_at":"2013-09-21T05:44:00Z","abstract_excerpt":"We extend the quantitative synthesis framework by going beyond the worst-case. On the one hand, classical analysis of two-player games involves an adversary (modeling the environment of the system) which is purely antagonistic and asks for strict guarantees. On the other hand, stochastic models like Markov decision processes represent situations where the system is faced to a purely randomized environment: the aim is then to optimize the expected payoff, with no guarantee on individual outcomes. We introduce the beyond worst-case synthesis problem, which is to construct strategies that guarant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5439","kind":"arxiv","version":5},"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:28:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9CATnahNXq63jmAtoUCt6JWQ2hik19AmTHlXUXUwj4Yk3atbWw3C4Pa4kYnWXzhfD+pHiHQnJE7tSCj0UvqDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:39:35.302219Z"},"content_sha256":"9336e104633d58c6c93b32399e5147acd3abd6e4fd1ae8041b3a04eb746366b0","schema_version":"1.0","event_id":"sha256:9336e104633d58c6c93b32399e5147acd3abd6e4fd1ae8041b3a04eb746366b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NZRXSJHN3IVKGDS5BI7AGJDEGZ/bundle.json","state_url":"https://pith.science/pith/NZRXSJHN3IVKGDS5BI7AGJDEGZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NZRXSJHN3IVKGDS5BI7AGJDEGZ/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-06T16:39:35Z","links":{"resolver":"https://pith.science/pith/NZRXSJHN3IVKGDS5BI7AGJDEGZ","bundle":"https://pith.science/pith/NZRXSJHN3IVKGDS5BI7AGJDEGZ/bundle.json","state":"https://pith.science/pith/NZRXSJHN3IVKGDS5BI7AGJDEGZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NZRXSJHN3IVKGDS5BI7AGJDEGZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NZRXSJHN3IVKGDS5BI7AGJDEGZ","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":"ef361aa36c6a189bfac99250c020777fac29f3fc8f3db616e9fd9c7013ec33af","cross_cats_sorted":["cs.FL","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-09-21T05:44:00Z","title_canon_sha256":"9843b751a0c1250bf59a5be7b17757fc6c2a40576b6e506ed0b6e1e7e5d59eb2"},"schema_version":"1.0","source":{"id":"1309.5439","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5439","created_at":"2026-05-18T01:28:26Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5439v5","created_at":"2026-05-18T01:28:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5439","created_at":"2026-05-18T01:28:26Z"},{"alias_kind":"pith_short_12","alias_value":"NZRXSJHN3IVK","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"NZRXSJHN3IVKGDS5","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"NZRXSJHN","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:9336e104633d58c6c93b32399e5147acd3abd6e4fd1ae8041b3a04eb746366b0","target":"graph","created_at":"2026-05-18T01:28:26Z","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":"We extend the quantitative synthesis framework by going beyond the worst-case. On the one hand, classical analysis of two-player games involves an adversary (modeling the environment of the system) which is purely antagonistic and asks for strict guarantees. On the other hand, stochastic models like Markov decision processes represent situations where the system is faced to a purely randomized environment: the aim is then to optimize the expected payoff, with no guarantee on individual outcomes. We introduce the beyond worst-case synthesis problem, which is to construct strategies that guarant","authors_text":"Emmanuel Filiot, Jean-Fran\\c{c}ois Raskin, Mickael Randour, V\\'eronique Bruy\\`ere","cross_cats":["cs.FL","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-09-21T05:44:00Z","title":"Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5439","kind":"arxiv","version":5},"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:ab82ff06bc472869b138911b9d0d36db48a920f51059ad741547dfd9b40c97dd","target":"record","created_at":"2026-05-18T01:28:26Z","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":"ef361aa36c6a189bfac99250c020777fac29f3fc8f3db616e9fd9c7013ec33af","cross_cats_sorted":["cs.FL","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-09-21T05:44:00Z","title_canon_sha256":"9843b751a0c1250bf59a5be7b17757fc6c2a40576b6e506ed0b6e1e7e5d59eb2"},"schema_version":"1.0","source":{"id":"1309.5439","kind":"arxiv","version":5}},"canonical_sha256":"6e637924edda2aa30e5d0a3e032464366bc93e8abcd7894636268e0fc94d4ecd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e637924edda2aa30e5d0a3e032464366bc93e8abcd7894636268e0fc94d4ecd","first_computed_at":"2026-05-18T01:28:26.288006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:26.288006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yJ9/rfa1eF8bIoNORFoJjScCNrn4uyHeAC/g80mv+agKC6Ovcmez8fCxUQdQAddPyFuoXndtEI1Ex5iqgUROCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:26.288540Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5439","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab82ff06bc472869b138911b9d0d36db48a920f51059ad741547dfd9b40c97dd","sha256:9336e104633d58c6c93b32399e5147acd3abd6e4fd1ae8041b3a04eb746366b0"],"state_sha256":"785b16ed765efea74ce6af421bf42a75818ac289fcd9893429ab1088829dd4fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cRUm67UPs9kQWLq6Bae5OOA2UZWmhXun4K1yNLi4eVut60fQ1NLRF/f2vRzvp0DIOrpo6SBFBy0h0Dz/fN/PBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:39:35.305011Z","bundle_sha256":"be0f46a0951f9b2409386b7b561f1f0fb4b37cc2b082ac764d67889343513ece"}}