{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SX3P6AYMG5LZR45EQPGVDLRJE2","short_pith_number":"pith:SX3P6AYM","schema_version":"1.0","canonical_sha256":"95f6ff030c375798f3a483cd51ae2926923bf0cd710db3c1cdafdf079c97811e","source":{"kind":"arxiv","id":"2606.12149","version":1},"attestation_state":"computed","paper":{"title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Christodoulos Santorinaios, Evangelos Markakis","submitted_at":"2026-06-10T14:39:46Z","abstract_excerpt":"Our work revolves around Fictitious Play, one of the first iterative methods that is known to converge to a Nash equilibrium in zero-sum games. In recent years, there has been a revived interest, due to applications in various machine learning problems, which has motivated a line of work on its convergence properties and on proposing new variants of the initial algorithm. Our paper is along this direction and introduces one new variant, which we refer to as Almost Greedy Fictitious Play. The proposed algorithm greedily attempts to find the optimal stepsize at each iteration but its search spac"},"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":"2606.12149","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-06-10T14:39:46Z","cross_cats_sorted":[],"title_canon_sha256":"dd6999d27ba50b2f6989fde37c80908b76618d1cfecb0b81b59430f85351d847","abstract_canon_sha256":"3668022167daf42cde6ac518fe9c5aba5574fb8b58215fafd8a3c7609431c370"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:51.061420Z","signature_b64":"ugWVQDYJmQ7pp911/KZfaBXBN/ikUQzqV6C9EnRsc7/auYBIcmzVxAISiFbTGrgxOvh2t4EkDfZLviPO6aU0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95f6ff030c375798f3a483cd51ae2926923bf0cd710db3c1cdafdf079c97811e","last_reissued_at":"2026-06-11T01:10:51.060619Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:51.060619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Christodoulos Santorinaios, Evangelos Markakis","submitted_at":"2026-06-10T14:39:46Z","abstract_excerpt":"Our work revolves around Fictitious Play, one of the first iterative methods that is known to converge to a Nash equilibrium in zero-sum games. In recent years, there has been a revived interest, due to applications in various machine learning problems, which has motivated a line of work on its convergence properties and on proposing new variants of the initial algorithm. Our paper is along this direction and introduces one new variant, which we refer to as Almost Greedy Fictitious Play. The proposed algorithm greedily attempts to find the optimal stepsize at each iteration but its search spac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12149","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/2606.12149/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":"2606.12149","created_at":"2026-06-11T01:10:51.060746+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.12149v1","created_at":"2026-06-11T01:10:51.060746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12149","created_at":"2026-06-11T01:10:51.060746+00:00"},{"alias_kind":"pith_short_12","alias_value":"SX3P6AYMG5LZ","created_at":"2026-06-11T01:10:51.060746+00:00"},{"alias_kind":"pith_short_16","alias_value":"SX3P6AYMG5LZR45E","created_at":"2026-06-11T01:10:51.060746+00:00"},{"alias_kind":"pith_short_8","alias_value":"SX3P6AYM","created_at":"2026-06-11T01:10:51.060746+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/SX3P6AYMG5LZR45EQPGVDLRJE2","json":"https://pith.science/pith/SX3P6AYMG5LZR45EQPGVDLRJE2.json","graph_json":"https://pith.science/api/pith-number/SX3P6AYMG5LZR45EQPGVDLRJE2/graph.json","events_json":"https://pith.science/api/pith-number/SX3P6AYMG5LZR45EQPGVDLRJE2/events.json","paper":"https://pith.science/paper/SX3P6AYM"},"agent_actions":{"view_html":"https://pith.science/pith/SX3P6AYMG5LZR45EQPGVDLRJE2","download_json":"https://pith.science/pith/SX3P6AYMG5LZR45EQPGVDLRJE2.json","view_paper":"https://pith.science/paper/SX3P6AYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.12149&json=true","fetch_graph":"https://pith.science/api/pith-number/SX3P6AYMG5LZR45EQPGVDLRJE2/graph.json","fetch_events":"https://pith.science/api/pith-number/SX3P6AYMG5LZR45EQPGVDLRJE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SX3P6AYMG5LZR45EQPGVDLRJE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SX3P6AYMG5LZR45EQPGVDLRJE2/action/storage_attestation","attest_author":"https://pith.science/pith/SX3P6AYMG5LZR45EQPGVDLRJE2/action/author_attestation","sign_citation":"https://pith.science/pith/SX3P6AYMG5LZR45EQPGVDLRJE2/action/citation_signature","submit_replication":"https://pith.science/pith/SX3P6AYMG5LZR45EQPGVDLRJE2/action/replication_record"}},"created_at":"2026-06-11T01:10:51.060746+00:00","updated_at":"2026-06-11T01:10:51.060746+00:00"}