{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EZ5LOMBIIYWEPHN24RJSLOQEYB","short_pith_number":"pith:EZ5LOMBI","schema_version":"1.0","canonical_sha256":"267ab73028462c479dbae45325ba04c05130486b617144f4087f71428ed56843","source":{"kind":"arxiv","id":"2507.09902","version":1},"attestation_state":"computed","paper":{"title":"Tie-breaking Agnostic Lower Bound for Fictitious Play","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Yuanhao Wang","submitted_at":"2025-07-14T04:15:17Z","abstract_excerpt":"Fictitious play (FP) is a natural learning dynamic in two-player zero-sum games. Samuel Karlin conjectured in 1959 that FP converges at a rate of $O(t^{-1/2})$ to Nash equilibrium, where $t$ is the number of steps played. However, Daskalakis and Pan disproved the stronger form of this conjecture in 2014, where \\emph{adversarial} tie-breaking is allowed.\n  This paper disproves Karlin's conjecture in its weaker form. In particular, there exists a 10-by-10 zero-sum matrix game, in which FP converges at a rate of $\\Omega(t^{-1/3})$, and no ties occur except for the first step."},"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":"2507.09902","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-07-14T04:15:17Z","cross_cats_sorted":[],"title_canon_sha256":"881646462fe65e16417ba3cb3d76ba118df3cc2c2b6cbee5212012b428f8b087","abstract_canon_sha256":"ff1f3b265fc1bb6cbf233790122d76d35f03b6f06f19f6ec4ce54a6e09e653ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:41.926803Z","signature_b64":"Jvu2T5HvxThthflQqLeTYtAtwpK2zKKRQmN0sWXPUHl6jvdOyemMgz5JrMbPdpw0dd9jvufeuF/h2qmzS8PIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"267ab73028462c479dbae45325ba04c05130486b617144f4087f71428ed56843","last_reissued_at":"2026-07-05T11:36:41.926291Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:41.926291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tie-breaking Agnostic Lower Bound for Fictitious Play","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Yuanhao Wang","submitted_at":"2025-07-14T04:15:17Z","abstract_excerpt":"Fictitious play (FP) is a natural learning dynamic in two-player zero-sum games. Samuel Karlin conjectured in 1959 that FP converges at a rate of $O(t^{-1/2})$ to Nash equilibrium, where $t$ is the number of steps played. However, Daskalakis and Pan disproved the stronger form of this conjecture in 2014, where \\emph{adversarial} tie-breaking is allowed.\n  This paper disproves Karlin's conjecture in its weaker form. In particular, there exists a 10-by-10 zero-sum matrix game, in which FP converges at a rate of $\\Omega(t^{-1/3})$, and no ties occur except for the first step."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09902","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/2507.09902/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":"2507.09902","created_at":"2026-07-05T11:36:41.926363+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.09902v1","created_at":"2026-07-05T11:36:41.926363+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09902","created_at":"2026-07-05T11:36:41.926363+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZ5LOMBIIYWE","created_at":"2026-07-05T11:36:41.926363+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZ5LOMBIIYWEPHN2","created_at":"2026-07-05T11:36:41.926363+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZ5LOMBI","created_at":"2026-07-05T11:36:41.926363+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12149","citing_title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2603.12104","citing_title":"Convergence of the Frank-Wolfe Algorithm for Monotone Variational Inequalities","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EZ5LOMBIIYWEPHN24RJSLOQEYB","json":"https://pith.science/pith/EZ5LOMBIIYWEPHN24RJSLOQEYB.json","graph_json":"https://pith.science/api/pith-number/EZ5LOMBIIYWEPHN24RJSLOQEYB/graph.json","events_json":"https://pith.science/api/pith-number/EZ5LOMBIIYWEPHN24RJSLOQEYB/events.json","paper":"https://pith.science/paper/EZ5LOMBI"},"agent_actions":{"view_html":"https://pith.science/pith/EZ5LOMBIIYWEPHN24RJSLOQEYB","download_json":"https://pith.science/pith/EZ5LOMBIIYWEPHN24RJSLOQEYB.json","view_paper":"https://pith.science/paper/EZ5LOMBI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.09902&json=true","fetch_graph":"https://pith.science/api/pith-number/EZ5LOMBIIYWEPHN24RJSLOQEYB/graph.json","fetch_events":"https://pith.science/api/pith-number/EZ5LOMBIIYWEPHN24RJSLOQEYB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZ5LOMBIIYWEPHN24RJSLOQEYB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZ5LOMBIIYWEPHN24RJSLOQEYB/action/storage_attestation","attest_author":"https://pith.science/pith/EZ5LOMBIIYWEPHN24RJSLOQEYB/action/author_attestation","sign_citation":"https://pith.science/pith/EZ5LOMBIIYWEPHN24RJSLOQEYB/action/citation_signature","submit_replication":"https://pith.science/pith/EZ5LOMBIIYWEPHN24RJSLOQEYB/action/replication_record"}},"created_at":"2026-07-05T11:36:41.926363+00:00","updated_at":"2026-07-05T11:36:41.926363+00:00"}