{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2Z5JZ3OGLRCU3U7LS6HGUPER6U","short_pith_number":"pith:2Z5JZ3OG","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"},"canonical_sha256":"d67a9cedc65c454dd3eb978e6a3c91f507c2409132eb0cb4176607b07ada1783","source":{"kind":"arxiv","id":"1611.08677","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08677","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08677v1","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08677","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"2Z5JZ3OGLRCU","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2Z5JZ3OGLRCU3U7L","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2Z5JZ3OG","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2Z5JZ3OGLRCU3U7LS6HGUPER6U","target":"record","payload":{"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"},"canonical_sha256":"d67a9cedc65c454dd3eb978e6a3c91f507c2409132eb0cb4176607b07ada1783","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"},"source_kind":"arxiv","source_id":"1611.08677","source_version":1,"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:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BD0aiTjNVnXj8I2f+Z2b4vH1hin6J2gQzB+Vi4HL0Ial+uPC2lMEoVK8ZL2mjn8ehWGfRmrxnV8O4LtHAT+FBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:45:28.444615Z"},"content_sha256":"7e9aad449d95319fcc9197a37b4a249305759084b073c11ed6b5f8182ea3742c","schema_version":"1.0","event_id":"sha256:7e9aad449d95319fcc9197a37b4a249305759084b073c11ed6b5f8182ea3742c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2Z5JZ3OGLRCU3U7LS6HGUPER6U","target":"graph","payload":{"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"},"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:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cL7PbZEgzMY2DbX8hbJlEtafg+HbdgB9vKky73VT1CI+hz7JQj3SC7cehu/OvI7ax6K1lFKut1eOTo9/YvlaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:45:28.444972Z"},"content_sha256":"5b7f885a7c57f4f2459d9b0b58753235ea22dcaa0157691a34ecf0b74512fbb4","schema_version":"1.0","event_id":"sha256:5b7f885a7c57f4f2459d9b0b58753235ea22dcaa0157691a34ecf0b74512fbb4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2Z5JZ3OGLRCU3U7LS6HGUPER6U/bundle.json","state_url":"https://pith.science/pith/2Z5JZ3OGLRCU3U7LS6HGUPER6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2Z5JZ3OGLRCU3U7LS6HGUPER6U/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-05-27T21:45:28Z","links":{"resolver":"https://pith.science/pith/2Z5JZ3OGLRCU3U7LS6HGUPER6U","bundle":"https://pith.science/pith/2Z5JZ3OGLRCU3U7LS6HGUPER6U/bundle.json","state":"https://pith.science/pith/2Z5JZ3OGLRCU3U7LS6HGUPER6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2Z5JZ3OGLRCU3U7LS6HGUPER6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2Z5JZ3OGLRCU3U7LS6HGUPER6U","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":"4480b46de59e5ecc5a6326d4edafeb5819a95af98f24d0378212b7552522d9b1","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-26T08:20:11Z","title_canon_sha256":"d7ff62d685e0c8a3f16dae7fa865f391e087a95e628c97f3c51b2e2db833d2e2"},"schema_version":"1.0","source":{"id":"1611.08677","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08677","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08677v1","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08677","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"2Z5JZ3OGLRCU","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2Z5JZ3OGLRCU3U7L","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2Z5JZ3OG","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:5b7f885a7c57f4f2459d9b0b58753235ea22dcaa0157691a34ecf0b74512fbb4","target":"graph","created_at":"2026-05-18T00:56:37Z","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":"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","authors_text":"Guillermo A. P\\'erez, Jean-Fran\\c{c}ois Raskin, Ocan Sankur, Romain Brenguier","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-26T08:20:11Z","title":"Admissibility in Quantitative Graph Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08677","kind":"arxiv","version":1},"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:7e9aad449d95319fcc9197a37b4a249305759084b073c11ed6b5f8182ea3742c","target":"record","created_at":"2026-05-18T00:56:37Z","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":"4480b46de59e5ecc5a6326d4edafeb5819a95af98f24d0378212b7552522d9b1","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-11-26T08:20:11Z","title_canon_sha256":"d7ff62d685e0c8a3f16dae7fa865f391e087a95e628c97f3c51b2e2db833d2e2"},"schema_version":"1.0","source":{"id":"1611.08677","kind":"arxiv","version":1}},"canonical_sha256":"d67a9cedc65c454dd3eb978e6a3c91f507c2409132eb0cb4176607b07ada1783","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d67a9cedc65c454dd3eb978e6a3c91f507c2409132eb0cb4176607b07ada1783","first_computed_at":"2026-05-18T00:56:37.157137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:37.157137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B+YNeWdAF5MY10bu0zAwaDoptquO14ugh1Vr9nqHGkUvao9gq5uEtdQUhoZ6so9rMVcNH7bPsHtlP0/x+MfOBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:37.157754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.08677","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e9aad449d95319fcc9197a37b4a249305759084b073c11ed6b5f8182ea3742c","sha256:5b7f885a7c57f4f2459d9b0b58753235ea22dcaa0157691a34ecf0b74512fbb4"],"state_sha256":"7d44a294ad74b04916428ea501b6e30ae88cf6199169ab02c54ad88ff76d6173"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ikZ2U60ssbBpr6LsBZaHq+S+k+iFWIHNH+wOKcLQZ8qk0Rhqd23SHNtjT5Bb6if6vYTMstl61c1KeT1JfU2gCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:45:28.448167Z","bundle_sha256":"5563c20cfeda0df3d8935c2556e91f351a3534628319549a32ef42fe935db3e8"}}