{"as_of":"2026-08-15T12:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a4b2431a52a11436ffcc8d7a5d3c1654fbad711e17f0a2cdf889e2dcad164053","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:56:44.062596Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T07:50:44.299416Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T13:38:18.552642Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.09902","last_updated":"2025-07-14T04:15:17Z","snapshot_observed_at":"2026-08-13T01:05:00.353772Z","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":"2603.12104","last_updated":"2026-04-09T17:21:53Z","snapshot_observed_at":"2026-07-06T22:48:53.198077Z","submitted_at":"2026-03-12T16:08:50Z","title":"Convergence of the Frank-Wolfe Algorithm for Monotone Variational Inequalities","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-15T11:57:20.483259Z"},"links":{"cited_paper":"/paper/2507.09902","citing_paper":"/paper/2603.12104"},"observation_digest":"sha256:0295807e04cc13a769853eaf7830a6359eb1b3de4d321465693689a1eb9380ea","observation_id":"4755b039-0107-43cb-a5de-e225b7242dbd","resolution":{"observed_at":"2026-05-15T11:59:59.422980Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.09902","last_updated":"2025-07-14T04:15:17Z","snapshot_observed_at":"2026-08-13T01:05:00.353772Z","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-10T18:44:33.988354Z","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:d35dee2518ced837d74793c1516b7ded597655f4c56ea22dbeed967d356b0ad3","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.09902/citation-record","integrity":"/paper/2507.09902/integrity","json":"/paper/2507.09902/citation-record.json","paper":"/paper/2507.09902"},"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-06T17:56:44.342114Z","title":"Fast convergence of fictitious play for diagonal payoff matrices","venue":null,"work_id":"00fa8895-98c2-4cc8-a739-4f42bd11643f","year":2021},"citing_paper":{"arxiv_id":"2507.09902","last_updated":"2025-07-14T04:15:17Z","snapshot_observed_at":"2026-08-13T01:05:00.353772Z","submitted_at":"2025-07-14T04:15:17Z","title":"Tie-breaking Agnostic Lower Bound for Fictitious Play","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T17:56:43.788334Z"},"links":{"citing_paper":"/paper/2507.09902"},"observation_digest":"sha256:b5646b1a3bd1cf6bdbcc30ef4e1315c6e006b31593a9c7010868a13240781872","observation_id":"8548f646-e47f-4743-889e-0905b5c8fd5d","resolution":{"observed_at":"2026-08-06T17:56:44.346324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T17:56:44.332065Z","title":"Fictitious play in 2 n games","venue":null,"work_id":"7065925f-52a1-4dee-90a7-5771a22e4269","year":2005},"citing_paper":{"arxiv_id":"2507.09902","last_updated":"2025-07-14T04:15:17Z","snapshot_observed_at":"2026-08-13T01:05:00.353772Z","submitted_at":"2025-07-14T04:15:17Z","title":"Tie-breaking Agnostic Lower Bound for Fictitious Play","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T17:56:43.817335Z"},"links":{"citing_paper":"/paper/2507.09902"},"observation_digest":"sha256:d781aef1a42ea04b24636b17ebfbdc1e952690f4eedff5bc5639993a88c78791","observation_id":"ab41f394-dbf9-426e-9705-b5496f75fafa","resolution":{"observed_at":"2026-08-06T17:56:44.335494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T17:56:44.320658Z","title":"Iterative solution of games by fictitious play","venue":null,"work_id":"657bfa23-8cff-4ec0-a754-b11cd14d4d7d","year":1951},"citing_paper":{"arxiv_id":"2507.09902","last_updated":"2025-07-14T04:15:17Z","snapshot_observed_at":"2026-08-13T01:05:00.353772Z","submitted_at":"2025-07-14T04:15:17Z","title":"Tie-breaking Agnostic Lower Bound for Fictitious Play","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T17:56:43.845413Z"},"links":{"citing_paper":"/paper/2507.09902"},"observation_digest":"sha256:74f2b36c7ea8a5ee4762dc32ed07267c32d12e42adb9dc54d39bbae59206abbd","observation_id":"790f0bdc-7210-4135-a956-18e510907d1a","resolution":{"observed_at":"2026-08-06T17:56:44.324248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T17:56:44.307776Z","title":"A counter-example to karlin's strong conjecture for fictitious play","venue":null,"work_id":"09cfdcb4-a4b2-48db-bc76-66f474fe50c2","year":2014},"citing_paper":{"arxiv_id":"2507.09902","last_updated":"2025-07-14T04:15:17Z","snapshot_observed_at":"2026-08-13T01:05:00.353772Z","submitted_at":"2025-07-14T04:15:17Z","title":"Tie-breaking Agnostic Lower Bound for Fictitious Play","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T17:56:43.860583Z"},"links":{"citing_paper":"/paper/2507.09902"},"observation_digest":"sha256:875258ebe18578af8f97a9550642b0166424383e8c10251498942a5319a997c8","observation_id":"5bb8fc77-f966-4b7d-8af7-be7519989608","resolution":{"observed_at":"2026-08-06T17:56:44.312580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T17:56:44.295539Z","title":"Fictitious play, shapley polygons, and the replicator equation","venue":null,"work_id":"19caea71-ad19-4289-b1a7-4d82610ce883","year":1995},"citing_paper":{"arxiv_id":"2507.09902","last_updated":"2025-07-14T04:15:17Z","snapshot_observed_at":"2026-08-13T01:05:00.353772Z","submitted_at":"2025-07-14T04:15:17Z","title":"Tie-breaking Agnostic Lower Bound for Fictitious Play","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T17:56:43.895809Z"},"links":{"citing_paper":"/paper/2507.09902"},"observation_digest":"sha256:25f3f09a935213e2e88a54d90d549b15d251fa7746f69588bbfc9f9206b7eb59","observation_id":"bac4d58c-2b62-41fa-aca7-0eb34963f0b2","resolution":{"observed_at":"2026-08-06T17:56:44.300504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T17:56:44.284626Z","title":"Frank-wolfe algorithms for saddle point problems","venue":null,"work_id":"a3cfe7e5-cda8-4b28-8915-e228714dd37f","year":2017},"citing_paper":{"arxiv_id":"2507.09902","last_updated":"2025-07-14T04:15:17Z","snapshot_observed_at":"2026-08-13T01:05:00.353772Z","submitted_at":"2025-07-14T04:15:17Z","title":"Tie-breaking Agnostic Lower Bound for Fictitious Play","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T17:56:43.931976Z"},"links":{"citing_paper":"/paper/2507.09902"},"observation_digest":"sha256:3652f351855400aa08e4470f010c85d642d295e521b857469f924154ce561167","observation_id":"58c13477-93e2-40b3-9212-cb8ee220af3e","resolution":{"observed_at":"2026-08-06T17:56:44.288187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T17:56:44.272932Z","title":"On the rate of convergence of continuous-time fictitious play","venue":null,"work_id":"f2ef2683-0233-404e-b50c-8d930c7c4d3d","year":1998},"citing_paper":{"arxiv_id":"2507.09902","last_updated":"2025-07-14T04:15:17Z","snapshot_observed_at":"2026-08-13T01:05:00.353772Z","submitted_at":"2025-07-14T04:15:17Z","title":"Tie-breaking Agnostic Lower Bound for Fictitious Play","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T17:56:43.967629Z"},"links":{"citing_paper":"/paper/2507.09902"},"observation_digest":"sha256:f462ce00ae8c73027d49c907d529aecc84fd1f2fade3b764e762d232b1de6bc2","observation_id":"e653be81-0a49-4561-bae0-f10b826264ec","resolution":{"observed_at":"2026-08-06T17:56:44.276821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T17:56:44.003276Z","title":"Deep reinforcement learning from self-play in imperfect-information games","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.09902","last_updated":"2025-07-14T04:15:17Z","snapshot_observed_at":"2026-08-13T01:05:00.353772Z","submitted_at":"2025-07-14T04:15:17Z","title":"Tie-breaking Agnostic Lower Bound for Fictitious Play","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T17:56:44.003276Z"},"links":{"cited_paper":"/paper/1603.01121","citing_paper":"/paper/2507.09902"},"observation_digest":"sha256:0fa6ca47f402d170abfa0a3f5643e1ad2dad69333c4c18d56a06f78ce81f32a9","observation_id":"ef902a15-0f92-492b-a3fe-3ed5771f3bf5","resolution":{"observed_at":"2026-08-06T17:56:44.003276Z","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-06T17:56:44.261877Z","title":"Fictitious self-play in extensive-form games","venue":null,"work_id":"001de3c2-917a-456f-a5d0-23920c35528a","year":2015},"citing_paper":{"arxiv_id":"2507.09902","last_updated":"2025-07-14T04:15:17Z","snapshot_observed_at":"2026-08-13T01:05:00.353772Z","submitted_at":"2025-07-14T04:15:17Z","title":"Tie-breaking Agnostic Lower Bound for Fictitious Play","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T17:56:44.037519Z"},"links":{"citing_paper":"/paper/2507.09902"},"observation_digest":"sha256:c10b9b3896d1443e080bfce5abce32725b79f5861918d7e86ba1ae3147b2b80f","observation_id":"226fcc96-4477-45f4-9349-87b0b3a7d61c","resolution":{"observed_at":"2026-08-06T17:56:44.265861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T17:56:44.250138Z","title":"Mathematical Methods and Theory in Games, Programming, and Economics: Matrix Games, Programming, and Economics","venue":null,"work_id":"f53549bd-2bf5-4f59-9a9c-e365332d8b8f","year":1959},"citing_paper":{"arxiv_id":"2507.09902","last_updated":"2025-07-14T04:15:17Z","snapshot_observed_at":"2026-08-13T01:05:00.353772Z","submitted_at":"2025-07-14T04:15:17Z","title":"Tie-breaking Agnostic Lower Bound for Fictitious Play","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T17:56:44.049403Z"},"links":{"citing_paper":"/paper/2507.09902"},"observation_digest":"sha256:23e987821303a734babbdc880aedc84f7da6b8379d2f55a85d9607c6021609db","observation_id":"08668182-d47d-40b7-b5ee-7df9b486f6aa","resolution":{"observed_at":"2026-08-06T17:56:44.254306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T17:56:44.239177Z","title":"An iterative method of solving a game","venue":null,"work_id":"9c4443c2-0134-4e75-812c-5bcb09b3917b","year":1951},"citing_paper":{"arxiv_id":"2507.09902","last_updated":"2025-07-14T04:15:17Z","snapshot_observed_at":"2026-08-13T01:05:00.353772Z","submitted_at":"2025-07-14T04:15:17Z","title":"Tie-breaking Agnostic Lower Bound for Fictitious Play","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T17:56:44.053490Z"},"links":{"citing_paper":"/paper/2507.09902"},"observation_digest":"sha256:d939161d7d8f9761c5b3ffc7ba25962046f396d51c79185ccd6bf564bf6f1c69","observation_id":"46670fb2-2262-4caf-83f3-7cb2fe8ee75d","resolution":{"observed_at":"2026-08-06T17:56:44.242769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T17:56:44.226356Z","title":"Note on a computation method in the theory of games","venue":null,"work_id":"b9a19fca-aef5-4a40-b4d5-6eaa5d3b379c","year":1958},"citing_paper":{"arxiv_id":"2507.09902","last_updated":"2025-07-14T04:15:17Z","snapshot_observed_at":"2026-08-13T01:05:00.353772Z","submitted_at":"2025-07-14T04:15:17Z","title":"Tie-breaking Agnostic Lower Bound for Fictitious Play","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T17:56:44.057008Z"},"links":{"citing_paper":"/paper/2507.09902"},"observation_digest":"sha256:6fb656f2e90388d943c252855826dd003d42a29f5739faa2eb010bd278d0e910","observation_id":"6a962bc6-b42d-4049-a443-388b5ea5c942","resolution":{"observed_at":"2026-08-06T17:56:44.231602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-06T17:56:44.212743Z","title":null,"venue":null,"work_id":"cdf7dab3-0b84-45e8-b4d5-30a1992c24ab","year":1928},"citing_paper":{"arxiv_id":"2507.09902","last_updated":"2025-07-14T04:15:17Z","snapshot_observed_at":"2026-08-13T01:05:00.353772Z","submitted_at":"2025-07-14T04:15:17Z","title":"Tie-breaking Agnostic Lower Bound for Fictitious Play","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T17:56:44.062596Z"},"links":{"citing_paper":"/paper/2507.09902"},"observation_digest":"sha256:2a7cee96832cb50ee007a0a048c441021d2927b696297ccfa79a30f813830680","observation_id":"ab550f00-e302-442e-9a2c-03f290466a4e","resolution":{"observed_at":"2026-08-06T17:56:44.218110Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.09902","last_updated":"2025-07-14T04:15:17Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-13T01:05:00.353772Z","submitted_at":"2025-07-14T04:15:17Z","title":"Tie-breaking Agnostic Lower Bound for Fictitious Play"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":11},"total_outbound_references":13},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 2 inbound Pith citation observations for arXiv:2507.09902."}