{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VLQI7RGMVJK6ETMTVWLBLDHI3O","short_pith_number":"pith:VLQI7RGM","canonical_record":{"source":{"id":"1808.05791","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-08-17T08:25:42Z","cross_cats_sorted":["cs.FL","cs.LO"],"title_canon_sha256":"b42cf0b375d62b3000ef8d775fe8150d04908da7df5cd4c5f577d07f947d2f4a","abstract_canon_sha256":"7827085319e445c739463ebe265298b5da84d25f8eada8c80c1b4575ec4d4dc5"},"schema_version":"1.0"},"canonical_sha256":"aae08fc4ccaa55e24d93ad96158ce8dba12b5aba94b571f17fc6da7b124a65e8","source":{"kind":"arxiv","id":"1808.05791","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05791","created_at":"2026-05-18T00:04:02Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05791v2","created_at":"2026-05-18T00:04:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05791","created_at":"2026-05-18T00:04:02Z"},{"alias_kind":"pith_short_12","alias_value":"VLQI7RGMVJK6","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VLQI7RGMVJK6ETMT","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VLQI7RGM","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VLQI7RGMVJK6ETMTVWLBLDHI3O","target":"record","payload":{"canonical_record":{"source":{"id":"1808.05791","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-08-17T08:25:42Z","cross_cats_sorted":["cs.FL","cs.LO"],"title_canon_sha256":"b42cf0b375d62b3000ef8d775fe8150d04908da7df5cd4c5f577d07f947d2f4a","abstract_canon_sha256":"7827085319e445c739463ebe265298b5da84d25f8eada8c80c1b4575ec4d4dc5"},"schema_version":"1.0"},"canonical_sha256":"aae08fc4ccaa55e24d93ad96158ce8dba12b5aba94b571f17fc6da7b124a65e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:02.317605Z","signature_b64":"8II2tEjdrpAp7bd0AJQDN4kEZlPX1YOAsG0/6d28CeiTYgR9iLnU0yW8035Vzpfle3wsxTQ0vWrdy2p7rrKPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aae08fc4ccaa55e24d93ad96158ce8dba12b5aba94b571f17fc6da7b124a65e8","last_reissued_at":"2026-05-18T00:04:02.316905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:02.316905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.05791","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:04:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xifny+py2/XqINmiVByohnuD+rt1xQIRWUP2Qa5KTA7FG9oXB5LsjazWt0tC1z058j3PWtKyykwYAg+PIrpMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:33:45.291393Z"},"content_sha256":"c7e6e8280049958accbe75d53b3c96bfea074a9a198df877ae09a8a34f18784f","schema_version":"1.0","event_id":"sha256:c7e6e8280049958accbe75d53b3c96bfea074a9a198df877ae09a8a34f18784f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VLQI7RGMVJK6ETMTVWLBLDHI3O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extending finite-memory determinacy by Boolean combination of winning conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.LO"],"primary_cat":"cs.GT","authors_text":"Arno Pauly, Mickael Randour, St\\'ephane Le Roux","submitted_at":"2018-08-17T08:25:42Z","abstract_excerpt":"We study finite-memory (FM) determinacy in games on finite graphs, a central question for applications in controller synthesis, as FM strategies correspond to implementable controllers. We establish general conditions under which FM strategies suffice to play optimally, even in a broad multi-objective setting. We show that our framework encompasses important classes of games from the literature, and permits to go further, using a unified approach. While such an approach cannot match ad-hoc proofs with regard to tightness of memory bounds, it has two advantages: first, it gives a widely-applica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05791","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:04:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"88XEvlr702aF/cOCmsDkn1JTnXfDpt2sjWqfBkGvnI1eP8TnY1QND3R69WTHvmHdbXV5d3Rd/Ctg2ONJtu3lBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:33:45.291971Z"},"content_sha256":"b7529586b4483f80b198692a911c2a0b4b18a31ad245307277f632595dbcda4b","schema_version":"1.0","event_id":"sha256:b7529586b4483f80b198692a911c2a0b4b18a31ad245307277f632595dbcda4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLQI7RGMVJK6ETMTVWLBLDHI3O/bundle.json","state_url":"https://pith.science/pith/VLQI7RGMVJK6ETMTVWLBLDHI3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLQI7RGMVJK6ETMTVWLBLDHI3O/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-25T11:33:45Z","links":{"resolver":"https://pith.science/pith/VLQI7RGMVJK6ETMTVWLBLDHI3O","bundle":"https://pith.science/pith/VLQI7RGMVJK6ETMTVWLBLDHI3O/bundle.json","state":"https://pith.science/pith/VLQI7RGMVJK6ETMTVWLBLDHI3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLQI7RGMVJK6ETMTVWLBLDHI3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VLQI7RGMVJK6ETMTVWLBLDHI3O","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":"7827085319e445c739463ebe265298b5da84d25f8eada8c80c1b4575ec4d4dc5","cross_cats_sorted":["cs.FL","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-08-17T08:25:42Z","title_canon_sha256":"b42cf0b375d62b3000ef8d775fe8150d04908da7df5cd4c5f577d07f947d2f4a"},"schema_version":"1.0","source":{"id":"1808.05791","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.05791","created_at":"2026-05-18T00:04:02Z"},{"alias_kind":"arxiv_version","alias_value":"1808.05791v2","created_at":"2026-05-18T00:04:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05791","created_at":"2026-05-18T00:04:02Z"},{"alias_kind":"pith_short_12","alias_value":"VLQI7RGMVJK6","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VLQI7RGMVJK6ETMT","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VLQI7RGM","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:b7529586b4483f80b198692a911c2a0b4b18a31ad245307277f632595dbcda4b","target":"graph","created_at":"2026-05-18T00:04:02Z","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 finite-memory (FM) determinacy in games on finite graphs, a central question for applications in controller synthesis, as FM strategies correspond to implementable controllers. We establish general conditions under which FM strategies suffice to play optimally, even in a broad multi-objective setting. We show that our framework encompasses important classes of games from the literature, and permits to go further, using a unified approach. While such an approach cannot match ad-hoc proofs with regard to tightness of memory bounds, it has two advantages: first, it gives a widely-applica","authors_text":"Arno Pauly, Mickael Randour, St\\'ephane Le Roux","cross_cats":["cs.FL","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-08-17T08:25:42Z","title":"Extending finite-memory determinacy by Boolean combination of winning conditions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05791","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:c7e6e8280049958accbe75d53b3c96bfea074a9a198df877ae09a8a34f18784f","target":"record","created_at":"2026-05-18T00:04:02Z","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":"7827085319e445c739463ebe265298b5da84d25f8eada8c80c1b4575ec4d4dc5","cross_cats_sorted":["cs.FL","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-08-17T08:25:42Z","title_canon_sha256":"b42cf0b375d62b3000ef8d775fe8150d04908da7df5cd4c5f577d07f947d2f4a"},"schema_version":"1.0","source":{"id":"1808.05791","kind":"arxiv","version":2}},"canonical_sha256":"aae08fc4ccaa55e24d93ad96158ce8dba12b5aba94b571f17fc6da7b124a65e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aae08fc4ccaa55e24d93ad96158ce8dba12b5aba94b571f17fc6da7b124a65e8","first_computed_at":"2026-05-18T00:04:02.316905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:02.316905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8II2tEjdrpAp7bd0AJQDN4kEZlPX1YOAsG0/6d28CeiTYgR9iLnU0yW8035Vzpfle3wsxTQ0vWrdy2p7rrKPAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:02.317605Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.05791","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7e6e8280049958accbe75d53b3c96bfea074a9a198df877ae09a8a34f18784f","sha256:b7529586b4483f80b198692a911c2a0b4b18a31ad245307277f632595dbcda4b"],"state_sha256":"3023462fd9c933661881628f2e224f4e40b616062c4ec13ba74d9b751cfd3449"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jWG5M19H77W4WZOawDgtxyPpxlR9vnm6FxCHmaHDGb6Xr1ytHSc5lV6hpg9APXhhVQ3rCcJjsr6cQQEYbWxOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T11:33:45.294673Z","bundle_sha256":"607884a96d393819f8d2658dbbc474764a979b9ffb98d234123d9f5c4889466c"}}