{"as_of":"2026-08-07T12:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b6ded12bc15736103dccb041e4d31540e837fe5054719a06b370290662de8640","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T06:28:52.145933Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2601.22969/citation-record","integrity":"/paper/2601.22969/integrity","json":"/paper/2601.22969/citation-record.json","paper":"/paper/2601.22969"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T06:28:51.708562Z","title":"W orks on Nash RegretBarman et al","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.22969","last_updated":"2026-06-21T21:38:50Z","snapshot_observed_at":"2026-08-06T21:58:21.119178Z","submitted_at":"2026-01-30T13:32:37Z","title":"Improved Algorithms for Nash Welfare in Linear Bandits","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T06:28:51.708562Z"},"links":{"citing_paper":"/paper/2601.22969"},"observation_digest":"sha256:ea5319c03cb1cb2eda5a6f67fb76097801cda40cb223d837ab41b3c95cfb7313","observation_id":"5b2aed1f-0312-4960-8262-00a55cf423ec","resolution":{"observed_at":"2026-08-03T06:28:51.708562Z","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-03T06:28:52.107073Z","title":"Given the collection of arm vectors, this computation can be carried out efficiently (see Chapter 3 of Todd (2016))","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2601.22969","last_updated":"2026-06-21T21:38:50Z","snapshot_observed_at":"2026-08-06T21:58:21.119178Z","submitted_at":"2026-01-30T13:32:37Z","title":"Improved Algorithms for Nash Welfare in Linear Bandits","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T06:28:52.107073Z"},"links":{"citing_paper":"/paper/2601.22969"},"observation_digest":"sha256:07521f84dd3bbed3278b333d3e017fc80665b8f0068ebe86b352165c64c7ca89","observation_id":"c918086a-06a4-437c-9177-2f73128e2fb1","resolution":{"observed_at":"2026-08-03T06:28:52.107073Z","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-03T06:28:52.145933Z","title":"ForLinUCB(Algorithm 3), each iteration requires O(d2) time for Line 3 and O(|X |) time for Line 4, leading to an overall complexity of O(T d2 + T|X |)","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2601.22969","last_updated":"2026-06-21T21:38:50Z","snapshot_observed_at":"2026-08-06T21:58:21.119178Z","submitted_at":"2026-01-30T13:32:37Z","title":"Improved Algorithms for Nash Welfare in Linear Bandits","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T06:28:52.145933Z"},"links":{"citing_paper":"/paper/2601.22969"},"observation_digest":"sha256:9ead0ad77bb9d57e079f8b123daa49ca1a65c4fd03dfc3d56982b1c112aeed33","observation_id":"b7291213-1832-4f71-bb17-3ba97bf0bfa0","resolution":{"observed_at":"2026-08-03T06:28:52.145933Z","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-03T06:28:51.751898Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.22969","last_updated":"2026-06-21T21:38:50Z","snapshot_observed_at":"2026-08-06T21:58:21.119178Z","submitted_at":"2026-01-30T13:32:37Z","title":"Improved Algorithms for Nash Welfare in Linear Bandits","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T06:28:51.751898Z"},"links":{"citing_paper":"/paper/2601.22969"},"observation_digest":"sha256:4a6bda5cf1e3eacc59762080d19980319e551dcf71096f44878ef0802d96605b","observation_id":"73141942-5372-42c7-a403-49226369005d","resolution":{"observed_at":"2026-08-03T06:28:51.751898Z","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-03T06:28:51.816973Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.22969","last_updated":"2026-06-21T21:38:50Z","snapshot_observed_at":"2026-08-06T21:58:21.119178Z","submitted_at":"2026-01-30T13:32:37Z","title":"Improved Algorithms for Nash Welfare in Linear Bandits","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T06:28:51.816973Z"},"links":{"citing_paper":"/paper/2601.22969"},"observation_digest":"sha256:62b81a67c5e8f47af63d3bcdb1fa91400ea76f90c6fd286934bbe3908452ef7d","observation_id":"52658a83-ddd3-444c-acf5-22264a0e1444","resolution":{"observed_at":"2026-08-03T06:28:51.816973Z","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-03T06:28:51.882311Z","title":"1For a convex body K⊂R d, its John ellipsoid Gr¨ otschel et al","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2601.22969","last_updated":"2026-06-21T21:38:50Z","snapshot_observed_at":"2026-08-06T21:58:21.119178Z","submitted_at":"2026-01-30T13:32:37Z","title":"Improved Algorithms for Nash Welfare in Linear Bandits","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T06:28:51.882311Z"},"links":{"citing_paper":"/paper/2601.22969"},"observation_digest":"sha256:7ce08d401a0325b9e9bae4a4689bf6a7fabded005a5d15680337937243d6be03","observation_id":"fc1dd6ce-7ea0-4c46-809f-d4a1e83e0b9b","resolution":{"observed_at":"2026-08-03T06:28:51.882311Z","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-03T06:28:51.952184Z","title":"Lemma B.12(Abbasi-Yadkori et al","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.22969","last_updated":"2026-06-21T21:38:50Z","snapshot_observed_at":"2026-08-06T21:58:21.119178Z","submitted_at":"2026-01-30T13:32:37Z","title":"Improved Algorithms for Nash Welfare in Linear Bandits","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T06:28:51.952184Z"},"links":{"citing_paper":"/paper/2601.22969"},"observation_digest":"sha256:76cf9d89d4f7fb8b8be24521f788db7455f048f286915694d591d71d571fc535","observation_id":"cc8b49b8-49f2-4c56-b78c-3adab1b26afc","resolution":{"observed_at":"2026-08-03T06:28:51.952184Z","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-03T06:28:52.033994Z","title":"This implicitly assumes that T > d(d + 1), which is reasonable given that even the minimax optimal rates of O( d√ T ) are vacuous forT= Ω(d 2)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.22969","last_updated":"2026-06-21T21:38:50Z","snapshot_observed_at":"2026-08-06T21:58:21.119178Z","submitted_at":"2026-01-30T13:32:37Z","title":"Improved Algorithms for Nash Welfare in Linear Bandits","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T06:28:52.033994Z"},"links":{"citing_paper":"/paper/2601.22969"},"observation_digest":"sha256:5159016bc2ff3161419576b22158fa737cbfffc5e8b449ec22cb28fbbc82b999","observation_id":"343b6738-b78d-4ecb-8c79-0da7a473be3f","resolution":{"observed_at":"2026-08-03T06:28:52.033994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.10199","last_updated":"2022-04-28T23:02:55Z","snapshot_observed_at":"2026-07-06T12:20:25.545814Z","submitted_at":"2021-12-19T17:16:03Z","title":"Tractable Fragments of the Maximum Nash Welfare Problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.10199","snapshot_observed_at":"2026-08-03T06:28:51.466698Z","title":"Tractable fragments of the maximum nash welfare problem.arXiv preprint arXiv:2112.10199,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.22969","last_updated":"2026-06-21T21:38:50Z","snapshot_observed_at":"2026-08-06T21:58:21.119178Z","submitted_at":"2026-01-30T13:32:37Z","title":"Improved Algorithms for Nash Welfare in Linear Bandits","version":2},"reference_index":1993,"source":"pdf_text","source_observed_at":"2026-08-03T06:28:51.466698Z"},"links":{"cited_paper":"/paper/2112.10199","citing_paper":"/paper/2601.22969"},"observation_digest":"sha256:cb47845248057319b12a942ee0f9835f199336cb6a6bd2de0a16c6e077000888","observation_id":"88a151be-3274-486f-9f3a-e74e68551a0f","resolution":{"observed_at":"2026-08-03T06:28:51.466698Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.07370","last_updated":"2020-07-05T14:24:21Z","snapshot_observed_at":"2026-07-06T09:20:31.791558Z","submitted_at":"2020-05-15T05:57:26Z","title":"Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.07370","snapshot_observed_at":"2026-08-03T06:28:51.393882Z","title":"Tight approximation algorithms for p-mean welfare under subadditive valuations.arXiv preprint arXiv:2005.07370,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2601.22969","last_updated":"2026-06-21T21:38:50Z","snapshot_observed_at":"2026-08-06T21:58:21.119178Z","submitted_at":"2026-01-30T13:32:37Z","title":"Improved Algorithms for Nash Welfare in Linear Bandits","version":2},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-03T06:28:51.393882Z"},"links":{"cited_paper":"/paper/2005.07370","citing_paper":"/paper/2601.22969"},"observation_digest":"sha256:bc54a980ebd8033e5c63a0d5e5017e072202539d5029f5770879bf2802e122ef","observation_id":"3b0012d7-579c-4a74-ac26-8eed60c646a9","resolution":{"observed_at":"2026-08-03T06:28:51.393882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1306.2597","last_updated":"2013-06-09T09:58:00Z","snapshot_observed_at":"2026-07-06T03:15:36.962567Z","submitted_at":"2013-06-09T09:58:00Z","title":"Introducing LETOR 4.0 Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1306.2597","snapshot_observed_at":"2026-08-03T06:28:51.518661Z","title":"Introducing letor 4.0 datasets.arXiv preprint arXiv:1306.2597,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.22969","last_updated":"2026-06-21T21:38:50Z","snapshot_observed_at":"2026-08-06T21:58:21.119178Z","submitted_at":"2026-01-30T13:32:37Z","title":"Improved Algorithms for Nash Welfare in Linear Bandits","version":2},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-03T06:28:51.518661Z"},"links":{"cited_paper":"/paper/1306.2597","citing_paper":"/paper/2601.22969"},"observation_digest":"sha256:217ab411ea27df65f1507e31e973e4065eb529d986a29c4502c8718d9b15361e","observation_id":"620fda4f-67aa-456c-a40f-e07d7c0f5d95","resolution":{"observed_at":"2026-08-03T06:28:51.518661Z","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-03T06:28:51.425830Z","title":"On the fairness of normalized p-means for allocating goods and chores.arXiv preprint arXiv:2402.14996,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.22969","last_updated":"2026-06-21T21:38:50Z","snapshot_observed_at":"2026-08-06T21:58:21.119178Z","submitted_at":"2026-01-30T13:32:37Z","title":"Improved Algorithms for Nash Welfare in Linear Bandits","version":2},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-03T06:28:51.425830Z"},"links":{"citing_paper":"/paper/2601.22969"},"observation_digest":"sha256:2dea64ad064a868207fc952aacc6c98c7fef6bbfb920019ab4e60732fba5ffa7","observation_id":"9def765f-8fb9-49cf-886e-494bff0abee6","resolution":{"observed_at":"2026-08-03T06:28:51.425830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.03836","last_updated":"2025-08-05T18:34:00Z","snapshot_observed_at":"2026-08-06T21:57:44.851803Z","submitted_at":"2025-08-05T18:34:00Z","title":"DP-NCB: Privacy Preserving Fair Bandits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.03836","snapshot_observed_at":"2026-08-03T06:28:51.599150Z","title":"Dp-ncb: Privacy preserving fair bandits.arXiv preprint arXiv:2508.03836, 2025a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.22969","last_updated":"2026-06-21T21:38:50Z","snapshot_observed_at":"2026-08-06T21:58:21.119178Z","submitted_at":"2026-01-30T13:32:37Z","title":"Improved Algorithms for Nash Welfare in Linear Bandits","version":2},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-03T06:28:51.599150Z"},"links":{"cited_paper":"/paper/2508.03836","citing_paper":"/paper/2601.22969"},"observation_digest":"sha256:d4bc19c4a3ea7d7278fe722d8f4c4c461a50e03df6141da316a07bab83ceeef5","observation_id":"bbce3b96-9dfc-4877-bb22-cce493469936","resolution":{"observed_at":"2026-08-03T06:28:51.599150Z","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-03T06:28:51.654531Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2601.22969","last_updated":"2026-06-21T21:38:50Z","snapshot_observed_at":"2026-08-06T21:58:21.119178Z","submitted_at":"2026-01-30T13:32:37Z","title":"Improved Algorithms for Nash Welfare in Linear Bandits","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-03T06:28:51.654531Z"},"links":{"citing_paper":"/paper/2601.22969"},"observation_digest":"sha256:e2cff955b2065b95ded431cde7972fe8c47da942ad5b3fcb368dd9cfe2027b81","observation_id":"921cc236-1836-41a9-812b-925d11ed5197","resolution":{"observed_at":"2026-08-03T06:28:51.654531Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.22969","last_updated":"2026-06-21T21:38:50Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T21:58:21.119178Z","submitted_at":"2026-01-30T13:32:37Z","title":"Improved Algorithms for Nash Welfare in Linear Bandits"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":14},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2601.22969."}