{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KUL5RHAEQF52LVIFONVF7BB7ML","short_pith_number":"pith:KUL5RHAE","canonical_record":{"source":{"id":"1205.4889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-22T12:08:37Z","cross_cats_sorted":[],"title_canon_sha256":"3e84a20f88e0cb8db3b8c82a7e7b135648b05b15dd525ab61220a14d8893cd6e","abstract_canon_sha256":"87b11eadfad99ed2327bc04184531a16a702709393adc311a2c787ae02f9454e"},"schema_version":"1.0"},"canonical_sha256":"5517d89c04817ba5d505736a5f843f62d0a294fda195178107ce4537fd1c8b97","source":{"kind":"arxiv","id":"1205.4889","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4889","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4889v1","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4889","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"pith_short_12","alias_value":"KUL5RHAEQF52","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KUL5RHAEQF52LVIF","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KUL5RHAE","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KUL5RHAEQF52LVIFONVF7BB7ML","target":"record","payload":{"canonical_record":{"source":{"id":"1205.4889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-22T12:08:37Z","cross_cats_sorted":[],"title_canon_sha256":"3e84a20f88e0cb8db3b8c82a7e7b135648b05b15dd525ab61220a14d8893cd6e","abstract_canon_sha256":"87b11eadfad99ed2327bc04184531a16a702709393adc311a2c787ae02f9454e"},"schema_version":"1.0"},"canonical_sha256":"5517d89c04817ba5d505736a5f843f62d0a294fda195178107ce4537fd1c8b97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:11.403495Z","signature_b64":"c0X9XS1fWTomGfniBYJxq0eX7Rz7tZVlIRkyzzilb0/I1s7lyVYFhEgE3NZGikLAsZgOvo5fECZWBOyB3BiOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5517d89c04817ba5d505736a5f843f62d0a294fda195178107ce4537fd1c8b97","last_reissued_at":"2026-05-18T03:55:11.402974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:11.402974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.4889","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-18T03:55:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TP9pPBzUneRxovvRTQ1IKkv/pMPSG8D0vxuzwTNCjP0tlmJhoLd2NeqZIeYJMHdd/AdTYihkDbGCQFMNkko2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:51:40.807723Z"},"content_sha256":"dfcae64d2a5f4db77ba4600241db7183ae84a1b2709bab8f3320b274435eed8b","schema_version":"1.0","event_id":"sha256:dfcae64d2a5f4db77ba4600241db7183ae84a1b2709bab8f3320b274435eed8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KUL5RHAEQF52LVIFONVF7BB7ML","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Equilibria in Quantitative Games with Reachability/Safety Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Julie De Pril, Thomas Brihaye, V\\'eronique Bruy\\`ere","submitted_at":"2012-05-22T12:08:37Z","abstract_excerpt":"In this paper, we study turn-based quantitative multiplayer non zero-sum games played on finite graphs with both reachability and safety objectives. In this framework a player with a reachability objective aims at reaching his own goal as soon as possible, whereas a player with a safety objective aims at avoiding his bad set or, if impossible, delaying its visit as long as possible. We prove the existence of Nash equilibria with finite memory in quantitative multiplayer reachability/safety games. Moreover, we prove the existence of finite-memory secure equilibria for quantitative two-player re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4889","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-18T03:55:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wEvMT+v/uyezlqodzHbu1djpOg7RLyZTxjGvprvJPXwivM6PQKtE1PXil4cF3tevW/0+BgMQTkJVC6VR44xUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:51:40.808054Z"},"content_sha256":"504a6f02c1ad334e9b72339973edaffc25bd92d126eb27dc1f851fa34dc4a1cc","schema_version":"1.0","event_id":"sha256:504a6f02c1ad334e9b72339973edaffc25bd92d126eb27dc1f851fa34dc4a1cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUL5RHAEQF52LVIFONVF7BB7ML/bundle.json","state_url":"https://pith.science/pith/KUL5RHAEQF52LVIFONVF7BB7ML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUL5RHAEQF52LVIFONVF7BB7ML/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-06-02T06:51:40Z","links":{"resolver":"https://pith.science/pith/KUL5RHAEQF52LVIFONVF7BB7ML","bundle":"https://pith.science/pith/KUL5RHAEQF52LVIFONVF7BB7ML/bundle.json","state":"https://pith.science/pith/KUL5RHAEQF52LVIFONVF7BB7ML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUL5RHAEQF52LVIFONVF7BB7ML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KUL5RHAEQF52LVIFONVF7BB7ML","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":"87b11eadfad99ed2327bc04184531a16a702709393adc311a2c787ae02f9454e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-22T12:08:37Z","title_canon_sha256":"3e84a20f88e0cb8db3b8c82a7e7b135648b05b15dd525ab61220a14d8893cd6e"},"schema_version":"1.0","source":{"id":"1205.4889","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.4889","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"arxiv_version","alias_value":"1205.4889v1","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.4889","created_at":"2026-05-18T03:55:11Z"},{"alias_kind":"pith_short_12","alias_value":"KUL5RHAEQF52","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KUL5RHAEQF52LVIF","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KUL5RHAE","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:504a6f02c1ad334e9b72339973edaffc25bd92d126eb27dc1f851fa34dc4a1cc","target":"graph","created_at":"2026-05-18T03:55:11Z","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":"In this paper, we study turn-based quantitative multiplayer non zero-sum games played on finite graphs with both reachability and safety objectives. In this framework a player with a reachability objective aims at reaching his own goal as soon as possible, whereas a player with a safety objective aims at avoiding his bad set or, if impossible, delaying its visit as long as possible. We prove the existence of Nash equilibria with finite memory in quantitative multiplayer reachability/safety games. Moreover, we prove the existence of finite-memory secure equilibria for quantitative two-player re","authors_text":"Julie De Pril, Thomas Brihaye, V\\'eronique Bruy\\`ere","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-22T12:08:37Z","title":"On Equilibria in Quantitative Games with Reachability/Safety Objectives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.4889","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:dfcae64d2a5f4db77ba4600241db7183ae84a1b2709bab8f3320b274435eed8b","target":"record","created_at":"2026-05-18T03:55:11Z","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":"87b11eadfad99ed2327bc04184531a16a702709393adc311a2c787ae02f9454e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-22T12:08:37Z","title_canon_sha256":"3e84a20f88e0cb8db3b8c82a7e7b135648b05b15dd525ab61220a14d8893cd6e"},"schema_version":"1.0","source":{"id":"1205.4889","kind":"arxiv","version":1}},"canonical_sha256":"5517d89c04817ba5d505736a5f843f62d0a294fda195178107ce4537fd1c8b97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5517d89c04817ba5d505736a5f843f62d0a294fda195178107ce4537fd1c8b97","first_computed_at":"2026-05-18T03:55:11.402974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:11.402974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c0X9XS1fWTomGfniBYJxq0eX7Rz7tZVlIRkyzzilb0/I1s7lyVYFhEgE3NZGikLAsZgOvo5fECZWBOyB3BiOCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:11.403495Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.4889","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfcae64d2a5f4db77ba4600241db7183ae84a1b2709bab8f3320b274435eed8b","sha256:504a6f02c1ad334e9b72339973edaffc25bd92d126eb27dc1f851fa34dc4a1cc"],"state_sha256":"ad756c7480fdc2c68a74ed61971811cdd1c028cb407a9c3212f8858b55079ca4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KjMBjs1WqFLdWAmH7PgKm25v+ppl3T6CCf0f/2oSS1kazcOcFXp+VCDvQXZYFkmel4Hv3kzCISLrXPWZL2z9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:51:40.809863Z","bundle_sha256":"30ca459bf229591c61c733d77deda7ffb5974dd72d83433e4f40ba23e0bda8f5"}}