{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NPWNFUW2ZM2DHTPS3GBDRXE45L","short_pith_number":"pith:NPWNFUW2","schema_version":"1.0","canonical_sha256":"6becd2d2dacb3433cdf2d98238dc9ceac54c1886af9662bc8381b00831a79553","source":{"kind":"arxiv","id":"2203.14129","version":1},"attestation_state":"computed","paper":{"title":"Nash, Conley, and Computation: Impossibility and Incompleteness in Game Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","econ.TH","math.DS"],"primary_cat":"cs.GT","authors_text":"Christos Papadimitriou, Georgios Piliouras, Jason Milionis, Kelly Spendlove","submitted_at":"2022-03-26T18:27:40Z","abstract_excerpt":"Under what conditions do the behaviors of players, who play a game repeatedly, converge to a Nash equilibrium? If one assumes that the players' behavior is a discrete-time or continuous-time rule whereby the current mixed strategy profile is mapped to the next, this becomes a problem in the theory of dynamical systems. We apply this theory, and in particular the concepts of chain recurrence, attractors, and Conley index, to prove a general impossibility result: there exist games for which any dynamics is bound to have starting points that do not end up at a Nash equilibrium. We also prove a st"},"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":"2203.14129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-03-26T18:27:40Z","cross_cats_sorted":["cs.LG","econ.TH","math.DS"],"title_canon_sha256":"2bae89abbd6a8ef9b9da919c502fd899d3fbbc33c965ba6d4ebcec5d454a2896","abstract_canon_sha256":"c4451cb236c3fe5fffe38ba202cee0dd9f2b397783afd4012ca7b03c496ad99e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:08:47.297798Z","signature_b64":"Kp7iFUAR8C7xeSYg4zpX/bwroLG/oS3Dh4pYKE8G/cNx7H8rLUrWd4hkuzkzT29bE5H07euUKoedDQWHQio2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6becd2d2dacb3433cdf2d98238dc9ceac54c1886af9662bc8381b00831a79553","last_reissued_at":"2026-07-05T04:08:47.297173Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:08:47.297173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nash, Conley, and Computation: Impossibility and Incompleteness in Game Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","econ.TH","math.DS"],"primary_cat":"cs.GT","authors_text":"Christos Papadimitriou, Georgios Piliouras, Jason Milionis, Kelly Spendlove","submitted_at":"2022-03-26T18:27:40Z","abstract_excerpt":"Under what conditions do the behaviors of players, who play a game repeatedly, converge to a Nash equilibrium? If one assumes that the players' behavior is a discrete-time or continuous-time rule whereby the current mixed strategy profile is mapped to the next, this becomes a problem in the theory of dynamical systems. We apply this theory, and in particular the concepts of chain recurrence, attractors, and Conley index, to prove a general impossibility result: there exist games for which any dynamics is bound to have starting points that do not end up at a Nash equilibrium. We also prove a st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.14129","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/2203.14129/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":"2203.14129","created_at":"2026-07-05T04:08:47.297255+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.14129v1","created_at":"2026-07-05T04:08:47.297255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.14129","created_at":"2026-07-05T04:08:47.297255+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPWNFUW2ZM2D","created_at":"2026-07-05T04:08:47.297255+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPWNFUW2ZM2DHTPS","created_at":"2026-07-05T04:08:47.297255+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPWNFUW2","created_at":"2026-07-05T04:08:47.297255+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05108","citing_title":"Gradient Dynamics in First-Price Auctions: Iterative Strategy Elimination via Cubic Potentials","ref_index":62,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NPWNFUW2ZM2DHTPS3GBDRXE45L","json":"https://pith.science/pith/NPWNFUW2ZM2DHTPS3GBDRXE45L.json","graph_json":"https://pith.science/api/pith-number/NPWNFUW2ZM2DHTPS3GBDRXE45L/graph.json","events_json":"https://pith.science/api/pith-number/NPWNFUW2ZM2DHTPS3GBDRXE45L/events.json","paper":"https://pith.science/paper/NPWNFUW2"},"agent_actions":{"view_html":"https://pith.science/pith/NPWNFUW2ZM2DHTPS3GBDRXE45L","download_json":"https://pith.science/pith/NPWNFUW2ZM2DHTPS3GBDRXE45L.json","view_paper":"https://pith.science/paper/NPWNFUW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.14129&json=true","fetch_graph":"https://pith.science/api/pith-number/NPWNFUW2ZM2DHTPS3GBDRXE45L/graph.json","fetch_events":"https://pith.science/api/pith-number/NPWNFUW2ZM2DHTPS3GBDRXE45L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPWNFUW2ZM2DHTPS3GBDRXE45L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPWNFUW2ZM2DHTPS3GBDRXE45L/action/storage_attestation","attest_author":"https://pith.science/pith/NPWNFUW2ZM2DHTPS3GBDRXE45L/action/author_attestation","sign_citation":"https://pith.science/pith/NPWNFUW2ZM2DHTPS3GBDRXE45L/action/citation_signature","submit_replication":"https://pith.science/pith/NPWNFUW2ZM2DHTPS3GBDRXE45L/action/replication_record"}},"created_at":"2026-07-05T04:08:47.297255+00:00","updated_at":"2026-07-05T04:08:47.297255+00:00"}