{"as_of":"2026-08-09T17:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3a16b2ee156c31f84da7a821e32acd979d3ba6d4ed5f2b9fb6c920953e6e821b","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T07:50:44.299416Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.12149/citation-record","integrity":"/paper/2606.12149/integrity","json":"/paper/2606.12149/citation-record.json","paper":"/paper/2606.12149"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:50:44.299416Z","title":"Fast convergence of fictitious play for diagonal payoff matrices","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.12149","last_updated":"2026-06-10T14:39:46Z","snapshot_observed_at":"2026-08-08T12:52:39.423749Z","submitted_at":"2026-06-10T14:39:46Z","title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T07:50:44.299416Z"},"links":{"citing_paper":"/paper/2606.12149"},"observation_digest":"sha256:8cf50e31ff6577d494581632ce007759d71889862e1a919419dae53541450cdb","observation_id":"b9952279-d5b6-4c3e-a21f-887ed53584ac","resolution":{"observed_at":"2026-06-27T07:50:44.299416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:50:44.299416Z","title":"Convergence oflog(1/ϵ)for gradient-based algorithms in zero-sum games without the condition number: A smoothed analysis","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12149","last_updated":"2026-06-10T14:39:46Z","snapshot_observed_at":"2026-08-08T12:52:39.423749Z","submitted_at":"2026-06-10T14:39:46Z","title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T07:50:44.299416Z"},"links":{"citing_paper":"/paper/2606.12149"},"observation_digest":"sha256:78c7d2218ac5d9b4e85ae2164b8b96944480f4d2b36e5a76f4a9fd52ab56f986","observation_id":"a231ef36-d34e-4f30-ad26-20633b789816","resolution":{"observed_at":"2026-06-27T07:50:44.299416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.23248","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T13:38:18.551939Z","title":"(doubly) exponential lower bounds for follow the regularized leader in potential games.arXiv preprint arXiv:2601.23248,","venue":null,"work_id":"72bb6cd4-3616-42aa-91f1-7ec38cf7da91","year":null},"citing_paper":{"arxiv_id":"2606.12149","last_updated":"2026-06-10T14:39:46Z","snapshot_observed_at":"2026-08-08T12:52:39.423749Z","submitted_at":"2026-06-10T14:39:46Z","title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T07:50:44.299416Z"},"links":{"citing_paper":"/paper/2606.12149"},"observation_digest":"sha256:9f6dc1de67caedb7784d152c705bce272c21ddf450682d538ffd35d19f7b992f","observation_id":"923b3216-09f2-48f4-9a9a-b94455ac5185","resolution":{"observed_at":"2026-07-03T13:38:18.553623Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:50:44.299416Z","title":"Fictitious play and best-response dynamics in identical interest and zero-sum stochastic games","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.12149","last_updated":"2026-06-10T14:39:46Z","snapshot_observed_at":"2026-08-08T12:52:39.423749Z","submitted_at":"2026-06-10T14:39:46Z","title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T07:50:44.299416Z"},"links":{"citing_paper":"/paper/2606.12149"},"observation_digest":"sha256:a311d88809932c54b606696411f7c3c0c0ac8de5e9899d39d7b51a376dda8729","observation_id":"98732a3b-8fe5-4833-978b-e5edfb4d3891","resolution":{"observed_at":"2026-06-27T07:50:44.299416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:50:44.299416Z","title":"On the convergence of fictitious play: A decomposition approach","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.12149","last_updated":"2026-06-10T14:39:46Z","snapshot_observed_at":"2026-08-08T12:52:39.423749Z","submitted_at":"2026-06-10T14:39:46Z","title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T07:50:44.299416Z"},"links":{"citing_paper":"/paper/2606.12149"},"observation_digest":"sha256:96db3e8a15659758e222449385b1b64e77b20d60b725dd8d240d2de6755e43b3","observation_id":"60c7b2d6-843b-4466-b8de-afbd3182d8b8","resolution":{"observed_at":"2026-06-27T07:50:44.299416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:50:44.299416Z","title":"Anticipatory fictitious play","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.12149","last_updated":"2026-06-10T14:39:46Z","snapshot_observed_at":"2026-08-08T12:52:39.423749Z","submitted_at":"2026-06-10T14:39:46Z","title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T07:50:44.299416Z"},"links":{"citing_paper":"/paper/2606.12149"},"observation_digest":"sha256:892ea16a36559b310af0c087884d14aea161c0844b79d4ef40b8815da6be7607","observation_id":"1e6b10d5-43c9-471f-95ac-9e1e5dc0c2a1","resolution":{"observed_at":"2026-06-27T07:50:44.299416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:50:44.299416Z","title":"A descent-based method on the duality gap for solving zero-sum games","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.12149","last_updated":"2026-06-10T14:39:46Z","snapshot_observed_at":"2026-08-08T12:52:39.423749Z","submitted_at":"2026-06-10T14:39:46Z","title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T07:50:44.299416Z"},"links":{"citing_paper":"/paper/2606.12149"},"observation_digest":"sha256:fdd5304493842b67c85ea7223bb9cc77eefc24cccc3d524d22264e2d11cbddbc","observation_id":"f01a9f28-8632-42c3-a230-3df37f8943e6","resolution":{"observed_at":"2026-06-27T07:50:44.299416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:50:44.299416Z","title":"Frank-wolfe algorithms for saddle point problems","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.12149","last_updated":"2026-06-10T14:39:46Z","snapshot_observed_at":"2026-08-08T12:52:39.423749Z","submitted_at":"2026-06-10T14:39:46Z","title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T07:50:44.299416Z"},"links":{"citing_paper":"/paper/2606.12149"},"observation_digest":"sha256:27e92a04248e85dd9919c3756e766621d18ce36bc6fc2aa98730ca05455c88a6","observation_id":"12f1a1bf-275a-4118-874a-b40df08dafb6","resolution":{"observed_at":"2026-06-27T07:50:44.299416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:50:44.299416Z","title":"Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron C","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.12149","last_updated":"2026-06-10T14:39:46Z","snapshot_observed_at":"2026-08-08T12:52:39.423749Z","submitted_at":"2026-06-10T14:39:46Z","title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T07:50:44.299416Z"},"links":{"citing_paper":"/paper/2606.12149"},"observation_digest":"sha256:86d3e504f8b57e96f1f828f283a26e2a1b164aa08367c9fbd348a8334a04cafb","observation_id":"6214cf18-645a-41f0-a698-2d57e438296c","resolution":{"observed_at":"2026-06-27T07:50:44.299416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:50:44.299416Z","title":"Optimism without regu- larization: Constant regret in zero-sum games","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.12149","last_updated":"2026-06-10T14:39:46Z","snapshot_observed_at":"2026-08-08T12:52:39.423749Z","submitted_at":"2026-06-10T14:39:46Z","title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T07:50:44.299416Z"},"links":{"citing_paper":"/paper/2606.12149"},"observation_digest":"sha256:7351d75325a7c6a26cdf032e2381aa6cf688098eae4425a24e2136fe8064821d","observation_id":"3e9b9c8b-4a20-440d-af9d-6e946907c3e7","resolution":{"observed_at":"2026-06-27T07:50:44.299416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:50:44.299416Z","title":"Fictitious play property for games with identical interests","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.12149","last_updated":"2026-06-10T14:39:46Z","snapshot_observed_at":"2026-08-08T12:52:39.423749Z","submitted_at":"2026-06-10T14:39:46Z","title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T07:50:44.299416Z"},"links":{"citing_paper":"/paper/2606.12149"},"observation_digest":"sha256:9e718c06259633dce2f7abe992bf7c383d92b5020f3bf3570c357cfb7e1445fb","observation_id":"3476b344-203d-4f16-a0f6-8d5296832a86","resolution":{"observed_at":"2026-06-27T07:50:44.299416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3934/jdg.2014.1.621","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"doi: 10.3934/jdg.2014.1.621","venue":"Journal of Dynamics and Games","work_id":"8f05761e-26ad-469c-a23f-cb5bd7283dcb","year":2014},"citing_paper":{"arxiv_id":"2606.12149","last_updated":"2026-06-10T14:39:46Z","snapshot_observed_at":"2026-08-08T12:52:39.423749Z","submitted_at":"2026-06-10T14:39:46Z","title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T07:50:44.299416Z"},"links":{"citing_paper":"/paper/2606.12149"},"observation_digest":"sha256:69cd86c79e3e4ebf5a3ab224b24f7c52590aa32914cd4f8573015e87082aca71","observation_id":"1bcbb45e-d6d1-453f-a932-25067ab6d31b","resolution":{"observed_at":"2026-06-28T11:12:01.669324Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:50:44.299416Z","title":"Fictitious play in zero-sum stochastic games.SIAM Journal on Control and Optimization, 60(4):2095–2114,","venue":null,"work_id":null,"year":2095},"citing_paper":{"arxiv_id":"2606.12149","last_updated":"2026-06-10T14:39:46Z","snapshot_observed_at":"2026-08-08T12:52:39.423749Z","submitted_at":"2026-06-10T14:39:46Z","title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T07:50:44.299416Z"},"links":{"citing_paper":"/paper/2606.12149"},"observation_digest":"sha256:6f82bbb4a600a4523051e1a495b9bf98418cc433729fc9f4a89daf23b123ebda","observation_id":"4e0d4456-83d6-4013-83e6-7cdbd72f7683","resolution":{"observed_at":"2026-06-27T07:50:44.299416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.09902","last_updated":"2025-07-14T04:15:17Z","snapshot_observed_at":"2026-08-09T15:23:18.922858Z","submitted_at":"2025-07-14T04:15:17Z","title":"Tie-breaking Agnostic Lower Bound for Fictitious Play","version":1},"cited_work":{"arxiv_id":"2507.09902","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.09902","snapshot_observed_at":"2026-07-03T13:38:18.552642Z","title":"https: //arxiv.org/abs/2507.09902 20","venue":null,"work_id":"04f2273e-47c4-4abc-bf5b-a1551e42b189","year":2025},"citing_paper":{"arxiv_id":"2606.12149","last_updated":"2026-06-10T14:39:46Z","snapshot_observed_at":"2026-08-08T12:52:39.423749Z","submitted_at":"2026-06-10T14:39:46Z","title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T07:50:44.299416Z"},"links":{"cited_paper":"/paper/2507.09902","citing_paper":"/paper/2606.12149"},"observation_digest":"sha256:5b595b4fb34c6a99f48554b1f8021609225d771954135c99c65e27414e0073f2","observation_id":"84a8c50d-f9ac-4dd0-b9c0-df51389ed512","resolution":{"observed_at":"2026-07-03T13:38:18.554270Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:50:44.299416Z","title":"Linear last-iterate conver- gence in constrained saddle-point optimization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.12149","last_updated":"2026-06-10T14:39:46Z","snapshot_observed_at":"2026-08-08T12:52:39.423749Z","submitted_at":"2026-06-10T14:39:46Z","title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T07:50:44.299416Z"},"links":{"citing_paper":"/paper/2606.12149"},"observation_digest":"sha256:138528c6f8a93b6d69f65de4a2f21273fc4575a4602d6cb049930ec09d180881","observation_id":"6261206b-042f-40be-add0-aa328ce52e82","resolution":{"observed_at":"2026-06-27T07:50:44.299416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.00583","last_updated":"2025-08-13T17:31:43Z","snapshot_observed_at":"2026-08-07T03:34:27.861455Z","submitted_at":"2020-11-01T18:24:40Z","title":"Game-Theoretic Multiagent Reinforcement Learning","version":5},"cited_work":{"arxiv_id":"2011.00583","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.00583","snapshot_observed_at":"2026-07-04T09:29:44.152952Z","title":"arXiv preprint arXiv:2011.00583 , year=","venue":null,"work_id":"33a12617-fa67-4a9a-acdf-7907f223631e","year":2020},"citing_paper":{"arxiv_id":"2606.12149","last_updated":"2026-06-10T14:39:46Z","snapshot_observed_at":"2026-08-08T12:52:39.423749Z","submitted_at":"2026-06-10T14:39:46Z","title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T07:50:44.299416Z"},"links":{"cited_paper":"/paper/2011.00583","citing_paper":"/paper/2606.12149"},"observation_digest":"sha256:05a0b580bf72c230d96f367d52943ba9fa076364623bda6d0cbf6309fcfbdfdd","observation_id":"7ffc8502-34fb-41ae-a8eb-af540dc75423","resolution":{"observed_at":"2026-07-03T13:38:18.551458Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:50:44.299416Z","title":"Mean field multi-agent reinforcement learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.12149","last_updated":"2026-06-10T14:39:46Z","snapshot_observed_at":"2026-08-08T12:52:39.423749Z","submitted_at":"2026-06-10T14:39:46Z","title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T07:50:44.299416Z"},"links":{"citing_paper":"/paper/2606.12149"},"observation_digest":"sha256:2817b19b9976aa03cea598b813e3c52c98b289ebf084a88372d6bc7e1ba7d460","observation_id":"dd7baec3-c0ac-4f79-8bc9-939dd6601754","resolution":{"observed_at":"2026-06-27T07:50:44.299416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.12149","last_updated":"2026-06-10T14:39:46Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-08T12:52:39.423749Z","submitted_at":"2026-06-10T14:39:46Z","title":"Do Not Discretize, Optimize: Almost Greedy Fictitious Play"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":13,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":17},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2606.12149."}