{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2EPPZLUULQN54SDBSJRL3MFOFV","short_pith_number":"pith:2EPPZLUU","schema_version":"1.0","canonical_sha256":"d11efcae945c1bde48619262bdb0ae2d78db1fb504d07adbf054048f8d5e785c","source":{"kind":"arxiv","id":"1805.11608","version":1},"attestation_state":"computed","paper":{"title":"Beyond admissibility: Dominance between chains of strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Arno Pauly, Isma\\\"el Jecker, Jean-Fran\\c{c}ois Raskin, Marie van den Bogaard, Nicolas Basset","submitted_at":"2018-05-29T17:47:40Z","abstract_excerpt":"Admissible strategies, i.e. those that are not dominated by any other strategy, are a typical rationality notion in game theory. In many classes of games this is justified by results showing that any strategy is admissible or dominated by an admissible strategy. However, in games played on finite graphs with quantitative objectives (as used for reactive synthesis), this is not the case.\n  We consider increasing chains of strategies instead to recover a satisfactory rationality notion based on dominance in such games. We start with some order-theoretic considerations establishing sufficient cri"},"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":"1805.11608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-05-29T17:47:40Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"cd8463ffd52a5f21059cd5a3da74d19a3d6d2b5d8434aa4055a61ed5f52f7e6f","abstract_canon_sha256":"31975fd4a4d62e762b240dd5500cfa387878d492fbde9bbbb349eaf11560b12c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:41.859387Z","signature_b64":"JBB721NhFufvYarDTjPS5HDiw9AIWIqL4EbeqHSWxIqN3mXf3lgF9KgFOIPrp7j+hLPGF9YWGHSO7Y9DPzDXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d11efcae945c1bde48619262bdb0ae2d78db1fb504d07adbf054048f8d5e785c","last_reissued_at":"2026-05-18T00:14:41.858811Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:41.858811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond admissibility: Dominance between chains of strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Arno Pauly, Isma\\\"el Jecker, Jean-Fran\\c{c}ois Raskin, Marie van den Bogaard, Nicolas Basset","submitted_at":"2018-05-29T17:47:40Z","abstract_excerpt":"Admissible strategies, i.e. those that are not dominated by any other strategy, are a typical rationality notion in game theory. In many classes of games this is justified by results showing that any strategy is admissible or dominated by an admissible strategy. However, in games played on finite graphs with quantitative objectives (as used for reactive synthesis), this is not the case.\n  We consider increasing chains of strategies instead to recover a satisfactory rationality notion based on dominance in such games. We start with some order-theoretic considerations establishing sufficient cri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11608","kind":"arxiv","version":1},"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":"1805.11608","created_at":"2026-05-18T00:14:41.858917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11608v1","created_at":"2026-05-18T00:14:41.858917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11608","created_at":"2026-05-18T00:14:41.858917+00:00"},{"alias_kind":"pith_short_12","alias_value":"2EPPZLUULQN5","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"2EPPZLUULQN54SDB","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"2EPPZLUU","created_at":"2026-05-18T12:31:59.375834+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/2EPPZLUULQN54SDBSJRL3MFOFV","json":"https://pith.science/pith/2EPPZLUULQN54SDBSJRL3MFOFV.json","graph_json":"https://pith.science/api/pith-number/2EPPZLUULQN54SDBSJRL3MFOFV/graph.json","events_json":"https://pith.science/api/pith-number/2EPPZLUULQN54SDBSJRL3MFOFV/events.json","paper":"https://pith.science/paper/2EPPZLUU"},"agent_actions":{"view_html":"https://pith.science/pith/2EPPZLUULQN54SDBSJRL3MFOFV","download_json":"https://pith.science/pith/2EPPZLUULQN54SDBSJRL3MFOFV.json","view_paper":"https://pith.science/paper/2EPPZLUU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11608&json=true","fetch_graph":"https://pith.science/api/pith-number/2EPPZLUULQN54SDBSJRL3MFOFV/graph.json","fetch_events":"https://pith.science/api/pith-number/2EPPZLUULQN54SDBSJRL3MFOFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2EPPZLUULQN54SDBSJRL3MFOFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2EPPZLUULQN54SDBSJRL3MFOFV/action/storage_attestation","attest_author":"https://pith.science/pith/2EPPZLUULQN54SDBSJRL3MFOFV/action/author_attestation","sign_citation":"https://pith.science/pith/2EPPZLUULQN54SDBSJRL3MFOFV/action/citation_signature","submit_replication":"https://pith.science/pith/2EPPZLUULQN54SDBSJRL3MFOFV/action/replication_record"}},"created_at":"2026-05-18T00:14:41.858917+00:00","updated_at":"2026-05-18T00:14:41.858917+00:00"}