{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RH472XG4OHWN7KX2E43DKARVUZ","short_pith_number":"pith:RH472XG4","schema_version":"1.0","canonical_sha256":"89f9fd5cdc71ecdfaafa2736350235a64898751d7f5064c162f84d6372141546","source":{"kind":"arxiv","id":"2208.08238","version":1},"attestation_state":"computed","paper":{"title":"Last-iterate Convergence to Trembling-hand Perfect Equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alberto Marchesi, Francesco Trov\\`o, Martino Bernasconi","submitted_at":"2022-08-17T11:35:39Z","abstract_excerpt":"Designing efficient algorithms to find Nash equilibrium (NE) refinements in sequential games is of paramount importance in practice. Indeed, it is well known that the NE has several weaknesses, since it may prescribe to play sub-optimal actions in those parts of the game that are never reached at the equilibrium. NE refinements, such as the extensive-form perfect equilibrium (EFPE), amend such weaknesses by accounting for the possibility of players' mistakes. This is crucial in real-world applications, where bounded rationality players are usually involved, and it turns out being useful also i"},"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":"2208.08238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-08-17T11:35:39Z","cross_cats_sorted":[],"title_canon_sha256":"c408a0f894a4c3acc09e56ba9bc050b5f154ba3d06df7d1d5e50578ec705e245","abstract_canon_sha256":"4400c9a2435271d2d885d87e788ad8a1fbd81bcdda35e048d7a530a534a9b54f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:49:25.526075Z","signature_b64":"xDH0HCM7vZ4Hiiubd+yNH5CiXlH/PpkjomplVVAOQykoaGaqL1x+/hFdxZXTHYPJhX4xt4SFAuap5uC1x6E7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89f9fd5cdc71ecdfaafa2736350235a64898751d7f5064c162f84d6372141546","last_reissued_at":"2026-07-05T04:49:25.525742Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:49:25.525742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Last-iterate Convergence to Trembling-hand Perfect Equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alberto Marchesi, Francesco Trov\\`o, Martino Bernasconi","submitted_at":"2022-08-17T11:35:39Z","abstract_excerpt":"Designing efficient algorithms to find Nash equilibrium (NE) refinements in sequential games is of paramount importance in practice. Indeed, it is well known that the NE has several weaknesses, since it may prescribe to play sub-optimal actions in those parts of the game that are never reached at the equilibrium. NE refinements, such as the extensive-form perfect equilibrium (EFPE), amend such weaknesses by accounting for the possibility of players' mistakes. This is crucial in real-world applications, where bounded rationality players are usually involved, and it turns out being useful also i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.08238","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.08238/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2208.08238","created_at":"2026-07-05T04:49:25.525797+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.08238v1","created_at":"2026-07-05T04:49:25.525797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.08238","created_at":"2026-07-05T04:49:25.525797+00:00"},{"alias_kind":"pith_short_12","alias_value":"RH472XG4OHWN","created_at":"2026-07-05T04:49:25.525797+00:00"},{"alias_kind":"pith_short_16","alias_value":"RH472XG4OHWN7KX2","created_at":"2026-07-05T04:49:25.525797+00:00"},{"alias_kind":"pith_short_8","alias_value":"RH472XG4","created_at":"2026-07-05T04:49:25.525797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.05747","citing_title":"Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RH472XG4OHWN7KX2E43DKARVUZ","json":"https://pith.science/pith/RH472XG4OHWN7KX2E43DKARVUZ.json","graph_json":"https://pith.science/api/pith-number/RH472XG4OHWN7KX2E43DKARVUZ/graph.json","events_json":"https://pith.science/api/pith-number/RH472XG4OHWN7KX2E43DKARVUZ/events.json","paper":"https://pith.science/paper/RH472XG4"},"agent_actions":{"view_html":"https://pith.science/pith/RH472XG4OHWN7KX2E43DKARVUZ","download_json":"https://pith.science/pith/RH472XG4OHWN7KX2E43DKARVUZ.json","view_paper":"https://pith.science/paper/RH472XG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.08238&json=true","fetch_graph":"https://pith.science/api/pith-number/RH472XG4OHWN7KX2E43DKARVUZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RH472XG4OHWN7KX2E43DKARVUZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RH472XG4OHWN7KX2E43DKARVUZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RH472XG4OHWN7KX2E43DKARVUZ/action/storage_attestation","attest_author":"https://pith.science/pith/RH472XG4OHWN7KX2E43DKARVUZ/action/author_attestation","sign_citation":"https://pith.science/pith/RH472XG4OHWN7KX2E43DKARVUZ/action/citation_signature","submit_replication":"https://pith.science/pith/RH472XG4OHWN7KX2E43DKARVUZ/action/replication_record"}},"created_at":"2026-07-05T04:49:25.525797+00:00","updated_at":"2026-07-05T04:49:25.525797+00:00"}