{"as_of":"2026-08-21T09:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aed994519665fd8b77ac7668df8ecbc11ef026f12671eee88ee3023628f53ea6","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:05:16.437028Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:57:11.136124Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T23:57:11.287842Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"cited_work":{"arxiv_id":"2501.06923","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.06923","snapshot_observed_at":"2026-08-06T23:57:11.287842Z","title":"Optimal Online Bookmaking for Binary Games","venue":"cs.GT","work_id":"6525954d-fc43-4f55-809e-6ec8d30cf781","year":2025},"citing_paper":{"arxiv_id":"2506.16253","last_updated":"2025-06-19T12:11:58Z","snapshot_observed_at":"2026-08-10T21:34:40.399756Z","submitted_at":"2025-06-19T12:11:58Z","title":"Optimal Online Bookmaking for Any Number of Outcomes","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-06T23:57:11.136124Z"},"links":{"cited_paper":"/paper/2501.06923","citing_paper":"/paper/2506.16253"},"observation_digest":"sha256:e58466b02104fd7d20c2957d8b28c2a222cd342cb8c476de6cab0965b154093b","observation_id":"f753cb4c-7334-45b4-b3c3-4b6aa9314950","resolution":{"observed_at":"2026-08-06T23:57:11.296432Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.06923/citation-record","integrity":"/paper/2501.06923/integrity","json":"/paper/2501.06923/citation-record.json","paper":"/paper/2501.06923"},"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-10T21:05:16.894661Z","title":"Cover and J","venue":null,"work_id":"f4efef77-1bd6-4d55-a4af-f4057700c583","year":2006},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.310986Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:54a10ff726f3b57f910eafae6f606f19dc8205fbbb88595e72bc5d29136a5a82","observation_id":"6e5ce489-a852-4fd2-bfa5-c997acd8b064","resolution":{"observed_at":"2026-08-10T21:05:16.899835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.877866Z","title":"Understanding the convergence of markets in online sports betting,","venue":null,"work_id":"005fbd3b-07f2-4a28-964c-daecdc0e3d0d","year":2018},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.316557Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:6574b8219c48146cab970580a4912f2639d2bfa8e09e36330fed3231cbae3107","observation_id":"c62ec8bd-22dc-4672-be05-95a3b3c94f31","resolution":{"observed_at":"2026-08-10T21:05:16.882962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.859716Z","title":"Online learning in betting markets: profit versus prediction,","venue":null,"work_id":"c4523a98-bb80-4d53-810b-b0a1fa9a89ba","year":2024},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.321733Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:4979135ad4532f8afa235e277da25ede43346eb0f12ec6f0bfa879010177736b","observation_id":"018674d7-bf3a-4d14-9575-7b21518b24a1","resolution":{"observed_at":"2026-08-10T21:05:16.865846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.839653Z","title":"Behaviour of sequential predictors of binary sequences,","venue":null,"work_id":"cece131a-c448-4102-abe2-617558e9f0df","year":1965},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.326751Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:3483dad17242c273f57785889e59dd3042919beaa72a253dbcb233470c585318","observation_id":"6f720e26-45f6-4de6-82e0-b048a6c0eb7b","resolution":{"observed_at":"2026-08-10T21:05:16.846675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1608.09014","last_updated":"2016-08-31T19:55:35Z","snapshot_observed_at":"2026-08-14T21:41:53.437164Z","submitted_at":"2016-08-31T19:55:35Z","title":"A Tutorial on Online Supervised Learning with Applications to Node Classification in Social Networks","version":1},"cited_work":{"arxiv_id":"1608.09014","doi":null,"metadata_source":"pith","pith_arxiv_id":"1608.09014","snapshot_observed_at":"2026-08-10T21:05:16.496417Z","title":"A Tutorial on Online Supervised Learning with Applications to Node Classification in Social Networks","venue":"cs.LG","work_id":"9acadc02-6d73-491c-b11e-79e1e73b0611","year":2016},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.331811Z"},"links":{"cited_paper":"/paper/1608.09014","citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:bf7bd537d06dbb6b556ee529ed746916ba4e70aee2651c21cd5f1e28e32c2e29","observation_id":"4c64b350-dfb1-4fa0-abc9-eafd71589540","resolution":{"observed_at":"2026-08-10T21:05:16.505334Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.821751Z","title":"Towards optimal algorithms for prediction with expert advice,","venue":null,"work_id":"22a2475b-06be-44cc-b9c5-d4eb245d799b","year":2016},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.337113Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:f19bf0998fc0facce0343da7296810a761c5b432c67767d2550020ac308e5ec2","observation_id":"f3368b61-bf98-4bf0-a3f6-daa65eb2a868","resolution":{"observed_at":"2026-08-10T21:05:16.827719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.804335Z","title":"Universal portfolios,","venue":null,"work_id":"124eea90-e85d-40cc-80d0-9d3b0018725b","year":1991},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.342454Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:e2ed26ac3ff355289db822c02800005536b401c6098a09005a199ed15fa915d8","observation_id":"cc95ec69-0651-4591-a81f-34ef7a29c5b3","resolution":{"observed_at":"2026-08-10T21:05:16.809681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.347202Z","title":"Universal sequential coding of single messages,","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.347202Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:3124b1418d83a49a2b19a34a26925938962f8e68907224062f39769235fe606d","observation_id":"c5d2702e-eb8c-42f0-b0e8-042d353a8b7b","resolution":{"observed_at":"2026-08-10T21:05:16.347202Z","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-10T21:05:16.776299Z","title":"How to use expert advice,","venue":null,"work_id":"82809283-ed14-4de5-914c-4594d11a66db","year":1997},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.351918Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:09839938e644642d2536b4907e86b86bdd46e094e818a835197645090b0ab3f8","observation_id":"e82bf742-99f8-4f17-992b-706d1a2ae02e","resolution":{"observed_at":"2026-08-10T21:05:16.782086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-14T19:15:36.367708Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-08-10T21:05:16.356510Z","title":"Introduction to online convex optimization,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.356510Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:7c16452e5333163cc696d8a2b4f7b09d28a4dcc33165f484952f606c8d07f53b","observation_id":"16515729-5222-488c-b4f9-cbbddd05be9e","resolution":{"observed_at":"2026-08-10T21:05:16.356510Z","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-10T21:05:16.759895Z","title":"The multiplicative weights update method: a meta-algorithm and applications,","venue":null,"work_id":"93b42927-4db8-4e45-b441-5aa93e97ab35","year":2012},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.361796Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:abc203567f6a84d5ec2dcf83b28f957806c5f547278db516ba77dcbc74f8e93a","observation_id":"6c1164cc-bce4-42b2-a292-556357dfd0c9","resolution":{"observed_at":"2026-08-10T21:05:16.765223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.742086Z","title":"An analog of the minimax theorem for vector payoffs","venue":null,"work_id":"0af6df69-f9d5-4a1f-9da4-7636cb4a9530","year":1956},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.366597Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:709275de87f61bd6d1f4cee7b4253fe2849b5868e2f4997ff726426d612f8ca6","observation_id":"020e4726-c8c8-4233-80b4-04cb42df699a","resolution":{"observed_at":"2026-08-10T21:05:16.747786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.724870Z","title":"Calibrated learning and correlated equilibrium,","venue":null,"work_id":"beb099e0-d3a0-4675-a992-e68d95b1cafc","year":1997},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.371325Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:46c6aab0edb96264bcc99041c76afcd91447a0684179a6ed1dbb17d8c9a604e3","observation_id":"9d008794-f1c6-4ff5-83e9-ca728ac735b4","resolution":{"observed_at":"2026-08-10T21:05:16.730600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.708313Z","title":"Asymptotic calibration,","venue":null,"work_id":"d3d4afbd-a653-4502-b202-bd5e2ac34b81","year":1998},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.375678Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:c33f6084d6c4a2fc87e252d47eb51e006129cb8cc2436972874b524a99d597b0","observation_id":"7f340929-4cb0-411f-852c-df2a42177197","resolution":{"observed_at":"2026-08-10T21:05:16.713580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.380209Z","title":"Cesa-Bianchi and G","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.380209Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:d3d5aeee5702e6837bd9ff9217b06aa2c9d299a79fe38bf1a269a3a4d5313c6d","observation_id":"4a75f8b3-4ed7-4601-8198-fe1e40517643","resolution":{"observed_at":"2026-08-10T21:05:16.380209Z","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-10T21:05:16.679960Z","title":"A proof of calibration via blackwell’s approachability theorem,","venue":null,"work_id":"cc8bfd24-5fbf-4dac-bc37-5ccca1821cad","year":1999},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.384577Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:28f27f1b3fb0461cbae977d10920ec7b6757c8cc41bbf0b5d4dd3f149e8da85d","observation_id":"29444b9b-7ad2-415c-88d5-77cf607b635d","resolution":{"observed_at":"2026-08-10T21:05:16.685888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.662478Z","title":"A geometric proof of calibration,","venue":null,"work_id":"4a52d7e3-e24a-4d01-ac8c-004f98efd711","year":2010},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.389451Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:6ee653d73f411d42075c6554c3d02dfc0aeff63c33c8b48b39f14ffc803d49d6","observation_id":"f51b3c97-c766-4358-8f2c-634a066f95cb","resolution":{"observed_at":"2026-08-10T21:05:16.668005Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.646714Z","title":"Blackwell approachability and no-regret learning are equivalent,","venue":null,"work_id":"e5dd9828-6329-45a2-99cc-cdd97b659c4b","year":2011},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.394428Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:41425b498d46d8a497dfb8122a08da0e46f0ed37c0fb336a138642f7af74cf42","observation_id":"ffee244b-ab8a-4477-9f87-0e56a96b3c73","resolution":{"observed_at":"2026-08-10T21:05:16.652015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.630403Z","title":"Defensive forecasting,","venue":null,"work_id":"b66cc280-1fe5-4f3b-8249-56c203168322","year":2005},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.399175Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:3a8a84baeec84e9169ae4bbc1327c0a4f0c8e75a9b876120658c70c42191c80c","observation_id":"9612f430-e207-4ba0-8d9d-7be2758d585d","resolution":{"observed_at":"2026-08-10T21:05:16.635510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.613641Z","title":"Deterministic calibration and nash equilibrium,","venue":null,"work_id":"4439e8b5-df88-4b1e-9eae-644d3b680558","year":2004},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.403886Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:088727c3553f62a2c7f3dd7c3b74770f673a914f526f7cd632d30b007406eb35","observation_id":"03721ac3-760e-42b2-90ca-eba6aff7b720","resolution":{"observed_at":"2026-08-10T21:05:16.619481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.595876Z","title":"Bertsekas, Dynamic Programming and Optimal Control , 2nd ed","venue":null,"work_id":"740c8117-3e1f-4b59-998a-7622da4d69be","year":2001},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.409930Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:a9c3942f56a93c3ee142cfa239c8313aee1fbeabf293559ecaa305cdcfed2a03","observation_id":"848a5292-0192-4906-8800-e5b39e3b131c","resolution":{"observed_at":"2026-08-10T21:05:16.601837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.415613Z","title":"Universal prediction,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.415613Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:4cb782becff398a4f01ec8871d369914efd7010d85529ef34c370c4d548c38f8","observation_id":"33ac7325-610e-491a-9045-f39519b70646","resolution":{"observed_at":"2026-08-10T21:05:16.415613Z","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-10T21:05:16.569642Z","title":"The performance of universal encoding,","venue":null,"work_id":"4eab05bc-0953-4cb5-b9cd-003f054e299b","year":1981},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.422151Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:8818e9088deb2da466c1bdd41da2704b53c947944ad61e9ef4c7da75988b3f84","observation_id":"73bc1857-c2a4-4867-9880-a093e9a09750","resolution":{"observed_at":"2026-08-10T21:05:16.575025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.552502Z","title":"Information theory: From coding to learning,","venue":null,"work_id":"9f3e72ec-5c1a-440a-babf-c717f1f235ba","year":2022},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.426539Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:349976333ddb80ec27233f928df611e7bb5abdc02f861eda3e35ca3261a21cdf","observation_id":"e543ca68-aa77-4cc6-a683-f8d137ebdbbb","resolution":{"observed_at":"2026-08-10T21:05:16.558102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.534770Z","title":"Blackwell approachability and regret minimization on simplex domains,","venue":null,"work_id":"fa0ef199-389c-43a1-9062-a9458d1cf75c","year":null},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.431465Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:ed304b54b38cdc8996d985e22cb82dcb0576cd7f5c63f8d5e2582c04a2325934","observation_id":"839fb1f9-f339-4d15-a849-7e686b4b45ad","resolution":{"observed_at":"2026-08-10T21:05:16.540671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-10T21:05:16.518139Z","title":"Available: https://www.mit.edu/~gfarina/2021/15888f21_L04_blackwell_rm/L04_blackwell_rm.pdf","venue":null,"work_id":"7b185c79-9fc1-4214-9a7c-ba6f2aff679d","year":2021},"citing_paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-10T21:05:16.437028Z"},"links":{"citing_paper":"/paper/2501.06923"},"observation_digest":"sha256:21ec10344de807effe8073995ec21130b49e50394c6e03551871665ed7fdc706","observation_id":"6ed88551-bdb6-4cc9-b89d-330bbb249b1c","resolution":{"observed_at":"2026-08-10T21:05:16.523925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.06923","last_updated":"2025-01-12T20:23:46Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-16T12:59:08.187699Z","submitted_at":"2025-01-12T20:23:46Z","title":"Optimal Online Bookmaking for Binary Games"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":21},"total_outbound_references":26},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 1 inbound Pith citation observation for arXiv:2501.06923."}