{"as_of":"2026-08-23T17:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6588c5faa6d38abc06400a1391a881844d2e7f5b234fbaebb44787a3d677b8bb","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T00:55:52.086804Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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/2412.19216/citation-record","integrity":"/paper/2412.19216/integrity","json":"/paper/2412.19216/citation-record.json","paper":"/paper/2412.19216"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.622008Z","title":"Equilibrium points in n-person games","venue":null,"work_id":"15084738-976d-4ea2-a858-df40af742fb7","year":1950},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.835824Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:3356e0b40bc0feea08ab779ed0f26f7c63f2c45b6651c3096fc5f0d578dfdfa4","observation_id":"d9b154bf-94f8-436d-b7a9-e1bc422da814","resolution":{"observed_at":"2026-08-11T00:55:52.626184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.609843Z","title":"Iterative solution of games by fictitious play","venue":null,"work_id":"7e38d585-c390-460e-bca4-f6515239595e","year":1951},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.844732Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:7480fcb05268326a0363f138c155571c12d914032d95f83276d1dc17b11421eb","observation_id":"445d593f-2947-4db4-8f5b-854c905fefe3","resolution":{"observed_at":"2026-08-11T00:55:52.614141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.596485Z","title":"The Theory of Learning in Games","venue":null,"work_id":"c9bc3140-31ff-480f-afce-daed91152cef","year":1998},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.859282Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:f040e1c6a40c44de93b131d591b5235c7b2d3b2fcbc3c80bd67fc702ac8af27f","observation_id":"77db83de-4215-408c-beba-90c317b9814c","resolution":{"observed_at":"2026-08-11T00:55:52.600832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.585324Z","title":"On the convergence of fictitious play","venue":null,"work_id":"7a9522b8-0e09-4e98-9ff1-12142161dd5e","year":1998},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.864740Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:e679678c00aabc2d32542c596d02b4ae3aba5dc0097ba0e8cc4a6ad2eca2ceec","observation_id":"9f413d38-7e2e-44a5-b26b-5c749a1a86a2","resolution":{"observed_at":"2026-08-11T00:55:52.589485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.569096Z","title":"Fictitious self-play in extensive-form games","venue":null,"work_id":"07729ca3-84b4-4e92-a061-0bbf55a9a360","year":2015},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.882592Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:376d01247a33012ebf76282586afe8575fe990766564ee96e182ef503043d775","observation_id":"c3ba9147-866d-423f-b669-5af6dc50e89b","resolution":{"observed_at":"2026-08-11T00:55:52.573600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1603.01121","last_updated":"2016-06-28T15:28:30Z","snapshot_observed_at":"2026-08-15T01:19:24.898044Z","submitted_at":"2016-03-03T15:01:54Z","title":"Deep Reinforcement Learning from Self-Play in Imperfect-Information Games","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1603.01121","snapshot_observed_at":"2026-08-11T00:55:51.888819Z","title":"Deep reinforcement learning from self-play in imperfect-information games","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.888819Z"},"links":{"cited_paper":"/paper/1603.01121","citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:cbb3654b87ff9220292f458b8311d486d2b82871948d20b0ad07676b8bff3508","observation_id":"a7c13ce5-cede-4d71-b3d1-e5458dd4c860","resolution":{"observed_at":"2026-08-11T00:55:51.888819Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.554943Z","title":"Fictitious play in zero-sum stochastic games","venue":null,"work_id":"2bdce078-fbf7-4522-b967-435b8a64be5e","year":2022},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.896618Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:3d91b1abc082f05590ad4a9688c502e1fca1994e384db7eb0ab41b949bb69d0d","observation_id":"1626e20b-5a59-4f9b-b3c0-8bf4dfdf24e7","resolution":{"observed_at":"2026-08-11T00:55:52.559785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.539334Z","title":"Fictitious play in markov games with single controller","venue":null,"work_id":"f893089a-8de8-4e1f-8b36-d9f3b0cc451e","year":2022},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.908568Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:7bf7f76058384bf45975821d48c0ca2ca04b1c09267267c5ee9f681d800bb23b","observation_id":"e3706c74-e47c-4a5d-941c-5f385d1d6a95","resolution":{"observed_at":"2026-08-11T00:55:52.544326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.520097Z","title":"An iterative method of solving a game","venue":null,"work_id":"b07e4aa7-6b1e-4ffc-b0ea-2096cfe019ca","year":1951},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.918198Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:92a5551cc4b304d8129389eee8499d7aaf8453c6a7ebc739fe130b5fd1c4f9d6","observation_id":"3335b243-19f3-4966-b8de-338de0286e5d","resolution":{"observed_at":"2026-08-11T00:55:52.527093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.507117Z","title":"On the convergence of learning processes in a 2x2 non-zero-person game","venue":null,"work_id":"fc2a7aa6-3444-4d3d-a8ff-cde657bafd3c","year":1961},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.929928Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:a0fbdaf4756db81af999a10f2e03ef55f30569f41eb6327fb3147eb0334aa986","observation_id":"cdf265dc-0c5c-43cf-a708-5e614826897b","resolution":{"observed_at":"2026-08-11T00:55:52.511490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.492008Z","title":"Fictitious play property for games with identical interests","venue":null,"work_id":"1286e22c-9c35-4c9a-a3f9-5b845d4d00dd","year":1996},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.934263Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:5538261ee86c74394e312ec2ec007abc88aba6231560b3d6e6645146e34dbcd1","observation_id":"9ff7a215-248f-4402-ad4d-2bf980262d80","resolution":{"observed_at":"2026-08-11T00:55:52.497201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.479439Z","title":"Fictitious play in 2×n games","venue":null,"work_id":"f5bcbee8-0efa-40b0-a503-a512f0f0cce4","year":2005},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.945529Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:ab1dcebe076e214c723387f681c23e73b7c5245583e2e734e0cffa67aee88746","observation_id":"dc6a1996-6eb8-483a-9a42-f304b085a51c","resolution":{"observed_at":"2026-08-11T00:55:52.483861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.467439Z","title":"evolutionary","venue":null,"work_id":"a2870585-6481-4358-8a9f-4bb601f25c07","year":1990},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.949886Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:65cfef5c22d0ab217bbc1235badf9836c2989ac7dd20e70ae2b2b26102ba16a0","observation_id":"20fe2f5f-66aa-488c-a35c-c27383ea5cce","resolution":{"observed_at":"2026-08-11T00:55:52.471701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.445668Z","title":"Two more classes of games with the continuous-time fictitious play property.Games and Economic Behavior, 60(2):247–261, 2007","venue":null,"work_id":"b3015dce-6e01-4f23-be50-91c2c57179f4","year":2007},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.954110Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:737956513204be189fccb0f585c55e509ef5c8dffe08db1290611273f2faab31","observation_id":"e1421f3b-3a44-4826-a843-dd50f7e9103a","resolution":{"observed_at":"2026-08-11T00:55:52.459001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.431907Z","title":"Some topics in two-person games","venue":null,"work_id":"1fcc568b-e0bb-4042-a0d0-e23cb72ca6f3","year":1964},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.958150Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:26434e1fdc08b1b3c22c5ca216fffcf3a19eae89da4d106dd42307c0264b1333","observation_id":"1b7f7985-4e46-4715-943f-6f4c4cda1feb","resolution":{"observed_at":"2026-08-11T00:55:52.436306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.417028Z","title":"Shapley Polygons in 4 x 4 Games","venue":null,"work_id":"620f1eca-26be-416f-bc5a-76cb4e4650a0","year":2010},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.961781Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:d04a2f2ab81eae7d31742cd630ad65cdfd576649f99e0cd7941ac367a27769bc","observation_id":"9fc16b7c-4fb2-4db4-a791-67b9410207ef","resolution":{"observed_at":"2026-08-11T00:55:52.421265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.404145Z","title":"Three problems in learning mixed-strategy nash equilibria","venue":null,"work_id":"edcee3c4-0248-4aa8-958b-974fa03a3348","year":1993},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.966431Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:bf8ec8207e28555eee925bf47f32c05b12321329ca35e664146955e39c4479d8","observation_id":"9d69841e-3eda-4e17-a7f8-eea5408e0a10","resolution":{"observed_at":"2026-08-11T00:55:52.409225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.383584Z","title":"Fictitious play in 3×3 games: The transition between periodic and chaotic behaviour","venue":null,"work_id":"56a0147d-232e-4f52-a6bf-945c6bd478c6","year":2008},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.970032Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:677484c07b904dc9570f25c2902c29744be7da63edb6ab55aacdba24b6db7496","observation_id":"c781f00d-32f1-45ee-959b-0d92f59ec672","resolution":{"observed_at":"2026-08-11T00:55:52.389942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.362128Z","title":"Fictitious play in 3×3 games: Chaos and dithering behaviour","venue":null,"work_id":"21f3147f-ff06-45e6-aa3b-b035640dfb92","year":2011},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.975098Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:f8deed5e724cd468651f38de191bf8ba3bab39427c10d43839d544deb6d89970","observation_id":"df5eb44f-729f-401a-acab-1b254cc5b7a1","resolution":{"observed_at":"2026-08-11T00:55:52.366739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.348845Z","title":"Cycles in adversarial regularized learning","venue":null,"work_id":"820f14c1-80da-475b-8e3d-d57a7b7841ab","year":2018},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.980946Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:7ec388af8a341ac005d551abf4e6da525b86ab8021ab3f822981afc601aec418","observation_id":"4e4dac54-6034-4b4e-84b7-3025d932e0bf","resolution":{"observed_at":"2026-08-11T00:55:52.353653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.334883Z","title":"On the impossibility of convergence of mixed strategies with optimal no-regret learning","venue":null,"work_id":"827b2960-c5dd-46bd-a1a6-7d2dc7e9a0bc","year":2024},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:51.985427Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:c946c37abcf4132f22a61b108ee8fd17303d7356e6fa242fad27f38dea35624d","observation_id":"529803f8-14fb-4317-8ea4-b569b5d4e87f","resolution":{"observed_at":"2026-08-11T00:55:52.340234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.320583Z","title":"Andrade, Rafael Frongillo, and Georgios Piliouras","venue":null,"work_id":"a7949080-d6a4-452d-a42a-cbea78cece3a","year":2021},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:52.004763Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:1ee0e8cc2b287c6a395cc664edd81f6a25b52cda0043c1e6c461bf99b708250b","observation_id":"766262fd-1edd-46a2-927a-e5353c910f7f","resolution":{"observed_at":"2026-08-11T00:55:52.324429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.306975Z","title":"An impossibility theorem in game dynamics","venue":null,"work_id":"659c859c-9d4f-4c81-8205-6534c837ec3d","year":2023},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:52.024749Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:665747ec57869341b99a10240db8893995493e39ec9b2f9c47ba4989e53f1232","observation_id":"f1faec7c-a7b8-4e8a-a651-7f6fa2f75a05","resolution":{"observed_at":"2026-08-11T00:55:52.312157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.292188Z","title":"On the convergence of fictitious play: A decompo- sition approach","venue":null,"work_id":"5cbe9685-3e8f-43d5-91f4-5dd0e06e35e3","year":2022},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:52.029060Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:db1cdb884316f845987ff0543feea1948dddbfcca5583e81375bcc7cbfe598ad","observation_id":"42dd526e-3391-45b2-b7e1-03e3b273f9d1","resolution":{"observed_at":"2026-08-11T00:55:52.298284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.252677Z","title":"Fictitious play in 2 × 2 games: a geometric proof of convergence","venue":null,"work_id":"2acc0c82-eff0-40d4-b767-d9fdad23d927","year":1994},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:52.032890Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:232ad40b29ba85daeeb7adcfe6048dd696728b5a24475ce8018c001291bac8ca","observation_id":"93544066-941d-46e0-9566-557f2a590893","resolution":{"observed_at":"2026-08-11T00:55:52.264752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.238128Z","title":"Hamiltonian flows with random-walk behaviour originating from zero-sum games and fictitious play","venue":null,"work_id":"25a9731f-ad03-4bae-93a1-2f994c10a5b5","year":2011},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:52.045492Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:bf4090d4718600e16f3a468a7b0ca8115ad2020101d37bd823aa44d88fb07c33","observation_id":"dcdb5391-d6e9-4f5c-937b-0bf9a97f6daa","resolution":{"observed_at":"2026-08-11T00:55:52.242626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.223674Z","title":"Non-algebraic convergence proofs for continuous-time fictitious play","venue":null,"work_id":"1734e11a-d1cb-4d61-bcb4-069bfb1f11e4","year":2012},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:52.049376Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:91165c5ed1846dec69265471d06f866d9637f608bfbc4c206de49120da5de8db","observation_id":"6692f7cd-a47f-47c9-8028-4ff7d362b644","resolution":{"observed_at":"2026-08-11T00:55:52.228837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.207305Z","title":"Periodic orbits in piecewise riccati vector fields","venue":null,"work_id":"a8c2b82d-4bfc-49a3-81f1-1c2fc9d7c70c","year":2023},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:52.053245Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:010e076901cc56620759166bcca7df5901af4397c7b1c1d327d1b915cbad9248","observation_id":"7cd3a86d-4fd0-4ea5-8ea7-bb62fd91ba05","resolution":{"observed_at":"2026-08-11T00:55:52.214641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.193201Z","title":"Game Theory, Alive","venue":null,"work_id":"bce008ed-465c-4735-a4af-39a2eb6bcb7a","year":2017},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:52.058552Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:dec689dd84b0b2ae0e324ed755eea65bec24ccdfd8625a79def1d0a60f5b1fa1","observation_id":"12536eb5-b794-4424-be8a-a13981c48494","resolution":{"observed_at":"2026-08-11T00:55:52.198452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.178877Z","title":"Game Theory and Mechanism Design","venue":null,"work_id":"183890f8-7876-430b-b59e-ab897501f9f9","year":2014},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:52.065104Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:97ebf0c61bb9dba6dcb7196d5ca45ef47ad09f68e3ad247d9bbfd0a57981a95d","observation_id":"0710924d-9dbb-471f-af7f-a9868602e6f8","resolution":{"observed_at":"2026-08-11T00:55:52.183041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.166250Z","title":"Computing equilibria of n-person games","venue":null,"work_id":"92cff242-5a52-4ae1-a2ef-e4466c4adecd","year":1971},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:52.074805Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:c12dd195f0497532077527a591df1ed7266c01144a92db13d4b7422f087687a2","observation_id":"19a170d9-95d6-4f1d-be3a-497638f06c37","resolution":{"observed_at":"2026-08-11T00:55:52.170911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.151414Z","title":null,"venue":null,"work_id":"40ce3038-577a-4034-87dd-d74d52b0534c","year":1973},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:52.080773Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:05de6e26e006eb82ee23179c8d0d378a9c52f8b9c3b10134e408fd09d0bb6d7d","observation_id":"04724fec-9b92-4738-8e1b-5dd731472f70","resolution":{"observed_at":"2026-08-11T00:55:52.155689Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:55:52.136556Z","title":"Payoff performance of fictitious play","venue":null,"work_id":"ad8fd59a-f89c-4831-8777-ef2e2ac75e7f","year":2014},"citing_paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T00:55:52.086804Z"},"links":{"citing_paper":"/paper/2412.19216"},"observation_digest":"sha256:b0875a48e77cd4be830b54d6b5f79794ee4874187054c2f6707344dcd2237b31","observation_id":"a27f68ca-35b7-457f-82fe-dece75c8eb62","resolution":{"observed_at":"2026-08-11T00:55:52.142671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.19216","last_updated":"2024-12-30T02:24:19Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T03:48:34.927203Z","submitted_at":"2024-12-26T13:42:58Z","title":"On the convergence of fictitious play algorithm in repeated games via the geometrical approach"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":31},"total_outbound_references":33},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2412.19216."}