{"as_of":"2026-08-09T17:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b17ff385e3026cf7ab950bcd091f2d8cc0f4799c521bdb7a6e7092e2c1d12548","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-09T00:26:51.570509Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-12T00:59:04.664288Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T08:36:24.049420Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","snapshot_observed_at":"2026-08-09T00:11:49.079124Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms","version":2},"cited_work":{"arxiv_id":"2502.03919","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.03919","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Blackwell’s approachability with ap- proximation algorithms","venue":null,"work_id":"4578a62c-bb6b-4777-bcd1-8592559d3c5c","year":2025},"citing_paper":{"arxiv_id":"2605.06624","last_updated":"2026-05-08T19:05:03Z","snapshot_observed_at":"2026-07-06T23:19:05.764765Z","submitted_at":"2026-05-07T17:38:36Z","title":"Online Scalarization in Vector-Valued Games","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-08T04:00:49.769114Z"},"links":{"cited_paper":"/paper/2502.03919","citing_paper":"/paper/2605.06624"},"observation_digest":"sha256:b9d715e1a85e95fb7d040f5c6b40e7e2f6e02cea53b4d3864a7d22fa98032368","observation_id":"c1841935-1dc4-45cc-adc9-3fff8252c80d","resolution":{"observed_at":"2026-05-11T21:51:31.605134Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","snapshot_observed_at":"2026-08-09T00:11:49.079124Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms","version":2},"cited_work":{"arxiv_id":"2502.03919","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.03919","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Blackwell’s approachability with ap- proximation algorithms","venue":null,"work_id":"4578a62c-bb6b-4777-bcd1-8592559d3c5c","year":2025},"citing_paper":{"arxiv_id":"2605.06624","last_updated":"2026-05-08T19:05:03Z","snapshot_observed_at":"2026-07-06T23:19:05.764765Z","submitted_at":"2026-05-07T17:38:36Z","title":"Online Scalarization in Vector-Valued Games","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-12T00:59:04.664288Z"},"links":{"cited_paper":"/paper/2502.03919","citing_paper":"/paper/2605.06624"},"observation_digest":"sha256:ece43a5023d2a91ad728ec45d0e4138300c888b59c8e0ab8566569393cd9f5ea","observation_id":"e2972595-9cf7-4949-92f1-9d7d5255c92b","resolution":{"observed_at":"2026-05-12T08:36:24.052234Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.03919/citation-record","integrity":"/paper/2502.03919/integrity","json":"/paper/2502.03919/citation-record.json","paper":"/paper/2502.03919"},"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-09T00:26:51.764171Z","title":"Blackwell approachability and no-regret learning are equivalent","venue":null,"work_id":"f2b91393-3aa5-4637-9a9a-66051719fa02","year":2011},"citing_paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","snapshot_observed_at":"2026-08-09T00:11:49.079124Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T00:26:51.518942Z"},"links":{"citing_paper":"/paper/2502.03919"},"observation_digest":"sha256:92c2985fa07cabbe1c250a9666eae115c45d74263f6c6c2eb8b9eb5615259552","observation_id":"7811ae33-d7c5-45a3-9f8b-e0a1043bd550","resolution":{"observed_at":"2026-08-09T00:26:51.767881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T00:26:51.752578Z","title":"A linear-time approximation algorithm for the weighted vertex cover problem","venue":null,"work_id":"c7954526-ec4f-419a-abd7-6e376f78587c","year":1981},"citing_paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","snapshot_observed_at":"2026-08-09T00:11:49.079124Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T00:26:51.523285Z"},"links":{"citing_paper":"/paper/2502.03919"},"observation_digest":"sha256:26f0251cdf0b1f02981692756e112bd778a8d200ee024e2e0cb8752f6a6de59d","observation_id":"fd447a1d-0596-4e8a-9db6-3ee4760ddae4","resolution":{"observed_at":"2026-08-09T00:26:51.757003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T00:26:51.741451Z","title":"An analog of the minimax theorem for vector payoffs","venue":null,"work_id":"bf5fd3a2-6294-4c48-bbf8-20ceda25fced","year":1956},"citing_paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","snapshot_observed_at":"2026-08-09T00:11:49.079124Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T00:26:51.526994Z"},"links":{"citing_paper":"/paper/2502.03919"},"observation_digest":"sha256:6647159c6df5ce3a79e728ae00ff4a201c56b8dd095ea1dc597e1d88d79ecc6f","observation_id":"427f2d97-49a3-4a9c-a917-64d9e54c0688","resolution":{"observed_at":"2026-08-09T00:26:51.745504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T00:26:51.530429Z","title":"Convex optimization","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","snapshot_observed_at":"2026-08-09T00:11:49.079124Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T00:26:51.530429Z"},"links":{"citing_paper":"/paper/2502.03919"},"observation_digest":"sha256:e6a2dbace9b5192d770d6f4e3e11d7a2ea51002e6c03d7f624196bcee3e37186","observation_id":"13473743-8e6e-4d42-8ad0-83c844515157","resolution":{"observed_at":"2026-08-09T00:26:51.530429Z","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-09T00:26:51.724522Z","title":"Cam- bridge university press, 2006","venue":null,"work_id":"c89939f3-c355-4701-ac7f-3a622c18cc93","year":2006},"citing_paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","snapshot_observed_at":"2026-08-09T00:11:49.079124Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T00:26:51.534092Z"},"links":{"citing_paper":"/paper/2502.03919"},"observation_digest":"sha256:77f9ece9119caa44f6c866df78f42811f2891f4db5f15102cac8ad178ff05ba6","observation_id":"b818b11c-6310-432d-8524-01b0f63804e4","resolution":{"observed_at":"2026-08-09T00:26:51.728040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T00:26:51.714075Z","title":"Efficient online linear optimization with approximation algo- rithms","venue":null,"work_id":"97751d57-0682-4f06-ad8f-d768b7f851e5","year":2017},"citing_paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","snapshot_observed_at":"2026-08-09T00:11:49.079124Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T00:26:51.537326Z"},"links":{"citing_paper":"/paper/2502.03919"},"observation_digest":"sha256:0cd36181a9a76b0d469ad77d5a2b2cada8eae5a4a8e69aeb916a21c4227475d5","observation_id":"fe4729ee-18db-4c6c-a364-dd614a9ddd81","resolution":{"observed_at":"2026-08-09T00:26:51.717668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"cs/0610119","last_updated":"2006-10-19T22:10:32Z","snapshot_observed_at":"2026-07-07T03:08:49.647098Z","submitted_at":"2006-10-19T22:10:32Z","title":"Approximate Convex Optimization by Online Game Playing","version":1},"cited_work":{"arxiv_id":"cs/0610119","doi":null,"metadata_source":"pith","pith_arxiv_id":"cs/0610119","snapshot_observed_at":"2026-08-09T00:26:51.613070Z","title":"Approximate Convex Optimization by Online Game Playing","venue":"cs.DS","work_id":"e1c32573-7125-489d-a093-e1f18287073a","year":2006},"citing_paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","snapshot_observed_at":"2026-08-09T00:11:49.079124Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T00:26:51.540950Z"},"links":{"cited_paper":"/paper/cs/0610119","citing_paper":"/paper/2502.03919"},"observation_digest":"sha256:1e6861c83d1988496e49ac5a8ff2d8477bce5ecea913a8205d03b39243491647","observation_id":"6cac012e-23c2-4e6a-b08d-a927d2c5aa94","resolution":{"observed_at":"2026-08-09T00:26:51.619248Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T03:42:24.250183Z","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-09T00:26:51.544940Z","title":"Introduction to online convex optimization","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","snapshot_observed_at":"2026-08-09T00:11:49.079124Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T00:26:51.544940Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2502.03919"},"observation_digest":"sha256:9f320c671c91be9659748c0a9db1263423654e7a0bdbf820280cd41aaa975c2b","observation_id":"f77a9955-5b13-4fd6-ac7a-d0a96d12721e","resolution":{"observed_at":"2026-08-09T00:26:51.544940Z","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-09T00:26:51.704471Z","title":"Online improper learning with an approximation oracle","venue":null,"work_id":"4b3da6f7-5298-4a2e-a718-c0f3a85fb264","year":2018},"citing_paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","snapshot_observed_at":"2026-08-09T00:11:49.079124Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T00:26:51.549002Z"},"links":{"citing_paper":"/paper/2502.03919"},"observation_digest":"sha256:88bdae663a5e93743b3d30fa7ff04dfcc1b11da530df50f50fe260fecffb6cc6","observation_id":"9a8ae9f2-f2e1-4251-85ae-82399d48d677","resolution":{"observed_at":"2026-08-09T00:26:51.707876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T00:26:51.692776Z","title":"Playing games with approximation algorithms","venue":null,"work_id":"af278d4d-afbb-49c0-a949-12789d592a4b","year":2007},"citing_paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","snapshot_observed_at":"2026-08-09T00:11:49.079124Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T00:26:51.552538Z"},"links":{"citing_paper":"/paper/2502.03919"},"observation_digest":"sha256:5cf61aa0eec7926bbb0556068f37ce614b2520dae2ff0a4826360d2c382d02d5","observation_id":"e4cd0636-a553-4846-b05d-bfa8479d683b","resolution":{"observed_at":"2026-08-09T00:26:51.696791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T00:26:51.680360Z","title":"Game theory","venue":null,"work_id":"cc819ea4-b69a-4d7e-bfad-3275b8c51410","year":2020},"citing_paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","snapshot_observed_at":"2026-08-09T00:11:49.079124Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T00:26:51.555953Z"},"links":{"citing_paper":"/paper/2502.03919"},"observation_digest":"sha256:58b9a14436c54ab20e4092416198b840139d8848f3d4f002cdf7c19f3d9e3dd0","observation_id":"7443049e-4d00-4f12-9887-a5d2b67dbbde","resolution":{"observed_at":"2026-08-09T00:26:51.683780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T00:26:51.667317Z","title":"Approachability, regret and calibration: Implications and equivalences","venue":null,"work_id":"bf9d1fda-c0e5-49fb-b9d2-64e57897365f","year":2014},"citing_paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","snapshot_observed_at":"2026-08-09T00:11:49.079124Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T00:26:51.559541Z"},"links":{"citing_paper":"/paper/2502.03919"},"observation_digest":"sha256:6dcaa040b090c9ae31a6b2dc34f30e6a876d5dea279b8a985e9ba96c23ac5ffb","observation_id":"672abd72-49e6-48e5-a34d-6e40470089ce","resolution":{"observed_at":"2026-08-09T00:26:51.671966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T00:26:51.654214Z","title":"An online convex optimization approach to blackwell’s ap- proachability","venue":null,"work_id":"05d3b3a2-707c-4ca8-8f44-457cde7f8392","year":2016},"citing_paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","snapshot_observed_at":"2026-08-09T00:11:49.079124Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T00:26:51.563255Z"},"links":{"citing_paper":"/paper/2502.03919"},"observation_digest":"sha256:a672fe67233f88823794c21825ea2bb32f13c42f9e21fb3631e552eea089eb16","observation_id":"f9308901-e81f-41e1-8a0c-30099e025f96","resolution":{"observed_at":"2026-08-09T00:26:51.658385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T00:26:51.640405Z","title":"ℓ nX j=1 xjej, mX k=1 ykek !# i =","venue":null,"work_id":"a76070a4-9493-4811-b5eb-aeba02ab08f9","year":2003},"citing_paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","snapshot_observed_at":"2026-08-09T00:11:49.079124Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T00:26:51.566933Z"},"links":{"citing_paper":"/paper/2502.03919"},"observation_digest":"sha256:6ef0418f5ee023a44c020e20c32e455f337f7b8a848525741d4a7695f6734edd","observation_id":"aafb47d3-0051-4950-9c55-318e83d06c6b","resolution":{"observed_at":"2026-08-09T00:26:51.644845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T00:26:51.627632Z","title":"22 Proof","venue":null,"work_id":"f2f5f3d4-7377-4c74-bd32-e48861d1ed36","year":null},"citing_paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","snapshot_observed_at":"2026-08-09T00:11:49.079124Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T00:26:51.570509Z"},"links":{"citing_paper":"/paper/2502.03919"},"observation_digest":"sha256:ff46f54175e2920dc81c8f4c20e00a7062a5433ac177d81dc409700f23d071b0","observation_id":"f42086c5-b0cc-4655-83ac-564fc4ddfca9","resolution":{"observed_at":"2026-08-09T00:26:51.631578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.03919","last_updated":"2025-06-15T15:19:49Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T00:11:49.079124Z","submitted_at":"2025-02-06T09:54:00Z","title":"Blackwell's Approachability with Approximation Algorithms"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":12},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 2 inbound Pith citation observations for arXiv:2502.03919."}