{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZZRHQYHXISST3VABS7BKYWFWVO","short_pith_number":"pith:ZZRHQYHX","canonical_record":{"source":{"id":"1504.08211","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2015-04-30T13:16:48Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"e918dfae9be50bd4b74428ae5d4dedd319306b7bdc77c75a8f4c76119352e333","abstract_canon_sha256":"157e2e5393673cc469ef74b6eb3193f828f6978f0dc8b82a6a46d0578bdb810f"},"schema_version":"1.0"},"canonical_sha256":"ce627860f744a53dd40197c2ac58b6ab9a45cf74a496f4a6651b5ef5624c59f3","source":{"kind":"arxiv","id":"1504.08211","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08211","created_at":"2026-05-18T00:30:09Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08211v2","created_at":"2026-05-18T00:30:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08211","created_at":"2026-05-18T00:30:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZZRHQYHXISST","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZZRHQYHXISST3VAB","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZZRHQYHX","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZZRHQYHXISST3VABS7BKYWFWVO","target":"record","payload":{"canonical_record":{"source":{"id":"1504.08211","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2015-04-30T13:16:48Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"e918dfae9be50bd4b74428ae5d4dedd319306b7bdc77c75a8f4c76119352e333","abstract_canon_sha256":"157e2e5393673cc469ef74b6eb3193f828f6978f0dc8b82a6a46d0578bdb810f"},"schema_version":"1.0"},"canonical_sha256":"ce627860f744a53dd40197c2ac58b6ab9a45cf74a496f4a6651b5ef5624c59f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:09.552383Z","signature_b64":"u0QaTxMqzc3ZYxAIb/N+Ka7Nnab+z/wv/p7l2SSCDUQYJIiPVQCvbP/5TpNA2npz+KIAQ3HM93KBFAVCiIGHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce627860f744a53dd40197c2ac58b6ab9a45cf74a496f4a6651b5ef5624c59f3","last_reissued_at":"2026-05-18T00:30:09.551647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:09.551647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.08211","source_version":2,"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-18T00:30:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y1CdBvvF/k/VRgKtEI/A1V7MKTU4JGSBn0vTTbcIqLcpR+g5dpocJFaetJVCT5z5V32KJQDKCrSo5wbDTRD8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:29:49.432432Z"},"content_sha256":"b47cdebbfd6614ac63df62d3991a42f347237a6d93fb198ed94257db6d918b57","schema_version":"1.0","event_id":"sha256:b47cdebbfd6614ac63df62d3991a42f347237a6d93fb198ed94257db6d918b57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZZRHQYHXISST3VABS7BKYWFWVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.GT","authors_text":"Jean-Fran\\c{c}ois Raskin, Lorenzo Clemente","submitted_at":"2015-04-30T13:16:48Z","abstract_excerpt":"The beyond worst-case threshold problem (BWC), recently introduced by Bruy\\`ere et al., asks given a quantitative game graph for the synthesis of a strategy that i) enforces some minimal level of performance against any adversary, and ii) achieves a good expectation against a stochastic model of the adversary. They solved the BWC problem for finite-memory strategies and unidimensional mean-payoff objectives and they showed membership of the problem in NP$\\cap$coNP. They also noted that infinite-memory strategies are more powerful than finite-memory ones, but the respective threshold problem wa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08211","kind":"arxiv","version":2},"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-18T00:30:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5n2KetgmN9EjQlyAVjy/0ceitVeCmQ2lm4qpOiccmVHh2KR9LC0AAcf3AvRCdjGHPOgxAYUU/hNDOeSkmmUSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:29:49.432783Z"},"content_sha256":"426701931dbd9303b60291e9c8420cb807bb01edec85deb231ac6c3b46332b0a","schema_version":"1.0","event_id":"sha256:426701931dbd9303b60291e9c8420cb807bb01edec85deb231ac6c3b46332b0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZRHQYHXISST3VABS7BKYWFWVO/bundle.json","state_url":"https://pith.science/pith/ZZRHQYHXISST3VABS7BKYWFWVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZRHQYHXISST3VABS7BKYWFWVO/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-25T20:29:49Z","links":{"resolver":"https://pith.science/pith/ZZRHQYHXISST3VABS7BKYWFWVO","bundle":"https://pith.science/pith/ZZRHQYHXISST3VABS7BKYWFWVO/bundle.json","state":"https://pith.science/pith/ZZRHQYHXISST3VABS7BKYWFWVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZRHQYHXISST3VABS7BKYWFWVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZZRHQYHXISST3VABS7BKYWFWVO","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":"157e2e5393673cc469ef74b6eb3193f828f6978f0dc8b82a6a46d0578bdb810f","cross_cats_sorted":["cs.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2015-04-30T13:16:48Z","title_canon_sha256":"e918dfae9be50bd4b74428ae5d4dedd319306b7bdc77c75a8f4c76119352e333"},"schema_version":"1.0","source":{"id":"1504.08211","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08211","created_at":"2026-05-18T00:30:09Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08211v2","created_at":"2026-05-18T00:30:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08211","created_at":"2026-05-18T00:30:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZZRHQYHXISST","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZZRHQYHXISST3VAB","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZZRHQYHX","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:426701931dbd9303b60291e9c8420cb807bb01edec85deb231ac6c3b46332b0a","target":"graph","created_at":"2026-05-18T00:30:09Z","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":"The beyond worst-case threshold problem (BWC), recently introduced by Bruy\\`ere et al., asks given a quantitative game graph for the synthesis of a strategy that i) enforces some minimal level of performance against any adversary, and ii) achieves a good expectation against a stochastic model of the adversary. They solved the BWC problem for finite-memory strategies and unidimensional mean-payoff objectives and they showed membership of the problem in NP$\\cap$coNP. They also noted that infinite-memory strategies are more powerful than finite-memory ones, but the respective threshold problem wa","authors_text":"Jean-Fran\\c{c}ois Raskin, Lorenzo Clemente","cross_cats":["cs.SY"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2015-04-30T13:16:48Z","title":"Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08211","kind":"arxiv","version":2},"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:b47cdebbfd6614ac63df62d3991a42f347237a6d93fb198ed94257db6d918b57","target":"record","created_at":"2026-05-18T00:30:09Z","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":"157e2e5393673cc469ef74b6eb3193f828f6978f0dc8b82a6a46d0578bdb810f","cross_cats_sorted":["cs.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2015-04-30T13:16:48Z","title_canon_sha256":"e918dfae9be50bd4b74428ae5d4dedd319306b7bdc77c75a8f4c76119352e333"},"schema_version":"1.0","source":{"id":"1504.08211","kind":"arxiv","version":2}},"canonical_sha256":"ce627860f744a53dd40197c2ac58b6ab9a45cf74a496f4a6651b5ef5624c59f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce627860f744a53dd40197c2ac58b6ab9a45cf74a496f4a6651b5ef5624c59f3","first_computed_at":"2026-05-18T00:30:09.551647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:09.551647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u0QaTxMqzc3ZYxAIb/N+Ka7Nnab+z/wv/p7l2SSCDUQYJIiPVQCvbP/5TpNA2npz+KIAQ3HM93KBFAVCiIGHBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:09.552383Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.08211","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b47cdebbfd6614ac63df62d3991a42f347237a6d93fb198ed94257db6d918b57","sha256:426701931dbd9303b60291e9c8420cb807bb01edec85deb231ac6c3b46332b0a"],"state_sha256":"cce6785ac20657a8876d6065786f98f26c8e9477062c39dfef024ccfa4919f77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U0z6VWEqGKYullQedBkmA5BvlcQir21/MJHG8OhF2574/JYCjCz1iMrLtenkj3OvdKU3+4SRaC4TEEmwS9o/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:29:49.434719Z","bundle_sha256":"1061c37e59b56e557c1622130fff07ff23f6e481682619d55db9e55beed60862"}}