{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3T3XASN2IX4HUQEL5NTU32ZBHN","short_pith_number":"pith:3T3XASN2","schema_version":"1.0","canonical_sha256":"dcf77049ba45f87a408beb674deb213b6d2f5075d2ce9d58c7a2cde67fa83543","source":{"kind":"arxiv","id":"2305.10546","version":2},"attestation_state":"computed","paper":{"title":"Games on Graphs: From Logic and Automata to Algorithms","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.FL","cs.LO"],"primary_cat":"cs.GT","authors_text":"Antonio Casares, Arnaud Carayol, Benjamin Monmege, C. Aiswarya, Florian Horn, Guy Avni, Hugo Gimbert, John Fearnley, Mateusz Skomra, Mickael Randour, Nathalie Bertrand, Nathalie Sznajder, Nathana\\\"el Fijalkow, Nicolas Markey, Ocan Sankur, Olivier Serre, Patricia Bouyer, Paul Gastin, Petr Novotn\\'y, Pierre Ohlmann, Pierre Vandenhove, Rasmus Ibsen-Jensen, Romain Brenguier, Sylvain Schmitz, Thomas A. Henzinger","submitted_at":"2023-05-17T20:06:14Z","abstract_excerpt":"The objective of this book is to give a comprehensive presentation of the research field concerned with infinite duration games on graphs. Historically, these game models appeared in the study of automata and logic, and they later became important for program verification and synthesis. They have many more applications, in particular some of the models investigated in this book were introduced and studied in neighbouring research communities such as optimisation, reinforcement learning, model theory, and set theory."},"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":"2305.10546","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.GT","submitted_at":"2023-05-17T20:06:14Z","cross_cats_sorted":["cs.FL","cs.LO"],"title_canon_sha256":"225908a13989862af2678c2ad78c0f9661505a49fb8e546411cdb77af13cfc3e","abstract_canon_sha256":"3a95f34f7739af9dba7ae8a198b8600a32e811698386557e95ff2ec6b312536e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:37.833324Z","signature_b64":"Sh1RwpB1P/rpVaJt/9qxXQEzy7gWBPhpwSHVQq19/+qGOFJ57JjlsHxT2UJW6sXIX4v3ZVVXQasb6dXIyJGaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcf77049ba45f87a408beb674deb213b6d2f5075d2ce9d58c7a2cde67fa83543","last_reissued_at":"2026-07-05T11:44:37.832815Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:37.832815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Games on Graphs: From Logic and Automata to Algorithms","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.FL","cs.LO"],"primary_cat":"cs.GT","authors_text":"Antonio Casares, Arnaud Carayol, Benjamin Monmege, C. Aiswarya, Florian Horn, Guy Avni, Hugo Gimbert, John Fearnley, Mateusz Skomra, Mickael Randour, Nathalie Bertrand, Nathalie Sznajder, Nathana\\\"el Fijalkow, Nicolas Markey, Ocan Sankur, Olivier Serre, Patricia Bouyer, Paul Gastin, Petr Novotn\\'y, Pierre Ohlmann, Pierre Vandenhove, Rasmus Ibsen-Jensen, Romain Brenguier, Sylvain Schmitz, Thomas A. Henzinger","submitted_at":"2023-05-17T20:06:14Z","abstract_excerpt":"The objective of this book is to give a comprehensive presentation of the research field concerned with infinite duration games on graphs. Historically, these game models appeared in the study of automata and logic, and they later became important for program verification and synthesis. They have many more applications, in particular some of the models investigated in this book were introduced and studied in neighbouring research communities such as optimisation, reinforcement learning, model theory, and set theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.10546","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.10546/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2305.10546","created_at":"2026-07-05T11:44:37.832884+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.10546v2","created_at":"2026-07-05T11:44:37.832884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.10546","created_at":"2026-07-05T11:44:37.832884+00:00"},{"alias_kind":"pith_short_12","alias_value":"3T3XASN2IX4H","created_at":"2026-07-05T11:44:37.832884+00:00"},{"alias_kind":"pith_short_16","alias_value":"3T3XASN2IX4HUQEL","created_at":"2026-07-05T11:44:37.832884+00:00"},{"alias_kind":"pith_short_8","alias_value":"3T3XASN2","created_at":"2026-07-05T11:44:37.832884+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07151","citing_title":"Simple Nash Equilibria for Qualitative Multiplayer Games","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2511.11545","citing_title":"Incremental Data-Driven Policy Synthesis via Game Abstractions","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3T3XASN2IX4HUQEL5NTU32ZBHN","json":"https://pith.science/pith/3T3XASN2IX4HUQEL5NTU32ZBHN.json","graph_json":"https://pith.science/api/pith-number/3T3XASN2IX4HUQEL5NTU32ZBHN/graph.json","events_json":"https://pith.science/api/pith-number/3T3XASN2IX4HUQEL5NTU32ZBHN/events.json","paper":"https://pith.science/paper/3T3XASN2"},"agent_actions":{"view_html":"https://pith.science/pith/3T3XASN2IX4HUQEL5NTU32ZBHN","download_json":"https://pith.science/pith/3T3XASN2IX4HUQEL5NTU32ZBHN.json","view_paper":"https://pith.science/paper/3T3XASN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.10546&json=true","fetch_graph":"https://pith.science/api/pith-number/3T3XASN2IX4HUQEL5NTU32ZBHN/graph.json","fetch_events":"https://pith.science/api/pith-number/3T3XASN2IX4HUQEL5NTU32ZBHN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3T3XASN2IX4HUQEL5NTU32ZBHN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3T3XASN2IX4HUQEL5NTU32ZBHN/action/storage_attestation","attest_author":"https://pith.science/pith/3T3XASN2IX4HUQEL5NTU32ZBHN/action/author_attestation","sign_citation":"https://pith.science/pith/3T3XASN2IX4HUQEL5NTU32ZBHN/action/citation_signature","submit_replication":"https://pith.science/pith/3T3XASN2IX4HUQEL5NTU32ZBHN/action/replication_record"}},"created_at":"2026-07-05T11:44:37.832884+00:00","updated_at":"2026-07-05T11:44:37.832884+00:00"}