{"as_of":"2026-08-14T23:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bff5b2d659f9e07eb3df26577d8f57db4f96259b6eec1a2581143adfce7580ec","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T14:42:08.814379Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2608.09586/citation-record","integrity":"/paper/2608.09586/integrity","json":"/paper/2608.09586/citation-record.json","paper":"/paper/2608.09586"},"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-11T14:42:09.447825Z","title":"Using counterfactual regret minimization to create competitive multiplayer poker agents","venue":null,"work_id":"c7fd40c4-64af-42ed-9724-af79243160d3","year":2010},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.641861Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:b3bd7b27f275ba3a9dce4c477188d920d80eb89838ff6646eff4225a559183fc","observation_id":"92451f94-8720-4047-b76c-4dac168aeb94","resolution":{"observed_at":"2026-08-11T14:42:09.457055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16609","last_updated":"2023-09-28T17:07:49Z","snapshot_observed_at":"2026-08-09T21:25:20.369782Z","submitted_at":"2023-09-28T17:07:49Z","title":"Qwen Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16609","snapshot_observed_at":"2026-08-11T14:42:08.646733Z","title":"Qwen technical report.arXiv preprint arXiv:2309.16609, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.646733Z"},"links":{"cited_paper":"/paper/2309.16609","citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:231debe81d42b6dd097d8474a3e9cce4c15f8fffa0a370ce094d9394ac1aeaeb","observation_id":"ebbc12f4-477f-46b5-995b-7af06df0385b","resolution":{"observed_at":"2026-08-11T14:42:08.646733Z","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-11T14:42:09.426792Z","title":"Opponent modeling in poker.Aaai/iaai, 493(499):105, 1998","venue":null,"work_id":"9576e9fd-4f3e-41ae-a104-6cabe4c85885","year":1998},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.651893Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:e5d4b080fe86886e3edce900d3dc8588a5a7ff0d0fdc2cf06bc9d7b867b3270f","observation_id":"8104436c-df10-4d73-b7a3-7071526909c4","resolution":{"observed_at":"2026-08-11T14:42:09.434272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T14:42:09.407294Z","title":"Heads-up limit hold’em poker is solved.Science, 347(6218):145–149, 2015","venue":null,"work_id":"a323c147-ff2c-4f24-84e7-df750d2ac83d","year":2015},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.656226Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:8ba13e35a11bb716e2d51a5a0b449323c3ba8fcb96ca59568c15413eed618fdc","observation_id":"db8fa8fc-518c-4c31-b169-ecec9cd05be3","resolution":{"observed_at":"2026-08-11T14:42:09.413296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T14:42:09.392492Z","title":null,"venue":null,"work_id":"a337068a-d6fb-4b88-94e3-65a9012f3775","year":1951},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.660936Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:08a7ee701f219e6f9d3760a7b74a1572430ff6ac65b1c3378dd8d5e315e3fa39","observation_id":"555b44e2-ffb1-4a09-bdea-7213e88d0c0b","resolution":{"observed_at":"2026-08-11T14:42:09.396880Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-11T14:42:08.665642Z","title":"Superhuman ai for heads-up no-limit poker: Libratus beats top professionals.Science, 359(6374):418–424, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.665642Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:7c6efbc40bf85b4c8af4e66b586deac75db4dad4cdf76c5a28376ba99543e862","observation_id":"da256e99-6ba0-432b-86dd-b916bff978b6","resolution":{"observed_at":"2026-08-11T14:42:08.665642Z","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-08-11T14:42:08.670169Z","title":"Superhuman ai for multiplayer poker.Science, 365(6456): 885–890, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.670169Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:4e7bdd5623fd2ffc74f923afd13068fcf32d51c938d0dfac2ec0f1b8cb81ea8c","observation_id":"b5aea766-2fea-497c-82c2-1b31a2325f2a","resolution":{"observed_at":"2026-08-11T14:42:08.670169Z","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-11T14:42:09.357536Z","title":"An investigation into tournament poker strategy using evolutionary algorithms","venue":null,"work_id":"ad73607b-f65b-455e-9167-3e4f3e3013d2","year":2007},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.674131Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:7db0972aacbb597d83ac9b6319ce9eb1acca4749395f0a5e1e7409a1b115a74a","observation_id":"445b8e4c-f1e7-4583-85b1-7a58b6e9852d","resolution":{"observed_at":"2026-08-11T14:42:09.362546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T14:42:09.342252Z","title":"Gambler’s ruin and the icm.Statistical Science, 37(3): 289–305, 2022","venue":null,"work_id":"f2bc18d6-0b6d-4abf-9740-603f006e33c2","year":2022},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.678320Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:3e35bb7546b966bd84b2230fff44da348b5c1cfcb9c36f3dfd4aedf509be7fef","observation_id":"93a48a4f-787f-46eb-aa80-7f606b763fb4","resolution":{"observed_at":"2026-08-11T14:42:09.348466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T14:42:09.327858Z","title":"Computing an approximate jam/fold equilibrium for 3-player no-limit texas hold’em tournaments","venue":null,"work_id":"c99b0514-a53e-49eb-a9ab-7d395989d63e","year":2008},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.682301Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:61638935dc218aa50c058dc9ae328f03e221ce74fc09262640764adcb9463f77","observation_id":"61c0df4a-5cfc-4fc7-90ec-02cefcd715a3","resolution":{"observed_at":"2026-08-11T14:42:09.333186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T14:42:09.315606Z","title":"Computing equilibria in multiplayer stochastic games of imperfect information","venue":null,"work_id":"08dd97c4-12bd-42c4-83ea-148d02622bbb","year":2009},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.686463Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:2582c3a9dc73a114d548d0da1cd57b11b36f5c750abc2e493467d6f2b000d4ed","observation_id":"aeaca768-c12e-47d2-89d2-619b89c68ea4","resolution":{"observed_at":"2026-08-11T14:42:09.320070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T14:42:09.302786Z","title":"Successful nash equilibrium agent for a three-player imperfect-information game.Games, 9(2):33, 2018","venue":null,"work_id":"bcb64b44-f920-49fc-b595-ece3002f4d5f","year":2018},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.690529Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:06aa23cc07f509053359a8b304334db2848f23b2391ae6ddc8d05a3865d9b312","observation_id":"9e60d6af-63cc-466a-821e-f0909279577c","resolution":{"observed_at":"2026-08-11T14:42:09.307322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T14:42:09.288798Z","title":"Regret minimization in multiplayer extensive games","venue":null,"work_id":"e6739b82-bcb3-464b-aa1d-504666fd0969","year":2011},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.694843Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:026a2d18cbfeb519ba1c2c0a77e3cfd08c11560add503bab8136393162e50182","observation_id":"9de64015-0e0d-4ea4-a833-6221ec7aba8e","resolution":{"observed_at":"2026-08-11T14:42:09.293060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T14:42:09.274844Z","title":"On strategy stitching in large extensive form multiplayer games.Advances in Neural Information Processing Systems, 24, 2011","venue":null,"work_id":"a0f194b1-238f-431c-894b-46ceb51dc77f","year":2011},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.698909Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:47a4cc15990b1d92ca4fbc17a8602d6f60bf8547d4956642562b0da6da100025","observation_id":"b0ecbb25-86f3-4e8e-940d-51c0fe8f59a7","resolution":{"observed_at":"2026-08-11T14:42:09.279332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T14:42:09.261595Z","title":"Lossless abstraction of imperfect information games","venue":null,"work_id":"d62639b1-2030-4a13-a7b0-4e8d72613bd7","year":2007},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.702833Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:95230aa20bb227b8a447419175104cd5a5b7ee8413ff040394e0d4cb97af83c2","observation_id":"8685ec5a-8c0d-4767-aa7a-219954e41e98","resolution":{"observed_at":"2026-08-11T14:42:09.265811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-11T14:42:08.706867Z","title":"The llama 3 herd of models.arXiv preprint arXiv:2407.21783, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.706867Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:280cde4374edf5997483f4dd30a2a38366c6abc5670a4bdcd55e6f424047dd18","observation_id":"2a7f78b1-fb7d-49e3-81aa-df599c66c61a","resolution":{"observed_at":"2026-08-11T14:42:08.706867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.17277","last_updated":"2024-08-31T11:50:41Z","snapshot_observed_at":"2026-08-13T10:02:11.784114Z","submitted_at":"2023-09-29T14:30:03Z","title":"Suspicion-Agent: Playing Imperfect Information Games with Theory of Mind Aware GPT-4","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.17277","snapshot_observed_at":"2026-08-11T14:42:08.711588Z","title":"Suspicion-agent: Playing imperfect information games with theory of mind aware GPT-4","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.711588Z"},"links":{"cited_paper":"/paper/2309.17277","citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:b76965bbc951cdb6207bd603aab0c640d467fc8aa8da17d4f87304a2df7e33ce","observation_id":"645798f7-707f-4981-b613-2984ad42c77f","resolution":{"observed_at":"2026-08-11T14:42:08.711588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12466","last_updated":"2023-12-21T15:14:46Z","snapshot_observed_at":"2026-08-14T23:46:27.383874Z","submitted_at":"2023-08-23T23:16:35Z","title":"Are ChatGPT and GPT-4 Good Poker Players? -- A Pre-Flop Analysis","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12466","snapshot_observed_at":"2026-08-11T14:42:08.716128Z","title":"Are chatgpt and GPT-4 good poker players? - A pre-flop analysis.CoRR, abs/2308.12466, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.716128Z"},"links":{"cited_paper":"/paper/2308.12466","citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:4e5a66b310b3f31696721180b24d6da11704ae9f2abfa5b3751608dd54e2d083","observation_id":"06b9a56b-1884-45a3-acc9-bf8b3b424d47","resolution":{"observed_at":"2026-08-11T14:42:08.716128Z","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-08-11T14:42:08.720615Z","title":"Harville","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.720615Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:2b6a790ed38bcbb91448b8f225a9434e33f37a5be1e9c4ea54c5fa8bcaa792b1","observation_id":"dd72abd1-5894-4dfd-a494-2f1a40e995db","resolution":{"observed_at":"2026-08-11T14:42:08.720615Z","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-11T14:42:09.247766Z","title":"Effective short-term opponent exploitation in simplified poker","venue":null,"work_id":"cd8dc76d-e0f2-42b5-b825-b8583ffaff04","year":2005},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.725316Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:23ac10d15c101564e2f0215303a76d009a9e71215048a4baf99d970ccf13becf","observation_id":"c1a5dbff-1cab-4848-8ea4-6644c88d9e17","resolution":{"observed_at":"2026-08-11T14:42:09.252297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06781","last_updated":"2024-01-04T13:27:50Z","snapshot_observed_at":"2026-08-13T04:49:01.431652Z","submitted_at":"2024-01-04T13:27:50Z","title":"PokerGPT: An End-to-End Lightweight Solver for Multi-Player Texas Hold'em via Large Language Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.06781","snapshot_observed_at":"2026-08-11T14:42:08.729768Z","title":"Pokergpt: An end-to-end lightweight solver for multi-player texas hold’em via large language model.CoRR, abs/2401.06781, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.729768Z"},"links":{"cited_paper":"/paper/2401.06781","citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:d1ff383b8cbf79aa56ab20954e4181d4a3c2297d1663451360e3487cc5d8ee7e","observation_id":"f6659a7c-65de-4e93-9fe7-f73860e5310c","resolution":{"observed_at":"2026-08-11T14:42:08.729768Z","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-11T14:42:09.234849Z","title":"Empirical validation of the independent chip model","venue":null,"work_id":"1519990e-a393-4ac1-bb9a-b426d1475edb","year":2025},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.734067Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:0f08df37b0cf6379ae34039825bd5763e5108d086cbef8d718c0aa686f6bde15","observation_id":"3afad752-d7f1-4608-bb94-00396b161d44","resolution":{"observed_at":"2026-08-11T14:42:09.239519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.geb.2005.03.005","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T14:42:08.848119Z","title":"Leslie and Edmund J","venue":null,"work_id":"cd888a95-2ff1-455b-8629-de55f686394a","year":2006},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.738622Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:190511e62937ce237b240607b22e661999104f9dbbea9924fee6ddcf58c82432","observation_id":"cdd4baf0-9e4f-4dee-af24-0ccb26412840","resolution":{"observed_at":"2026-08-11T14:42:08.854511Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-11T14:42:08.742791Z","title":"Efficient online pruning and abstraction for imperfect information extensive-form games","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.742791Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:9000380c22d56ed34c69095c6d116847f2f2297323797ad9b529d553c111abbc","observation_id":"e10bde8c-8ad5-43b3-b7fa-c454248f4ea8","resolution":{"observed_at":"2026-08-11T14:42:08.742791Z","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-08-11T14:42:08.746950Z","title":"Agents that certify their own exploits: Confidence-scheduled restricted responses for safe opponent exploitation, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.746950Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:9e551a759a2c546ea9ccff92bc243737598e48ee28374b5dafd8060055afa7e9","observation_id":"4542a7ca-1ac6-48c5-ab56-9017b9700303","resolution":{"observed_at":"2026-08-11T14:42:08.746950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.10900","last_updated":"2026-05-11T17:41:16Z","snapshot_observed_at":"2026-08-13T19:45:40.726121Z","submitted_at":"2026-05-11T17:41:16Z","title":"Effective, Efficient, and General Information Abstraction for Imperfect-Information Extensive-Form Games","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.10900","snapshot_observed_at":"2026-08-11T14:42:08.751270Z","title":"Effective, efficient, and general information abstraction for imperfect-information extensive-form games.arXiv preprint arXiv:2605.10900, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.751270Z"},"links":{"cited_paper":"/paper/2605.10900","citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:b68aab927eb123bca25a5f6d212373fcb9bfb6f0f2d38fe65cda3a8a904a115d","observation_id":"57c47e4f-f770-4f69-ba25-2880d6b85310","resolution":{"observed_at":"2026-08-11T14:42:08.751270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.19928","last_updated":"2026-05-19T14:49:30Z","snapshot_observed_at":"2026-08-13T08:59:15.236309Z","submitted_at":"2026-05-19T14:49:30Z","title":"Real-Time Parallel Counterfactual Regret Minimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.19928","snapshot_observed_at":"2026-08-11T14:42:08.756158Z","title":"Real-time parallel counterfactual regret minimization.arXiv preprint arXiv:2605.19928, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.756158Z"},"links":{"cited_paper":"/paper/2605.19928","citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:0f7a6198b39d7139befc643c3c20bfb573e716103ba7462b18f8201520e44c57","observation_id":"c42c7e8c-aded-4e39-bf01-c6e6d243c804","resolution":{"observed_at":"2026-08-11T14:42:08.756158Z","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-08-11T14:42:08.760622Z","title":"Rl-cfr: improving action abstraction for imperfect information extensive-form games with reinforcement learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.760622Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:44047a65b9c713a3196402f2eb2481d83a490ff928e8815c667d458f03d3bbb0","observation_id":"70f2bcfd-f940-443a-a8a6-76e93aaa7d42","resolution":{"observed_at":"2026-08-11T14:42:08.760622Z","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-11T14:42:09.193800Z","title":"Av-aivat: 74x cheaper agent evaluation with certified anytime-valid stopping in imperfect-information games, 2026","venue":null,"work_id":"1a2e74db-dbb2-4ac4-822e-ba4c0ef22238","year":2026},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.764740Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:dc0bcffa180eea2b1214278c7ccc515b13557051483348cebb922e24870d71df","observation_id":"aba6dcf3-39c9-4c9c-9fd4-aff9c475dc31","resolution":{"observed_at":"2026-08-11T14:42:09.200315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2607.27035","last_updated":"2026-07-29T15:28:36Z","snapshot_observed_at":"2026-08-08T19:05:43.842976Z","submitted_at":"2026-07-29T15:28:36Z","title":"Correlated Chance Sampling for Monte Carlo Counterfactual Regret Minimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.27035","snapshot_observed_at":"2026-08-11T14:42:08.768689Z","title":"Correlated chance sampling for monte carlo counter- factual regret minimization, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.768689Z"},"links":{"cited_paper":"/paper/2607.27035","citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:809d581b0b1d9a49a2073e804daf0a502de0c917e86a71b933de30ef4c404d77","observation_id":"7cdb1697-16a4-4ed5-92fd-fa8fa0b16af2","resolution":{"observed_at":"2026-08-11T14:42:08.768689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.30094","last_updated":"2026-05-28T15:38:33Z","snapshot_observed_at":"2026-08-12T03:34:37.663986Z","submitted_at":"2026-05-28T15:38:33Z","title":"PokerSkill: LLMs Can Play Expert-Level Poker without Training or Solvers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.30094","snapshot_observed_at":"2026-08-11T14:42:08.773037Z","title":"Pokerskill: Llms can play expert-level poker without training or solvers.arXiv preprint arXiv:2605.30094, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.773037Z"},"links":{"cited_paper":"/paper/2605.30094","citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:1a1dca31632dde6213895d7dd11792f849892314a07a5df6ddd26bbced72adee","observation_id":"fd10e974-c237-4300-9ee8-3136a9e0382d","resolution":{"observed_at":"2026-08-11T14:42:08.773037Z","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-11T14:42:09.180032Z","title":"Two Plus Two Publishing LLC, 1999","venue":null,"work_id":"c1b45520-f62b-4e60-b205-2e6fee25421f","year":1999},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.777417Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:21e044057d7bcd9716c061369a93e019ac465c60581f462bad9a8e9de03a0236","observation_id":"f2e5f1f2-6afb-476e-b2a5-973b4d98c88a","resolution":{"observed_at":"2026-08-11T14:42:09.184537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T14:42:09.167576Z","title":"A near-optimal strategy for a heads-up no-limit texas hold’em poker tournament","venue":null,"work_id":"3bf493b3-f68e-49bf-9f11-8a6cdf2f14f8","year":2007},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.781251Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:ddcc15dee7cfb8300e1a6e6b627ff85ff0751bac9ecb68d9b6d488ba987d5be1","observation_id":"d68f1aba-f4bc-4f22-a7f8-9142b1ca8054","resolution":{"observed_at":"2026-08-11T14:42:09.171777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-11T14:42:08.785054Z","title":"Deepstack: Expert-level artificial intelligence in heads-up no-limit poker.Science, 356(6337):508–513, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.785054Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:c69ae51927650ba9f5c9e86c4d7fbb42714dcfd8cb0eeff62b84c7cdaaead625","observation_id":"81cac631-bea6-4076-bca3-3af04909b1b8","resolution":{"observed_at":"2026-08-11T14:42:08.785054Z","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-11T14:42:09.148253Z","title":"The state of solving large incomplete-information games, and application to poker.Ai Magazine, 31(4):13–32, 2010","venue":null,"work_id":"17c763f2-f819-4d47-b0a3-b6c838205fb4","year":2010},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.789057Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:cd29f9b7702ac280e01dda74262802173690b8aeb26d0a90223a1b472b60eb56","observation_id":"b1fc7824-d886-4c6e-8150-769417c45d5c","resolution":{"observed_at":"2026-08-11T14:42:09.152299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T14:42:09.135135Z","title":null,"venue":null,"work_id":"30ac583d-cf85-4789-8834-0546d02be4d7","year":2024},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.792983Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:9a7802ca83a1132184dad7a5018a2153cd53a6c7e8e725d36703950319e12065","observation_id":"531aebf8-e7f0-491d-b50b-9c39ea2e2db7","resolution":{"observed_at":"2026-08-11T14:42:09.139908Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T14:42:09.121778Z","title":"Two Plus Two Publishing LLC, 2007","venue":null,"work_id":"14490a50-0f6a-4d58-a0f8-c671a0a28325","year":2007},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.797344Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:4cab75777d7c6cd172bc567a247805fbe8d9bdb78d8baa70e0cd0d658122625e","observation_id":"0edc583e-2236-426e-86c1-e36c3253d764","resolution":{"observed_at":"2026-08-11T14:42:09.126188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T14:42:09.105076Z","title":"Two Plus Two Publishing, 1994","venue":null,"work_id":"80371a2e-efc9-4adb-bad8-8bce4b51d030","year":1994},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.801295Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:9bef8da068a071d51d0470935e81df4f47449fff99c8977ed57cec0dcadb0432","observation_id":"d3c8c3aa-3d8e-463e-ac21-8eff0a7a6dba","resolution":{"observed_at":"2026-08-11T14:42:09.109300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T14:42:09.091457Z","title":"Bayes’ bluff: opponent modelling in poker","venue":null,"work_id":"6b74b3e2-4077-4e1f-9ba2-6aa2f1ee21db","year":2005},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.805362Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:2ed43e4aa00c3abc59927a3b0f3c4a7b52ca9ec687cabcddc53975dada887431","observation_id":"24b5d762-86ed-44a1-a2e8-5c81d334a12e","resolution":{"observed_at":"2026-08-11T14:42:09.095944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T14:42:09.078581Z","title":"A parameterized family of equilibrium profiles for three-player kuhn poker","venue":null,"work_id":"22c1c2aa-ac7e-42b7-8118-7fde4138e178","year":2013},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.809304Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:556a181b3b5f77f5994a94fcc38b0270b1642206e802f1a6430ce1cd9b9fd092","observation_id":"aa73b4b3-76ff-4e1e-9ceb-775f6449f4b5","resolution":{"observed_at":"2026-08-11T14:42:09.082832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T14:42:09.064848Z","title":"Regret mini- mization in games with incomplete information.Advances in neural information processing systems, 20, 2007","venue":null,"work_id":"92e82fb9-7c98-4581-9e5c-bc80d0921557","year":2007},"citing_paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T14:42:08.814379Z"},"links":{"citing_paper":"/paper/2608.09586"},"observation_digest":"sha256:349fe49c34e7907338dc45150bc9d3d3c2e9206fec4f91094a3fcb3f05ec2a6f","observation_id":"a684ce09-e746-4da9-b4d5-c5973ba33fa7","resolution":{"observed_at":"2026-08-11T14:42:09.070349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.09586","last_updated":"2026-08-10T13:20:36Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-14T20:38:42.653406Z","submitted_at":"2026-08-10T13:20:36Z","title":"ICM Out! Better Tournament Strategy from Computed Continuations, vs. Solvers and LLMs"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":1,"verified_fuzzy":22},"total_outbound_references":41},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2608.09586."}