{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VLQI7RGMVJK6ETMTVWLBLDHI3O","short_pith_number":"pith:VLQI7RGM","schema_version":"1.0","canonical_sha256":"aae08fc4ccaa55e24d93ad96158ce8dba12b5aba94b571f17fc6da7b124a65e8","source":{"kind":"arxiv","id":"1808.05791","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.05791","created_at":"2026-05-18T00:04:02.317022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.05791v2","created_at":"2026-05-18T00:04:02.317022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05791","created_at":"2026-05-18T00:04:02.317022+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLQI7RGMVJK6","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLQI7RGMVJK6ETMT","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLQI7RGM","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VLQI7RGMVJK6ETMTVWLBLDHI3O","json":"https://pith.science/pith/VLQI7RGMVJK6ETMTVWLBLDHI3O.json","graph_json":"https://pith.science/api/pith-number/VLQI7RGMVJK6ETMTVWLBLDHI3O/graph.json","events_json":"https://pith.science/api/pith-number/VLQI7RGMVJK6ETMTVWLBLDHI3O/events.json","paper":"https://pith.science/paper/VLQI7RGM"},"agent_actions":{"view_html":"https://pith.science/pith/VLQI7RGMVJK6ETMTVWLBLDHI3O","download_json":"https://pith.science/pith/VLQI7RGMVJK6ETMTVWLBLDHI3O.json","view_paper":"https://pith.science/paper/VLQI7RGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.05791&json=true","fetch_graph":"https://pith.science/api/pith-number/VLQI7RGMVJK6ETMTVWLBLDHI3O/graph.json","fetch_events":"https://pith.science/api/pith-number/VLQI7RGMVJK6ETMTVWLBLDHI3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLQI7RGMVJK6ETMTVWLBLDHI3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLQI7RGMVJK6ETMTVWLBLDHI3O/action/storage_attestation","attest_author":"https://pith.science/pith/VLQI7RGMVJK6ETMTVWLBLDHI3O/action/author_attestation","sign_citation":"https://pith.science/pith/VLQI7RGMVJK6ETMTVWLBLDHI3O/action/citation_signature","submit_replication":"https://pith.science/pith/VLQI7RGMVJK6ETMTVWLBLDHI3O/action/replication_record"}},"created_at":"2026-05-18T00:04:02.317022+00:00","updated_at":"2026-05-18T00:04:02.317022+00:00"}