{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:D4RY5OD5CSFOR6ZH4FMARDYVLX","short_pith_number":"pith:D4RY5OD5","canonical_record":{"source":{"id":"1102.3615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-02-17T16:08:19Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"afc8130f1df13ffa416a8e5a470ba7a7d5137d52066761122e85ed086e2e2feb","abstract_canon_sha256":"94d03ebcb3458dcc068fb6299f435fd9443ea9aef547de8778e798cccfc6ce7c"},"schema_version":"1.0"},"canonical_sha256":"1f238eb87d148ae8fb27e158088f155df68ba19bb1fd6991e113b1841693ba06","source":{"kind":"arxiv","id":"1102.3615","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3615","created_at":"2026-05-18T03:36:46Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3615v2","created_at":"2026-05-18T03:36:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3615","created_at":"2026-05-18T03:36:46Z"},{"alias_kind":"pith_short_12","alias_value":"D4RY5OD5CSFO","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"D4RY5OD5CSFOR6ZH","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"D4RY5OD5","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:D4RY5OD5CSFOR6ZH4FMARDYVLX","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-02-17T16:08:19Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"afc8130f1df13ffa416a8e5a470ba7a7d5137d52066761122e85ed086e2e2feb","abstract_canon_sha256":"94d03ebcb3458dcc068fb6299f435fd9443ea9aef547de8778e798cccfc6ce7c"},"schema_version":"1.0"},"canonical_sha256":"1f238eb87d148ae8fb27e158088f155df68ba19bb1fd6991e113b1841693ba06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:46.834329Z","signature_b64":"oDLAX9Tkb+Di15TaZnZwH0ntBRoPYDKYZkjlZmzhfDh6FZs5CnS//07E4zOV/BhFqroNubEpGNnAzqoQz7JHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f238eb87d148ae8fb27e158088f155df68ba19bb1fd6991e113b1841693ba06","last_reissued_at":"2026-05-18T03:36:46.833662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:46.833662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3615","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-18T03:36:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ndVdaMsnUPvfaI4KJNkZMH5EPG+a/mzQhCFHEXqKjDAcryeWJpqmD5qgU5+Nutl3zNKoFqaxUJPPfeyLiVYhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:02:08.343752Z"},"content_sha256":"b9ef04cbb64d116e94121c5ed4676a66a5ac84f2fa7fe8af3415a1c52687be60","schema_version":"1.0","event_id":"sha256:b9ef04cbb64d116e94121c5ed4676a66a5ac84f2fa7fe8af3415a1c52687be60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:D4RY5OD5CSFOR6ZH4FMARDYVLX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LO","authors_text":"J\\\"org Olschewski, Michael Ummels, Nicolas Markey, Patricia Bouyer","submitted_at":"2011-02-17T16:08:19Z","abstract_excerpt":"We study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the average number/weight of transitions blocked by the strategy. Using a translation into mean-payoff parity games, we prove that the problem of computing (the permissiveness of) a most permissive winning strategy is in NP intersected coNP. Along the way, we provide a new study of mean-payoff parity games. In particular, we prove that the opponent player has a memoryless optimal strategy and give a new algorithm for so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3615","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-18T03:36:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fyNvDDpJjmavyv8Jb2ZpyHGSRJWViiPnvihFvp/sVtfwBE539FWmUJxDmUdv8EMXYkeBbV0cGF7snQs73ZCpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:02:08.344111Z"},"content_sha256":"fba1bfdc24babe106dde08543c329d37a19c42a48e83cfdc2dea88a44bc386b8","schema_version":"1.0","event_id":"sha256:fba1bfdc24babe106dde08543c329d37a19c42a48e83cfdc2dea88a44bc386b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D4RY5OD5CSFOR6ZH4FMARDYVLX/bundle.json","state_url":"https://pith.science/pith/D4RY5OD5CSFOR6ZH4FMARDYVLX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D4RY5OD5CSFOR6ZH4FMARDYVLX/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-30T06:02:08Z","links":{"resolver":"https://pith.science/pith/D4RY5OD5CSFOR6ZH4FMARDYVLX","bundle":"https://pith.science/pith/D4RY5OD5CSFOR6ZH4FMARDYVLX/bundle.json","state":"https://pith.science/pith/D4RY5OD5CSFOR6ZH4FMARDYVLX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D4RY5OD5CSFOR6ZH4FMARDYVLX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:D4RY5OD5CSFOR6ZH4FMARDYVLX","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":"94d03ebcb3458dcc068fb6299f435fd9443ea9aef547de8778e798cccfc6ce7c","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-02-17T16:08:19Z","title_canon_sha256":"afc8130f1df13ffa416a8e5a470ba7a7d5137d52066761122e85ed086e2e2feb"},"schema_version":"1.0","source":{"id":"1102.3615","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3615","created_at":"2026-05-18T03:36:46Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3615v2","created_at":"2026-05-18T03:36:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3615","created_at":"2026-05-18T03:36:46Z"},{"alias_kind":"pith_short_12","alias_value":"D4RY5OD5CSFO","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"D4RY5OD5CSFOR6ZH","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"D4RY5OD5","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:fba1bfdc24babe106dde08543c329d37a19c42a48e83cfdc2dea88a44bc386b8","target":"graph","created_at":"2026-05-18T03:36:46Z","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 study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the average number/weight of transitions blocked by the strategy. Using a translation into mean-payoff parity games, we prove that the problem of computing (the permissiveness of) a most permissive winning strategy is in NP intersected coNP. Along the way, we provide a new study of mean-payoff parity games. In particular, we prove that the opponent player has a memoryless optimal strategy and give a new algorithm for so","authors_text":"J\\\"org Olschewski, Michael Ummels, Nicolas Markey, Patricia Bouyer","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-02-17T16:08:19Z","title":"Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3615","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:b9ef04cbb64d116e94121c5ed4676a66a5ac84f2fa7fe8af3415a1c52687be60","target":"record","created_at":"2026-05-18T03:36:46Z","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":"94d03ebcb3458dcc068fb6299f435fd9443ea9aef547de8778e798cccfc6ce7c","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-02-17T16:08:19Z","title_canon_sha256":"afc8130f1df13ffa416a8e5a470ba7a7d5137d52066761122e85ed086e2e2feb"},"schema_version":"1.0","source":{"id":"1102.3615","kind":"arxiv","version":2}},"canonical_sha256":"1f238eb87d148ae8fb27e158088f155df68ba19bb1fd6991e113b1841693ba06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f238eb87d148ae8fb27e158088f155df68ba19bb1fd6991e113b1841693ba06","first_computed_at":"2026-05-18T03:36:46.833662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:46.833662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oDLAX9Tkb+Di15TaZnZwH0ntBRoPYDKYZkjlZmzhfDh6FZs5CnS//07E4zOV/BhFqroNubEpGNnAzqoQz7JHAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:46.834329Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3615","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9ef04cbb64d116e94121c5ed4676a66a5ac84f2fa7fe8af3415a1c52687be60","sha256:fba1bfdc24babe106dde08543c329d37a19c42a48e83cfdc2dea88a44bc386b8"],"state_sha256":"0c01e2b87aea0a9fb0ddbd1087af00e48a1bade7bf2876d953be5b56f380aae1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KYZVn1aa+tVz2UvUQA3DwRovOlxcIrMagXGnyHpWPWhV2wHVZ5F7Oz+ob9o3zZDqj0dt/qHmQXjq/gvHXPC6Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:02:08.346679Z","bundle_sha256":"b21e381424c9f83ded5411b4cf0595949173aea83397104b96739a036339e305"}}