{"as_of":"2026-08-21T10:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6daacc9789c74956f4a830428cbfd65433a5dc9e5cf76b2abfcf3821001ed9ac","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:57:11.237451Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2506.16253/citation-record","integrity":"/paper/2506.16253/integrity","json":"/paper/2506.16253/citation-record.json","paper":"/paper/2506.16253"},"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-06T23:57:11.575643Z","title":null,"venue":null,"work_id":"5b02d881-feb7-439f-aae3-62b67a2e876a","year":null},"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":1,"source":"pdf_text","source_observed_at":"2026-08-06T23:57:11.144257Z"},"links":{"citing_paper":"/paper/2506.16253"},"observation_digest":"sha256:5b8c305b80008aa451d5d1ce5f80024d202047cd1add028aed056e427eaeb9c6","observation_id":"9e851aa5-69b5-4f83-ac4b-15a64c0d48c2","resolution":{"observed_at":"2026-08-06T23:57:11.581742Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"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-06T23:57:11.556017Z","title":null,"venue":null,"work_id":"72499c0c-bf83-4e65-a6ee-8dc38013fa5d","year":null},"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":2,"source":"pdf_text","source_observed_at":"2026-08-06T23:57:11.155197Z"},"links":{"citing_paper":"/paper/2506.16253"},"observation_digest":"sha256:80e0bca34fdb80e20a72709d91d7e3417860abe6a162881758c4f6a21ee1a42b","observation_id":"b63bc5b4-2ebc-4e65-8517-ba3c7090ea90","resolution":{"observed_at":"2026-08-06T23:57:11.562396Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T23:57:11.536782Z","title":"They satisfy the recurrence relation: n + 1 k = n n k + n k − 1 , for n ≥ 1, k≥ 1, with base cases: 0 0 = 1, n 0 = 0 for n >0, 0 k = 0 for k >0","venue":null,"work_id":"30155832-6849-4e59-9378-5af5515202f6","year":1994},"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":3,"source":"pdf_text","source_observed_at":"2026-08-06T23:57:11.161622Z"},"links":{"citing_paper":"/paper/2506.16253"},"observation_digest":"sha256:bbcae7b24590700d60fcdc85172f35743bca54177afc7a3f77d72b605b816287","observation_id":"b6edbd1e-1e49-4cb2-aaaa-290ba32b8d87","resolution":{"observed_at":"2026-08-06T23:57:11.543150Z","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-06T23:57:11.516738Z","title":null,"venue":null,"work_id":"e3ae909c-bc09-4030-bdd7-d0a615fe6629","year":null},"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":5,"source":"pdf_text","source_observed_at":"2026-08-06T23:57:11.168627Z"},"links":{"citing_paper":"/paper/2506.16253"},"observation_digest":"sha256:9e461a3c09bbc5dab6203752db129c98a99f363338f10ddec5f1cabb540114aa","observation_id":"6292bd1c-3151-4d03-aec3-68faac09e2d3","resolution":{"observed_at":"2026-08-06T23:57:11.522482Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T23:57:11.497408Z","title":"The proof of Lemma 29 is presented in Appendix B.2","venue":null,"work_id":"ca0472fe-6287-42a5-8f20-d345d72fbd31","year":null},"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":6,"source":"pdf_text","source_observed_at":"2026-08-06T23:57:11.174277Z"},"links":{"citing_paper":"/paper/2506.16253"},"observation_digest":"sha256:fe11153dfbf6315e48885471f8be2008f9bac04661b43d61e09d6241b9498cfe","observation_id":"a5b71adc-2f5e-4663-a177-d96638fd69d6","resolution":{"observed_at":"2026-08-06T23:57:11.503276Z","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-06T23:57:11.478266Z","title":null,"venue":null,"work_id":"915925d4-f029-41dc-a907-f36867450f7f","year":null},"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":7,"source":"pdf_text","source_observed_at":"2026-08-06T23:57:11.181294Z"},"links":{"citing_paper":"/paper/2506.16253"},"observation_digest":"sha256:3d832a42543f4b36dfa75658dbac93e8b8ee29c898448e13e978e645633eab06","observation_id":"2c29ee71-bfab-4f08-bdf5-90e04f633a86","resolution":{"observed_at":"2026-08-06T23:57:11.484310Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T23:57:11.460059Z","title":", im} the expression ∂mvI stands for ∂v(i1)","venue":null,"work_id":"b2fc11d0-23c7-40e2-8ce1-f596ea70f590","year":null},"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":8,"source":"pdf_text","source_observed_at":"2026-08-06T23:57:11.186908Z"},"links":{"citing_paper":"/paper/2506.16253"},"observation_digest":"sha256:5522a9b35c22d910ec70817d8fd70d8300f2978d6ebd326eec39c09fc9cf1aa9","observation_id":"350a9554-d5a9-455f-ae66-4cde2dca6041","resolution":{"observed_at":"2026-08-06T23:57:11.466095Z","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-06T23:57:11.438219Z","title":null,"venue":null,"work_id":"52578613-e82a-44a7-9c13-5bb8c8cf6017","year":1978},"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":9,"source":"pdf_text","source_observed_at":"2026-08-06T23:57:11.194041Z"},"links":{"citing_paper":"/paper/2506.16253"},"observation_digest":"sha256:f0de300e4a122d85a194c1e0bced3ca6c81714868ec1f3074fbdf853d4f80213","observation_id":"6e3265b7-4a81-4ffc-a284-f58a398f5790","resolution":{"observed_at":"2026-08-06T23:57:11.444982Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T23:57:11.418009Z","title":null,"venue":null,"work_id":"5afc38a0-5c66-4ba6-82a5-1070f8066be7","year":null},"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":10,"source":"pdf_text","source_observed_at":"2026-08-06T23:57:11.201331Z"},"links":{"citing_paper":"/paper/2506.16253"},"observation_digest":"sha256:62209e2e3d1e5fbe1ff977c22533d95aa78db9634472ff92fb128472408de7a5","observation_id":"e78c7d59-53b6-4f95-b5ff-a3e940cf2d5e","resolution":{"observed_at":"2026-08-06T23:57:11.424393Z","resolver_source":"raw_fallback","status":"unresolved"},"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-06T23:57:11.394048Z","title":"These coefficients can be precomputed before the algorithm begins","venue":null,"work_id":"d4eba871-bda3-4482-b46e-51a91716d9f4","year":null},"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":11,"source":"pdf_text","source_observed_at":"2026-08-06T23:57:11.208429Z"},"links":{"citing_paper":"/paper/2506.16253"},"observation_digest":"sha256:c770e2cbe4e27a989c8365092fb5d514292809412adb5f8fe155613d6cb616d7","observation_id":"6e639152-29d9-49af-a619-2cc1f88672b6","resolution":{"observed_at":"2026-08-06T23:57:11.401306Z","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-06T23:57:11.374656Z","title":",DH−1,K−1(v\\K) in O(K2)","venue":null,"work_id":"6b20f93f-3ece-4bbd-ae50-63aecb21bd4a","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":12,"source":"pdf_text","source_observed_at":"2026-08-06T23:57:11.215641Z"},"links":{"citing_paper":"/paper/2506.16253"},"observation_digest":"sha256:9583295185488380579623f3010fd48187e75c9eeb7e222d6a33bc2c437c9490","observation_id":"05ff32cd-8581-4a78-ad74-747dd85ac4d6","resolution":{"observed_at":"2026-08-06T23:57:11.380438Z","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-06T23:57:11.351281Z","title":"Hence DH,K is itself a multivariate polynomial, and therefore C∞ on RK","venue":null,"work_id":"78adbdb3-3320-4c2f-abec-b33471792037","year":null},"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":13,"source":"pdf_text","source_observed_at":"2026-08-06T23:57:11.222242Z"},"links":{"citing_paper":"/paper/2506.16253"},"observation_digest":"sha256:3519fee7be36201fc2c65337f6dfbaf15926c0bcf194c8c0cf5eda0698a0ac2f","observation_id":"c1c845e1-8dfa-4beb-8bea-9b43c6838fca","resolution":{"observed_at":"2026-08-06T23:57:11.357851Z","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-06T23:57:11.331071Z","title":"• Base case (m = 1): Let k ∈ [K] be some index","venue":null,"work_id":"08ffac33-dc18-4cb6-837a-810370fa5a4a","year":null},"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":14,"source":"pdf_text","source_observed_at":"2026-08-06T23:57:11.231658Z"},"links":{"citing_paper":"/paper/2506.16253"},"observation_digest":"sha256:cf552e333ee18f8569bea4bbe6bf43ee4525160bc1732a9caf7e71cc68738428","observation_id":"7098e8ad-042f-48b1-a83f-ef1adebbc180","resolution":{"observed_at":"2026-08-06T23:57:11.337233Z","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-06T23:57:11.312720Z","title":"By Lemma 36.2 it holds that ∂m ∂v(k)m DH,K (v) = ∂m−1 ∂v(k)m−1 DH,K−1 v\\k = 0","venue":null,"work_id":"d2feb740-3f93-4765-80f5-9acf6d87b2fa","year":null},"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":15,"source":"pdf_text","source_observed_at":"2026-08-06T23:57:11.237451Z"},"links":{"citing_paper":"/paper/2506.16253"},"observation_digest":"sha256:ae7614d090e808731f2e07859b0ce9a2b3bb4598a5ad9fac227372830ce82932","observation_id":"771b590f-3c9d-4585-b91d-2767645287cc","resolution":{"observed_at":"2026-08-06T23:57:11.318165Z","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":"2501.06923","last_updated":"2025-01-12T20:23:46Z","snapshot_observed_at":"2026-08-21T09:37:46.881573Z","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:bf155e127ea701a95da851d78efcb79f98053654088fbda1351499ccbebb7a03","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"}}],"paper":{"arxiv_id":"2506.16253","last_updated":"2025-06-19T12:11:58Z","latest_version":1,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":5,"verified_exact":1,"verified_fuzzy":8},"total_outbound_references":15},"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 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2506.16253."}