{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2Z5JZ3OGLRCU3U7LS6HGUPER6U","short_pith_number":"pith:2Z5JZ3OG","schema_version":"1.0","canonical_sha256":"d67a9cedc65c454dd3eb978e6a3c91f507c2409132eb0cb4176607b07ada1783","source":{"kind":"arxiv","id":"1611.08677","version":1},"attestation_state":"computed","paper":{"title":"Admissibility in Quantitative Graph Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LO","authors_text":"Guillermo A. P\\'erez, Jean-Fran\\c{c}ois Raskin, Ocan Sankur, Romain Brenguier","submitted_at":"2016-11-26T08:20:11Z","abstract_excerpt":"Admissibility has been studied for games of infinite duration with Boolean objectives. We extend here this study to games of infinite duration with quantitative objectives. First, we show that, un- der the assumption that optimal worst-case and cooperative strategies exist, admissible strategies are guaranteed to exist. Second, we give a characterization of admissible strategies using the no- tion of adversarial and cooperative values of a history, and we characterize the set of outcomes that are compatible with admissible strategies. Finally, we show how these characterizations can be used to"},"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":"1611.08677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-26T08:20:11Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"d7ff62d685e0c8a3f16dae7fa865f391e087a95e628c97f3c51b2e2db833d2e2","abstract_canon_sha256":"4480b46de59e5ecc5a6326d4edafeb5819a95af98f24d0378212b7552522d9b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:37.157754Z","signature_b64":"B+YNeWdAF5MY10bu0zAwaDoptquO14ugh1Vr9nqHGkUvao9gq5uEtdQUhoZ6so9rMVcNH7bPsHtlP0/x+MfOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d67a9cedc65c454dd3eb978e6a3c91f507c2409132eb0cb4176607b07ada1783","last_reissued_at":"2026-05-18T00:56:37.157137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:37.157137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Admissibility in Quantitative Graph Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LO","authors_text":"Guillermo A. P\\'erez, Jean-Fran\\c{c}ois Raskin, Ocan Sankur, Romain Brenguier","submitted_at":"2016-11-26T08:20:11Z","abstract_excerpt":"Admissibility has been studied for games of infinite duration with Boolean objectives. We extend here this study to games of infinite duration with quantitative objectives. First, we show that, un- der the assumption that optimal worst-case and cooperative strategies exist, admissible strategies are guaranteed to exist. Second, we give a characterization of admissible strategies using the no- tion of adversarial and cooperative values of a history, and we characterize the set of outcomes that are compatible with admissible strategies. Finally, we show how these characterizations can be used to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08677","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":"1611.08677","created_at":"2026-05-18T00:56:37.157222+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.08677v1","created_at":"2026-05-18T00:56:37.157222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08677","created_at":"2026-05-18T00:56:37.157222+00:00"},{"alias_kind":"pith_short_12","alias_value":"2Z5JZ3OGLRCU","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2Z5JZ3OGLRCU3U7L","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2Z5JZ3OG","created_at":"2026-05-18T12:29:55.572404+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/2Z5JZ3OGLRCU3U7LS6HGUPER6U","json":"https://pith.science/pith/2Z5JZ3OGLRCU3U7LS6HGUPER6U.json","graph_json":"https://pith.science/api/pith-number/2Z5JZ3OGLRCU3U7LS6HGUPER6U/graph.json","events_json":"https://pith.science/api/pith-number/2Z5JZ3OGLRCU3U7LS6HGUPER6U/events.json","paper":"https://pith.science/paper/2Z5JZ3OG"},"agent_actions":{"view_html":"https://pith.science/pith/2Z5JZ3OGLRCU3U7LS6HGUPER6U","download_json":"https://pith.science/pith/2Z5JZ3OGLRCU3U7LS6HGUPER6U.json","view_paper":"https://pith.science/paper/2Z5JZ3OG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.08677&json=true","fetch_graph":"https://pith.science/api/pith-number/2Z5JZ3OGLRCU3U7LS6HGUPER6U/graph.json","fetch_events":"https://pith.science/api/pith-number/2Z5JZ3OGLRCU3U7LS6HGUPER6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2Z5JZ3OGLRCU3U7LS6HGUPER6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2Z5JZ3OGLRCU3U7LS6HGUPER6U/action/storage_attestation","attest_author":"https://pith.science/pith/2Z5JZ3OGLRCU3U7LS6HGUPER6U/action/author_attestation","sign_citation":"https://pith.science/pith/2Z5JZ3OGLRCU3U7LS6HGUPER6U/action/citation_signature","submit_replication":"https://pith.science/pith/2Z5JZ3OGLRCU3U7LS6HGUPER6U/action/replication_record"}},"created_at":"2026-05-18T00:56:37.157222+00:00","updated_at":"2026-05-18T00:56:37.157222+00:00"}