{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LHEZWGMNIPHI6OVZZGEZLNVNU6","short_pith_number":"pith:LHEZWGMN","schema_version":"1.0","canonical_sha256":"59c99b198d43ce8f3ab9c98995b6ada7a2d00717a00245f345b4c665ca252bca","source":{"kind":"arxiv","id":"1205.6346","version":3},"attestation_state":"computed","paper":{"title":"On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Hugo Gimbert, Julie De Pril, Thomas Brihaye, V\\'eronique Bruy\\`ere","submitted_at":"2012-05-29T12:34:24Z","abstract_excerpt":"We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are guaranteed to exist in the multiplayer (resp. two-player) case. The existence of secure equilibria in the multiplayer case remained and is still an open problem. In this paper, we focus our study on the concept of subgame perfect equilibrium, a refinement of Nash equilibrium well-suited in the framewo"},"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":"1205.6346","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-29T12:34:24Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"48916f25afe1dfd138d2e8aa11400145eff4f1e69d5d2db42f3fc97e8517c274","abstract_canon_sha256":"41c451acd282815398ad753ee7ea7676c6b0c55473c1df74f0e31b154210c617"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:24.079274Z","signature_b64":"K8WqXA2PGZ2Kwqz4u/TZvxBAQTQU5Udd0GOudZI3Y48c+/+293BK2mACiTO83mBqBhm9AcRzpgdF8xdEJoWOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59c99b198d43ce8f3ab9c98995b6ada7a2d00717a00245f345b4c665ca252bca","last_reissued_at":"2026-05-17T23:51:24.078607Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:24.078607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Hugo Gimbert, Julie De Pril, Thomas Brihaye, V\\'eronique Bruy\\`ere","submitted_at":"2012-05-29T12:34:24Z","abstract_excerpt":"We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set of states as soon as possible. A previous work on this model showed that Nash equilibria (resp. secure equilibria) are guaranteed to exist in the multiplayer (resp. two-player) case. The existence of secure equilibria in the multiplayer case remained and is still an open problem. In this paper, we focus our study on the concept of subgame perfect equilibrium, a refinement of Nash equilibrium well-suited in the framewo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6346","kind":"arxiv","version":3},"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":"1205.6346","created_at":"2026-05-17T23:51:24.078694+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.6346v3","created_at":"2026-05-17T23:51:24.078694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6346","created_at":"2026-05-17T23:51:24.078694+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHEZWGMNIPHI","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHEZWGMNIPHI6OVZ","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHEZWGMN","created_at":"2026-05-18T12:27:14.488303+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/LHEZWGMNIPHI6OVZZGEZLNVNU6","json":"https://pith.science/pith/LHEZWGMNIPHI6OVZZGEZLNVNU6.json","graph_json":"https://pith.science/api/pith-number/LHEZWGMNIPHI6OVZZGEZLNVNU6/graph.json","events_json":"https://pith.science/api/pith-number/LHEZWGMNIPHI6OVZZGEZLNVNU6/events.json","paper":"https://pith.science/paper/LHEZWGMN"},"agent_actions":{"view_html":"https://pith.science/pith/LHEZWGMNIPHI6OVZZGEZLNVNU6","download_json":"https://pith.science/pith/LHEZWGMNIPHI6OVZZGEZLNVNU6.json","view_paper":"https://pith.science/paper/LHEZWGMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.6346&json=true","fetch_graph":"https://pith.science/api/pith-number/LHEZWGMNIPHI6OVZZGEZLNVNU6/graph.json","fetch_events":"https://pith.science/api/pith-number/LHEZWGMNIPHI6OVZZGEZLNVNU6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHEZWGMNIPHI6OVZZGEZLNVNU6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHEZWGMNIPHI6OVZZGEZLNVNU6/action/storage_attestation","attest_author":"https://pith.science/pith/LHEZWGMNIPHI6OVZZGEZLNVNU6/action/author_attestation","sign_citation":"https://pith.science/pith/LHEZWGMNIPHI6OVZZGEZLNVNU6/action/citation_signature","submit_replication":"https://pith.science/pith/LHEZWGMNIPHI6OVZZGEZLNVNU6/action/replication_record"}},"created_at":"2026-05-17T23:51:24.078694+00:00","updated_at":"2026-05-17T23:51:24.078694+00:00"}