{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SAPJW4X7EHXVEHBK46Z4EBAEQV","short_pith_number":"pith:SAPJW4X7","canonical_record":{"source":{"id":"1606.01831","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-06-06T17:10:22Z","cross_cats_sorted":["cs.FL","cs.GT"],"title_canon_sha256":"5dc582e5c9876a5f04c4b6f298bea2a92ead8044b7a798e79ff07745ab1d4634","abstract_canon_sha256":"fff9c57039d8bccd29e425a172159c32b1c8b480e5f75ba75e45414928ba6b18"},"schema_version":"1.0"},"canonical_sha256":"901e9b72ff21ef521c2ae7b3c2040485546dd9515a192f3f2bd84e2fc1a4c8ab","source":{"kind":"arxiv","id":"1606.01831","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01831","created_at":"2026-05-18T01:04:41Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01831v2","created_at":"2026-05-18T01:04:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01831","created_at":"2026-05-18T01:04:41Z"},{"alias_kind":"pith_short_12","alias_value":"SAPJW4X7EHXV","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SAPJW4X7EHXVEHBK","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SAPJW4X7","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SAPJW4X7EHXVEHBK46Z4EBAEQV","target":"record","payload":{"canonical_record":{"source":{"id":"1606.01831","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-06-06T17:10:22Z","cross_cats_sorted":["cs.FL","cs.GT"],"title_canon_sha256":"5dc582e5c9876a5f04c4b6f298bea2a92ead8044b7a798e79ff07745ab1d4634","abstract_canon_sha256":"fff9c57039d8bccd29e425a172159c32b1c8b480e5f75ba75e45414928ba6b18"},"schema_version":"1.0"},"canonical_sha256":"901e9b72ff21ef521c2ae7b3c2040485546dd9515a192f3f2bd84e2fc1a4c8ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:41.193526Z","signature_b64":"0fd0HQwAgqGKIbsovezKMdHDzGRxnOsaWzMoU+J3Y1rN5pwWuveDhmCLLYujR6pjP8ulnWbiSlUIhN2sKEImDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"901e9b72ff21ef521c2ae7b3c2040485546dd9515a192f3f2bd84e2fc1a4c8ab","last_reissued_at":"2026-05-18T01:04:41.192967Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:41.192967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.01831","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-18T01:04:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2aMLmV3vTm3g2TgV/LWqjHh1NCD/PCI63i2S3aqmx6cb7yfYUAGceaY5pvm9bZ/D4Nh709+E9PayW288WsrADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:26:33.142212Z"},"content_sha256":"73d85ea4c87ada55c962c6eccae7c4d475c56ff9bd0b5484196872e02aee82ca","schema_version":"1.0","event_id":"sha256:73d85ea4c87ada55c962c6eccae7c4d475c56ff9bd0b5484196872e02aee82ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SAPJW4X7EHXVEHBK46Z4EBAEQV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.GT"],"primary_cat":"cs.LO","authors_text":"Mickael Randour, Quentin Hautem, V\\'eronique Bruy\\`ere","submitted_at":"2016-06-06T17:10:22Z","abstract_excerpt":"Classical objectives in two-player zero-sum games played on graphs often deal with limit behaviors of infinite plays: e.g., mean-payoff and total-payoff in the quantitative setting, or parity in the qualitative one (a canonical way to encode omega-regular properties). Those objectives offer powerful abstraction mechanisms and often yield nice properties such as memoryless determinacy. However, their very nature provides no guarantee on time bounds within which something good can be witnessed. In this work, we consider two approaches toward inclusion of time bounds in parity games. The first on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01831","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-18T01:04:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PJuAkzLuwZNooRxvPlEbWGcntt1QWl3c8WWH+GrY3Fxs0BHzx5p+4Oxt3EMIGBmgMGyZD/VM2YKcfpO9+gl/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:26:33.142575Z"},"content_sha256":"11210f1bf7d11dafec05e528eae8c9b5d0099934e8c757e7b40f32c30e12d954","schema_version":"1.0","event_id":"sha256:11210f1bf7d11dafec05e528eae8c9b5d0099934e8c757e7b40f32c30e12d954"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SAPJW4X7EHXVEHBK46Z4EBAEQV/bundle.json","state_url":"https://pith.science/pith/SAPJW4X7EHXVEHBK46Z4EBAEQV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SAPJW4X7EHXVEHBK46Z4EBAEQV/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-21T19:26:33Z","links":{"resolver":"https://pith.science/pith/SAPJW4X7EHXVEHBK46Z4EBAEQV","bundle":"https://pith.science/pith/SAPJW4X7EHXVEHBK46Z4EBAEQV/bundle.json","state":"https://pith.science/pith/SAPJW4X7EHXVEHBK46Z4EBAEQV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SAPJW4X7EHXVEHBK46Z4EBAEQV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SAPJW4X7EHXVEHBK46Z4EBAEQV","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":"fff9c57039d8bccd29e425a172159c32b1c8b480e5f75ba75e45414928ba6b18","cross_cats_sorted":["cs.FL","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-06-06T17:10:22Z","title_canon_sha256":"5dc582e5c9876a5f04c4b6f298bea2a92ead8044b7a798e79ff07745ab1d4634"},"schema_version":"1.0","source":{"id":"1606.01831","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01831","created_at":"2026-05-18T01:04:41Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01831v2","created_at":"2026-05-18T01:04:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01831","created_at":"2026-05-18T01:04:41Z"},{"alias_kind":"pith_short_12","alias_value":"SAPJW4X7EHXV","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SAPJW4X7EHXVEHBK","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SAPJW4X7","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:11210f1bf7d11dafec05e528eae8c9b5d0099934e8c757e7b40f32c30e12d954","target":"graph","created_at":"2026-05-18T01:04:41Z","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":"Classical objectives in two-player zero-sum games played on graphs often deal with limit behaviors of infinite plays: e.g., mean-payoff and total-payoff in the quantitative setting, or parity in the qualitative one (a canonical way to encode omega-regular properties). Those objectives offer powerful abstraction mechanisms and often yield nice properties such as memoryless determinacy. However, their very nature provides no guarantee on time bounds within which something good can be witnessed. In this work, we consider two approaches toward inclusion of time bounds in parity games. The first on","authors_text":"Mickael Randour, Quentin Hautem, V\\'eronique Bruy\\`ere","cross_cats":["cs.FL","cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-06-06T17:10:22Z","title":"Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01831","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:73d85ea4c87ada55c962c6eccae7c4d475c56ff9bd0b5484196872e02aee82ca","target":"record","created_at":"2026-05-18T01:04:41Z","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":"fff9c57039d8bccd29e425a172159c32b1c8b480e5f75ba75e45414928ba6b18","cross_cats_sorted":["cs.FL","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-06-06T17:10:22Z","title_canon_sha256":"5dc582e5c9876a5f04c4b6f298bea2a92ead8044b7a798e79ff07745ab1d4634"},"schema_version":"1.0","source":{"id":"1606.01831","kind":"arxiv","version":2}},"canonical_sha256":"901e9b72ff21ef521c2ae7b3c2040485546dd9515a192f3f2bd84e2fc1a4c8ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"901e9b72ff21ef521c2ae7b3c2040485546dd9515a192f3f2bd84e2fc1a4c8ab","first_computed_at":"2026-05-18T01:04:41.192967Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:41.192967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0fd0HQwAgqGKIbsovezKMdHDzGRxnOsaWzMoU+J3Y1rN5pwWuveDhmCLLYujR6pjP8ulnWbiSlUIhN2sKEImDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:41.193526Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.01831","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73d85ea4c87ada55c962c6eccae7c4d475c56ff9bd0b5484196872e02aee82ca","sha256:11210f1bf7d11dafec05e528eae8c9b5d0099934e8c757e7b40f32c30e12d954"],"state_sha256":"8fbc96664e402fb876687adca53f20a13d8330cac5553ac531311f2e85804ee2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kli6GB0O8r2pQShXYBzihcJyJq+5U/B5Eeu/j/13I+SR/eec3tHGKdE3NaToccMe+dw5ZyNqn3UQfwSKSuh4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T19:26:33.144542Z","bundle_sha256":"40bb9a92dbf5fd58f4a0d7392064b4f26f57b9a871423597ebdb76c65e7d3fdd"}}