{"as_of":"2026-08-18T18:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bfa7c176a8d1512f7d1600cf9d7cf38e09b94244f640780b170d781cf200edc0","coverage":[{"denominator":76,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":76,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:57:41.424159Z","state":"measured"},{"denominator":77,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":77,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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-06T11:22:57.856397Z","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-06T11:22:57.926875Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"cited_work":{"arxiv_id":"2507.04438","doi":null,"metadata_source":"pith","pith_arxiv_id":"2507.04438","snapshot_observed_at":"2026-08-06T11:22:57.926875Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","venue":"quant-ph","work_id":"e39e4709-a3cd-40c5-8b08-749897b4d802","year":2025},"citing_paper":{"arxiv_id":"2507.22854","last_updated":"2026-07-16T17:57:33Z","snapshot_observed_at":"2026-08-16T17:42:05.729524Z","submitted_at":"2025-07-30T17:24:23Z","title":"A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T11:22:57.856397Z"},"links":{"cited_paper":"/paper/2507.04438","citing_paper":"/paper/2507.22854"},"observation_digest":"sha256:ca067ad75043803c5f0c26ca190f135e86a6cd20b5752586bb9e50abae751975","observation_id":"87020556-fd2f-4104-b40c-d19aa609a1d4","resolution":{"observed_at":"2026-08-06T11:22:57.934217Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.04438/citation-record","integrity":"/paper/2507.04438/integrity","json":"/paper/2507.04438/citation-record.json","paper":"/paper/2507.04438"},"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-06T19:57:49.445633Z","title":"Egger, Bruce G","venue":null,"work_id":"4dce05b1-a10d-4886-bd61-b9216e0e2951","year":2024},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:36.154637Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:9d194dc67ca04fbc7fa66fcf93607ec3358f2d3072e924e86f7be50a34368e41","observation_id":"b50434a5-1e5a-489f-b484-5d373aad2348","resolution":{"observed_at":"2026-08-06T19:57:49.518333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0911.2974","last_updated":"2014-04-09T03:44:37Z","snapshot_observed_at":"2026-08-15T05:33:49.068862Z","submitted_at":"2009-11-16T16:39:33Z","title":"A Dynamic Near-Optimal Algorithm for Online Linear Programming","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0911.2974","snapshot_observed_at":"2026-08-06T19:57:36.251061Z","title":"4, 876–890, arXiv: 0911.2974","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:36.251061Z"},"links":{"cited_paper":"/paper/0911.2974","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:355ef6a4866fb11b699511e95c243118e8a513db696aa350efdfef64be755ec1","observation_id":"aead1176-b91a-4540-bd36-5979a1a1a2b7","resolution":{"observed_at":"2026-08-06T19:57:36.251061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.16349","last_updated":"2024-10-20T04:13:13Z","snapshot_observed_at":"2026-08-18T06:46:21.822351Z","submitted_at":"2024-04-25T05:59:44Z","title":"More Asymmetry Yields Faster Matrix Multiplication","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.16349","snapshot_observed_at":"2026-08-06T19:57:36.301419Z","title":"2005–2039, SIAM, 2025, arXiv: 2404.16349","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:36.301419Z"},"links":{"cited_paper":"/paper/2404.16349","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:38257f40107187f55095c52944f7032f20bdf7f551869e06d11b037169b2a6ea","observation_id":"cb57f87b-88ae-447f-94fb-0a1226845234","resolution":{"observed_at":"2026-08-06T19:57:36.301419Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.05058","last_updated":"2018-04-13T17:57:42Z","snapshot_observed_at":"2026-08-17T10:48:57.346344Z","submitted_at":"2018-04-13T17:57:42Z","title":"Improvements in Quantum SDP-Solving with Applications","version":1},"cited_work":{"arxiv_id":"1804.05058","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.05058","snapshot_observed_at":"2026-08-06T19:57:44.417927Z","title":"Improvements in Quantum SDP-Solving with Applications","venue":"quant-ph","work_id":"0cae2c35-7a60-46e2-ae84-0231f36b506c","year":2018},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:36.366355Z"},"links":{"cited_paper":"/paper/1804.05058","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:c30ca13a74db93171f48f8fdbfd0db1266601c256a3b4624926b678f6cb60879","observation_id":"7d6c33e5-4166-4ceb-a1a3-611c52d5e3d3","resolution":{"observed_at":"2026-08-06T19:57:44.461735Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.03180","last_updated":"2019-04-05T17:58:44Z","snapshot_observed_at":"2026-08-14T16:51:01.754746Z","submitted_at":"2019-04-05T17:58:44Z","title":"Quantum algorithms for zero-sum games","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.03180","snapshot_observed_at":"2026-08-06T19:57:36.395726Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:36.395726Z"},"links":{"cited_paper":"/paper/1904.03180","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:329dae6c3b3d8b0592359b4e61e29a66ac91e34fd0f86687b5778ae8ed4d33d4","observation_id":"363ae98f-84cb-419f-a25b-cf97dd33a24a","resolution":{"observed_at":"2026-08-06T19:57:36.395726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.01843","last_updated":"2020-02-12T19:18:46Z","snapshot_observed_at":"2026-08-16T10:13:14.170829Z","submitted_at":"2017-05-04T13:59:43Z","title":"Quantum SDP-Solvers: Better upper and lower bounds","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.01843","snapshot_observed_at":"2026-08-06T19:57:36.441497Z","title":"403–414, IEEE, 2017, arXiv: 1705.01843","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:36.441497Z"},"links":{"cited_paper":"/paper/1705.01843","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:87494592d06a20e077e4cdc1e2c82e8e9c06c81de26de72aacfdf73e39787d91","observation_id":"368a4336-d2e6-41b9-b816-862869efbedd","resolution":{"observed_at":"2026-08-06T19:57:36.441497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.00643","last_updated":"2019-12-20T17:14:21Z","snapshot_observed_at":"2026-08-15T11:10:55.270658Z","submitted_at":"2018-09-03T16:30:24Z","title":"Convex optimization using quantum oracles","version":4},"cited_work":{"arxiv_id":"1809.00643","doi":null,"metadata_source":"pith","pith_arxiv_id":"1809.00643","snapshot_observed_at":"2026-08-06T19:57:44.269662Z","title":"Convex optimization using quantum oracles","venue":"quant-ph","work_id":"d011585f-cd2c-4984-bfce-fc4a0289445b","year":2018},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:36.499364Z"},"links":{"cited_paper":"/paper/1809.00643","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:dcb973c79db892308db70c8db822d6cf2625592fa18411b6cb844aeef16daeb1","observation_id":"eaf6fed4-ad20-4b5b-bf1e-50d19dec9e63","resolution":{"observed_at":"2026-08-06T19:57:44.305651Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:49.374758Z","title":"Schapire, The nonstochastic multiarmed bandit problem, SIAM Journal on Computing 32 (2002), no","venue":null,"work_id":"e65e2c80-9110-49af-a776-bd9bf6394451","year":2002},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:36.584383Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:d63c42940065f7e2ce46fa48e36e743cbb6790ce560a0425093413863c4f054e","observation_id":"07562579-caff-4959-813d-12b689044aec","resolution":{"observed_at":"2026-08-06T19:57:49.403375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.17356","last_updated":"2025-06-04T15:55:57Z","snapshot_observed_at":"2026-08-16T12:47:51.811659Z","submitted_at":"2025-03-21T17:58:12Z","title":"Fast Convex Optimization with Quantum Gradient Methods","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.17356","snapshot_observed_at":"2026-08-06T19:57:36.729482Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:36.729482Z"},"links":{"cited_paper":"/paper/2503.17356","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:17621fe8add7c8cd977be18a4e4b9a549b5c311d81c8eaf71d8839dcfd3b01a8","observation_id":"699bf608-cbd1-4cf1-937b-4dba32210c4e","resolution":{"observed_at":"2026-08-06T19:57:36.729482Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.03977","last_updated":"2024-10-16T12:11:03Z","snapshot_observed_at":"2026-08-16T14:45:18.109925Z","submitted_at":"2023-11-07T13:26:20Z","title":"A quantum central path algorithm for linear optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.03977","snapshot_observed_at":"2026-08-06T19:57:36.875885Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:36.875885Z"},"links":{"cited_paper":"/paper/2311.03977","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:0c19544bb4f5d0cf39e8bf2f5f20941375750442814bce332073ca7958feff43","observation_id":"642124cf-93f1-4751-b970-3a4440b17d37","resolution":{"observed_at":"2026-08-06T19:57:36.875885Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.06025","last_updated":"2023-09-07T21:15:31Z","snapshot_observed_at":"2026-08-16T17:35:24.806023Z","submitted_at":"2021-12-11T16:52:25Z","title":"Quantum Interior Point Methods for Semidefinite Optimization","version":3},"cited_work":{"arxiv_id":"2112.06025","doi":null,"metadata_source":"pith","pith_arxiv_id":"2112.06025","snapshot_observed_at":"2026-08-06T19:57:44.129024Z","title":"Quantum Interior Point Methods for Semidefinite Optimization","venue":"quant-ph","work_id":"15b76317-d1a2-4d85-821d-9cff984111c3","year":2021},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:36.989851Z"},"links":{"cited_paper":"/paper/2112.06025","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:d39edc2e37503dc7bf2acbdfbf903ac04d44a175e4c79f028875a45eec3ce4a4","observation_id":"726a1259-e5f7-4e70-87f8-475ea116b13b","resolution":{"observed_at":"2026-08-06T19:57:44.167326Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1305.2545","last_updated":"2017-09-05T14:00:33Z","snapshot_observed_at":"2026-08-15T00:18:11.044048Z","submitted_at":"2013-05-11T21:50:46Z","title":"Bandits with Knapsacks","version":8},"cited_work":{"arxiv_id":"1305.2545","doi":null,"metadata_source":"pith","pith_arxiv_id":"1305.2545","snapshot_observed_at":"2026-08-06T19:57:44.050637Z","title":"Bandits with Knapsacks","venue":"cs.DS","work_id":"c48ac629-f477-4a43-8f05-fd6f75a7162c","year":2013},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:37.122133Z"},"links":{"cited_paper":"/paper/1305.2545","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:54a24255d15588009e9362633fae0c9a6477ae6e8f4a8764fd5afd99a8f7e1a3","observation_id":"cb0ff5ab-43ba-43fe-8cc0-960f249207de","resolution":{"observed_at":"2026-08-06T19:57:44.092966Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:49.279850Z","title":"1, 80–90","venue":null,"work_id":"0378d693-35d2-4ddd-bd7d-4851029958a4","year":2000},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:37.274853Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:9c5a91b1458ce70c5ea431dbf7191f7b3e82dfe53023354e8d69a245a00e43f5","observation_id":"120be4e4-6211-420c-bf20-f51026067f9f","resolution":{"observed_at":"2026-08-06T19:57:49.323686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:49.118945Z","title":"6, 1537–1550","venue":null,"work_id":"0eeae688-6f9a-43de-9092-9cf80ec3c602","year":2012},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:37.408206Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:07b7fd9eb43dc0f7e810109850e875c6f687a400df76c61ba9bf0a615dce9d2c","observation_id":"20493e5b-e624-4840-8aa1-87911a58ca39","resolution":{"observed_at":"2026-08-06T19:57:49.197211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:49.009815Z","title":"Borkar and Sean P","venue":null,"work_id":"f6a7da02-4de9-4ae8-992f-3844d3640dcb","year":2002},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:37.567896Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:3f7b4bea422cd0f1a4deb8480e7e555839cae8831afa8c78e085e7f0e5a10bb7","observation_id":"7419499d-400c-4418-9ef9-19e9b6a77577","resolution":{"observed_at":"2026-08-06T19:57:49.061013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.03763","last_updated":"2023-01-10T02:56:49Z","snapshot_observed_at":"2026-08-16T16:03:27.172561Z","submitted_at":"2023-01-10T02:56:49Z","title":"Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling","version":1},"cited_work":{"arxiv_id":"2301.03763","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.03763","snapshot_observed_at":"2026-08-06T19:57:43.971048Z","title":"Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling","venue":"quant-ph","work_id":"da66a087-9feb-437c-a7d2-39adf9b653ae","year":2023},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:37.684124Z"},"links":{"cited_paper":"/paper/2301.03763","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:5f9454f48ec692b09769924bf72233460fc3fbc0cebee980b543770fb1812480","observation_id":"33c3fc9f-1c35-4315-960e-1f0142165929","resolution":{"observed_at":"2026-08-06T19:57:43.991458Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:48.918702Z","title":"Boyd and Lieven Vandenberghe, Convex optimization , Cambridge University Press, 2004","venue":null,"work_id":"e4ca0755-8297-4c9b-912c-390e8fff8ef0","year":2004},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:37.716614Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:e9f5c0464c89e6833ad7afa7c1f2a97c9f6fc4bccebf51536044c56324c34b9a","observation_id":"880afff6-a802-440b-8e42-bc34575da4be","resolution":{"observed_at":"2026-08-06T19:57:48.962047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05719","last_updated":"2021-08-22T01:26:24Z","snapshot_observed_at":"2026-08-16T18:52:17.200201Z","submitted_at":"2021-01-14T16:50:13Z","title":"Minimum Cost Flows, MDPs, and $\\ell_1$-Regression in Nearly Linear Time for Dense Instances","version":2},"cited_work":{"arxiv_id":"2101.05719","doi":null,"metadata_source":"pith","pith_arxiv_id":"2101.05719","snapshot_observed_at":"2026-08-06T19:57:43.856348Z","title":"Minimum Cost Flows, MDPs, and $\\ell_1$-Regression in Nearly Linear Time for Dense Instances","venue":"cs.DS","work_id":"81d8f1d5-58c6-421d-bba0-3bf873ca0fe2","year":2021},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:37.762790Z"},"links":{"cited_paper":"/paper/2101.05719","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:3abee82d6736d23dda5d3d12ea7ab173e7c51e0b6fad21d593dc0337b5c6bbd8","observation_id":"0696eb8a-29dd-4ab3-8adb-5a626ee15282","resolution":{"observed_at":"2026-08-06T19:57:43.914073Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.02581","last_updated":"2019-04-22T21:40:35Z","snapshot_observed_at":"2026-08-18T07:16:24.337535Z","submitted_at":"2017-10-06T20:43:14Z","title":"Quantum SDP Solvers: Large Speed-ups, Optimality, and Applications to Quantum Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.02581","snapshot_observed_at":"2026-08-06T19:57:37.808261Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:37.808261Z"},"links":{"cited_paper":"/paper/1710.02581","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:a4baec6ab1606eb9c866d53d40e96e15fdb000f118f78f663e4ce45e2ffa610f","observation_id":"566b3d9f-7eb3-4d6f-966d-5aa6217d6578","resolution":{"observed_at":"2026-08-06T19:57:37.808261Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.05537","last_updated":"2017-09-24T02:03:23Z","snapshot_observed_at":"2026-08-14T21:39:18.902637Z","submitted_at":"2016-09-18T20:13:50Z","title":"Quantum Speed-ups for Semidefinite Programming","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.05537","snapshot_observed_at":"2026-08-06T19:57:37.853949Z","title":"Brand˜ ao and Krysta Svore, Quantum speed-ups for semidefinite programming , Pro- ceedings of the 58th Annual Symposium on Foundations of Computer Science, pp","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:37.853949Z"},"links":{"cited_paper":"/paper/1609.05537","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:5d7b381ceaa743723362e9c6a01f14a43ea28a15f8f0ed85760b56f3e998a288","observation_id":"602d7ebc-f86c-441b-9a98-6c0894387f2f","resolution":{"observed_at":"2026-08-06T19:57:37.853949Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0005055","last_updated":"2000-05-15T18:19:59Z","snapshot_observed_at":"2026-07-07T07:03:25.387553Z","submitted_at":"2000-05-15T18:19:59Z","title":"Quantum Amplitude Amplification and Estimation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0005055","snapshot_observed_at":"2026-08-06T19:57:37.903265Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:37.903265Z"},"links":{"cited_paper":"/paper/quant-ph/0005055","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:e9532a878bf271abdeff4f14e1a1fb6d6258e976fc1f50c484830dcbfd92a08f","observation_id":"fe7baeaf-9487-4a7a-aa76-691c1eec0fb5","resolution":{"observed_at":"2026-08-06T19:57:37.903265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.01731","last_updated":"2019-12-18T06:07:23Z","snapshot_observed_at":"2026-08-14T18:33:16.258186Z","submitted_at":"2018-09-04T14:05:38Z","title":"Quantum algorithms and lower bounds for convex optimization","version":3},"cited_work":{"arxiv_id":"1809.01731","doi":null,"metadata_source":"pith","pith_arxiv_id":"1809.01731","snapshot_observed_at":"2026-08-06T19:57:43.706804Z","title":"Quantum algorithms and lower bounds for convex optimization","venue":"quant-ph","work_id":"11bf1787-dd67-4179-b26c-9b6417228ff2","year":2018},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:37.959201Z"},"links":{"cited_paper":"/paper/1809.01731","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:366aa163009ec231108a4cded870985664ef7359d66954d03e6f1afe52f3d4a2","observation_id":"8324d44d-4eae-452a-9e92-a0aa89568a9c","resolution":{"observed_at":"2026-08-06T19:57:43.739225Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.15587","last_updated":"2025-03-09T02:15:43Z","snapshot_observed_at":"2026-08-16T14:40:11.165773Z","submitted_at":"2023-11-27T07:25:47Z","title":"Quantum Langevin Dynamics for Optimization","version":3},"cited_work":{"arxiv_id":"2311.15587","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.15587","snapshot_observed_at":"2026-08-06T19:57:43.561838Z","title":"Quantum Langevin Dynamics for Optimization","venue":"quant-ph","work_id":"fd97d03d-4007-4784-afc2-5b6cd908593f","year":2023},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:37.997731Z"},"links":{"cited_paper":"/paper/2311.15587","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:126b11ffaf4a884c0b2fa8978812ef4088a027dc3563dd71df2080771a85cb6c","observation_id":"af7eb1e4-b995-428e-a3dd-58365c5a57f2","resolution":{"observed_at":"2026-08-06T19:57:43.630305Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.07896","last_updated":"2020-10-20T02:38:41Z","snapshot_observed_at":"2026-08-14T18:12:52.107743Z","submitted_at":"2018-10-18T04:37:51Z","title":"Solving Linear Programs in the Current Matrix Multiplication Time","version":3},"cited_work":{"arxiv_id":"1810.07896","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.07896","snapshot_observed_at":"2026-08-06T19:57:43.431943Z","title":"Solving Linear Programs in the Current Matrix Multiplication Time","venue":"cs.DS","work_id":"a880435b-61cb-4377-b565-dfb66de4a710","year":2018},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.034788Z"},"links":{"cited_paper":"/paper/1810.07896","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:bbd52d31eaf8554a54fae5d2ee8c6c2a107a3f88a9a38550702ef86537ac2a04","observation_id":"e0aa1d8f-700d-40ab-ad32-9a8166f09574","resolution":{"observed_at":"2026-08-06T19:57:43.505172Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.09787","last_updated":"2022-07-19T12:42:50Z","snapshot_observed_at":"2026-08-16T17:40:52.840893Z","submitted_at":"2021-11-18T16:35:32Z","title":"Near-Optimal Quantum Algorithms for Multivariate Mean Estimation","version":2},"cited_work":{"arxiv_id":"2111.09787","doi":null,"metadata_source":"pith","pith_arxiv_id":"2111.09787","snapshot_observed_at":"2026-08-06T19:57:43.339906Z","title":"Near-Optimal Quantum Algorithms for Multivariate Mean Estimation","venue":"quant-ph","work_id":"3fc27e92-df7b-42d6-a3ff-570b5f8d75ec","year":2021},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.074839Z"},"links":{"cited_paper":"/paper/2111.09787","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:a572bef3d119a19932396c4d70ac0607290d643b16cfbeeb57deabda4851e591","observation_id":"ef862e27-8914-4d58-b85f-2a7442031f89","resolution":{"observed_at":"2026-08-06T19:57:43.359849Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05373","last_updated":"2023-10-09T03:10:42Z","snapshot_observed_at":"2026-08-18T16:41:16.290931Z","submitted_at":"2023-10-09T03:10:42Z","title":"Quantum Bayesian Optimization","version":1},"cited_work":{"arxiv_id":"2310.05373","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.05373","snapshot_observed_at":"2026-08-06T19:57:43.180338Z","title":"Quantum Bayesian Optimization","venue":"cs.LG","work_id":"a56ae1ae-86cd-4c62-8a6b-a8411fa16f0a","year":2023},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.115498Z"},"links":{"cited_paper":"/paper/2310.05373","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:5f0ed8bfbb92dfc79fb721c3756064b1d8f540f1f6b907e89bc108e99cc41759","observation_id":"e720fe25-027c-45e2-b7c8-f3d6e0bf0b83","resolution":{"observed_at":"2026-08-06T19:57:43.279714Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:48.772462Z","title":"Dantzig and Mukund N","venue":null,"work_id":"49411adb-2342-49a6-8722-fba42dc75a00","year":1997},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.153806Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:3bd486dfef0d34702be07eb6cf571794a270932ffe4ae0d3f7f08728dfc0272f","observation_id":"4e430bb2-99a6-4e24-a458-55cff99ecabd","resolution":{"observed_at":"2026-08-06T19:57:48.830416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:48.565075Z","title":"Briegel, Machine learning & artificial intelligence in the quantum domain: a review of recent progress, Reports on Progress in Physics 81 (2018), no","venue":null,"work_id":"bbb8e623-bd25-47fa-8e67-8e8338f9ce4f","year":2018},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.194774Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:bd9e0b384626d4365389b6bb429a84e2bff54491b5e77ad848e8db2d7598354f","observation_id":"8036f4d6-34e7-4b67-abd7-e98a3c604085","resolution":{"observed_at":"2026-08-06T19:57:48.661263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:48.409707Z","title":"6, 1586–1602","venue":null,"work_id":"37dc2693-4cc3-46e2-a05f-3768a2955e0c","year":2018},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.239833Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:66816e74150f1f1358bdcd401d89145b277af4a7ef3c158604291dbdf4a2f337","observation_id":"3bdda9b6-fb21-4c25-880c-f4c9f6eaba25","resolution":{"observed_at":"2026-08-06T19:57:48.482321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:48.258050Z","title":"Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, Journal of Computer and System Sciences 55 (1997), no","venue":null,"work_id":"822d24d5-d188-4c7d-bfa7-f47112fb3c62","year":1997},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.284528Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:ed8b14fbc699af2559e07f4e2f86df53716c95b7beb745fbb0c3ef623e2798dd","observation_id":"8d8efd20-f15a-49d5-a2a2-5f5ff0bf81c7","resolution":{"observed_at":"2026-08-06T19:57:48.327077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.14197","last_updated":"2024-09-30T15:59:21Z","snapshot_observed_at":"2026-08-16T15:37:14.862706Z","submitted_at":"2023-04-27T14:02:54Z","title":"Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games","version":2},"cited_work":{"arxiv_id":"2304.14197","doi":null,"metadata_source":"pith","pith_arxiv_id":"2304.14197","snapshot_observed_at":"2026-08-06T19:57:43.031357Z","title":"Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games","venue":"quant-ph","work_id":"4bcd3965-f87c-4572-8ad5-2f631c462e68","year":2023},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.323976Z"},"links":{"cited_paper":"/paper/2304.14197","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:55e6afab5b7dd6fcaaca7d74a1f391532fa7fb47bb07b903a5b5c290035f7707","observation_id":"56fc6754-e37a-42f8-a091-83e6cd889781","resolution":{"observed_at":"2026-08-06T19:57:43.122680Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0708.1879","last_updated":"2008-03-26T08:16:39Z","snapshot_observed_at":"2026-08-18T08:24:59.902974Z","submitted_at":"2007-08-14T12:53:08Z","title":"Quantum random access memory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0708.1879","snapshot_observed_at":"2026-08-06T19:57:38.366923Z","title":"16, 160501, arXiv: 0708.1879","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.366923Z"},"links":{"cited_paper":"/paper/0708.1879","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:6e75e1abd0faa312f39d6e808716ab5e3c222ce44c41666c16695a929ab7588c","observation_id":"5f1025c3-546f-4352-a0e3-ff193b9c0596","resolution":{"observed_at":"2026-08-06T19:57:38.366923Z","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-06T19:57:48.109232Z","title":null,"venue":null,"work_id":"85d7a82e-4489-4a8f-a2e1-18db1bbf968f","year":2011},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.399390Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:21dcebfbb117b4ed8c5ba2bdcf52589ac0d7c32c8defcee2344dfed82633aa4e","observation_id":"e9538099-a881-4f62-b356-bccadc53d611","resolution":{"observed_at":"2026-08-06T19:57:48.198681Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.02548","last_updated":"2022-12-05T19:10:32Z","snapshot_observed_at":"2026-08-18T02:41:06.809250Z","submitted_at":"2022-12-05T19:10:32Z","title":"Robustness of Quantum Algorithms for Nonconvex Optimization","version":1},"cited_work":{"arxiv_id":"2212.02548","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.02548","snapshot_observed_at":"2026-08-06T19:57:42.906211Z","title":"Robustness of Quantum Algorithms for Nonconvex Optimization","venue":"quant-ph","work_id":"045f4220-aec6-439c-9616-f2f14f2cf365","year":2022},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.427280Z"},"links":{"cited_paper":"/paper/2212.02548","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:0bb89d977084404f537245069ace777967a400dd3ef83abe0bb145d197eb10d3","observation_id":"4b35a058-4115-4652-8f88-f9028a9b4af4","resolution":{"observed_at":"2026-08-06T19:57:42.957849Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:47.907695Z","title":"Grigoriadis and Leonid G","venue":null,"work_id":"0b03d95a-5445-461a-bb49-de0a3c1fba55","year":1995},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.434323Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:d5afdc163bd3467320236ac1e3ce7288b351a24b2480cae607c1c1902d80a519","observation_id":"753acd52-4bc3-4218-b7ce-999bfb0c17e9","resolution":{"observed_at":"2026-08-06T19:57:47.977746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0208112","last_updated":"2002-08-15T23:00:04Z","snapshot_observed_at":"2026-08-11T09:53:13.384216Z","submitted_at":"2002-08-15T23:00:04Z","title":"Creating superpositions that correspond to efficiently integrable probability distributions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0208112","snapshot_observed_at":"2026-08-06T19:57:38.468948Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.468948Z"},"links":{"cited_paper":"/paper/quant-ph/0208112","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:4dd218ec45334d22273f477a33537d73fa503a8e397a06b1a085fb7281891943","observation_id":"35e2588e-4179-4b71-8649-83da9d6630a2","resolution":{"observed_at":"2026-08-06T19:57:38.468948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.09328","last_updated":"2022-12-19T09:45:58Z","snapshot_observed_at":"2026-08-18T08:00:02.639393Z","submitted_at":"2022-12-19T09:45:58Z","title":"Quantum policy gradient algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.09328","snapshot_observed_at":"2026-08-06T19:57:38.497310Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.497310Z"},"links":{"cited_paper":"/paper/2212.09328","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:91c5b7cbfba76c886fecac86c391b220be4e01e2b48439b4e996a9c55855c996","observation_id":"90eaa6b8-db85-4660-a19e-3afd0727b252","resolution":{"observed_at":"2026-08-06T19:57:38.497310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.07470","last_updated":"2020-04-16T06:02:37Z","snapshot_observed_at":"2026-08-15T18:19:48.348663Z","submitted_at":"2020-04-16T06:02:37Z","title":"Faster Dynamic Matrix Inverse for Faster LPs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.07470","snapshot_observed_at":"2026-08-06T19:57:38.522784Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.522784Z"},"links":{"cited_paper":"/paper/2004.07470","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:cc98aee6ed56493639b5b68680da4092894451c6002afc2dab66025b86f12a93","observation_id":"32424d26-0a4a-4623-9aca-1f855878f47f","resolution":{"observed_at":"2026-08-06T19:57:38.522784Z","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-06T19:57:47.770444Z","title":"302–311, 1984","venue":null,"work_id":"d5c3f75d-2fc2-4702-bc85-a8bdf833c419","year":1984},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.554883Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:6b12a3c175d9c0b6e885ea19d973c39a914389f4d68623793f1710ef968ef4e7","observation_id":"b82d9ebd-6ef5-425f-aae5-a8cbcf619435","resolution":{"observed_at":"2026-08-06T19:57:47.833803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1603.08675","last_updated":"2016-09-22T09:32:16Z","snapshot_observed_at":"2026-08-14T22:04:07.347684Z","submitted_at":"2016-03-29T08:25:22Z","title":"Quantum Recommendation Systems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1603.08675","snapshot_observed_at":"2026-08-06T19:57:38.587949Z","title":"49–1, Schloss Dagstuhl–Leibniz-Zentrum f¨ ur Informatik, 2017, arXiv: 1603.08675","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.587949Z"},"links":{"cited_paper":"/paper/1603.08675","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:c7d6bd77e287d4a7df2eee45df3ffd1d9302e6471072e0297a494ffa3072deb7","observation_id":"b23b6656-9735-4c60-9182-7ae5e06d36b5","resolution":{"observed_at":"2026-08-06T19:57:38.587949Z","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-06T19:57:47.578867Z","title":null,"venue":null,"work_id":"aa2ff840-4944-42d9-9754-6e8201cb1a0e","year":1979},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.632218Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:638e5fec26185c1eaa149ee9fdf5ce47f30872bb29e7ad72e6926a0fa75b9369","observation_id":"eaae0e5c-31b7-42b0-acdd-5c95a2212601","resolution":{"observed_at":"2026-08-06T19:57:47.686711Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.07544","last_updated":"2022-08-16T05:34:26Z","snapshot_observed_at":"2026-08-16T16:39:00.160405Z","submitted_at":"2022-08-16T05:34:26Z","title":"Mean estimation when you have the source code; or, quantum Monte Carlo methods","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.07544","snapshot_observed_at":"2026-08-06T19:57:38.662620Z","title":"1186–1215, SIAM, 2023, arXiv: 2208.07544","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.662620Z"},"links":{"cited_paper":"/paper/2208.07544","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:e4b120a8bf9306e7faf879962aa9a8249b139befabed41063d40db398ca39f7a","observation_id":"e7a28ad8-b0fb-4ba2-b565-ae8b821b7069","resolution":{"observed_at":"2026-08-06T19:57:38.662620Z","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-06T19:57:47.319092Z","title":"1029–1046, SIAM, 2018","venue":null,"work_id":"85b341d0-1311-4bf4-a2b8-8d189b244b60","year":2018},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.692418Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:62680eb68646f4e8fc2b042b679dbfc52ebfeac1065e84fc3c2d930abc3a2a0d","observation_id":"68f5c6b7-2993-4cfd-80c5-4a8dc2a45166","resolution":{"observed_at":"2026-08-06T19:57:47.403029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1503.01752","last_updated":"2015-10-14T13:06:14Z","snapshot_observed_at":"2026-08-14T22:57:30.867342Z","submitted_at":"2015-03-05T20:12:13Z","title":"Efficient Inverse Maintenance and Faster Algorithms for Linear Programming","version":3},"cited_work":{"arxiv_id":"1503.01752","doi":null,"metadata_source":"pith","pith_arxiv_id":"1503.01752","snapshot_observed_at":"2026-08-06T19:57:42.660273Z","title":"Efficient Inverse Maintenance and Faster Algorithms for Linear Programming","venue":"cs.DS","work_id":"7ea342b0-8edc-466c-8aed-f0d499c0081c","year":2015},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.733012Z"},"links":{"cited_paper":"/paper/1503.01752","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:adf888d2f76c3c15e30a4c9f3dd299f7f07accd672042e0ca12b266778216a59","observation_id":"92bc1cc8-1ec0-4444-85e1-844f755c1879","resolution":{"observed_at":"2026-08-06T19:57:42.777190Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1508.04874","last_updated":"2015-11-05T07:04:31Z","snapshot_observed_at":"2026-08-18T10:02:26.927091Z","submitted_at":"2015-08-20T04:44:51Z","title":"A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization","version":2},"cited_work":{"arxiv_id":"1508.04874","doi":null,"metadata_source":"pith","pith_arxiv_id":"1508.04874","snapshot_observed_at":"2026-08-06T19:57:42.549394Z","title":"A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization","venue":"cs.DS","work_id":"1cfdf217-7926-4c26-806d-37304c7b46e9","year":2015},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.784518Z"},"links":{"cited_paper":"/paper/1508.04874","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:50d3dd2dcc9244fed4c18c53b8614c69b87492dc5facb8c62abed0eb1aba71bd","observation_id":"b7f9aa8c-54b5-4756-ad01-46e5b385f453","resolution":{"observed_at":"2026-08-06T19:57:42.600605Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.01471","last_updated":"2023-03-02T18:34:38Z","snapshot_observed_at":"2026-08-16T20:32:07.656763Z","submitted_at":"2023-03-02T18:34:38Z","title":"Quantum Hamiltonian Descent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.01471","snapshot_observed_at":"2026-08-06T19:57:38.875183Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.875183Z"},"links":{"cited_paper":"/paper/2303.01471","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:7566e0f294b7aada90f7bb4a3378f1bbf708de8f1f256da922f0f172b868a4ec","observation_id":"64f18676-65ab-453b-a89c-578571d5fd16","resolution":{"observed_at":"2026-08-06T19:57:38.875183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14841","last_updated":"2025-04-21T03:44:46Z","snapshot_observed_at":"2026-08-18T03:04:33.071459Z","submitted_at":"2025-04-21T03:44:46Z","title":"(Sub)Exponential Quantum Speedup for Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14841","snapshot_observed_at":"2026-08-06T19:57:38.968904Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:38.968904Z"},"links":{"cited_paper":"/paper/2504.14841","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:8668d0f1d5ac7edc843871ade0f39aaa83c5ad83f310962a7ef08e833ac13967","observation_id":"36d37678-7952-40d2-a8ba-8222cac6e1d4","resolution":{"observed_at":"2026-08-06T19:57:38.968904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.06385","last_updated":"2021-06-23T00:04:07Z","snapshot_observed_at":"2026-08-16T18:46:02.937421Z","submitted_at":"2021-02-12T08:14:30Z","title":"The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks","version":3},"cited_work":{"arxiv_id":"2102.06385","doi":null,"metadata_source":"pith","pith_arxiv_id":"2102.06385","snapshot_observed_at":"2026-08-06T19:57:42.384628Z","title":"The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks","venue":"cs.LG","work_id":"9f9e96e9-6d7a-4fbc-b200-72a569dc3cd4","year":2021},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:39.041729Z"},"links":{"cited_paper":"/paper/2102.06385","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:3b7e185709a196b439cc75d8a8163a60872d15f9bd1b076b1fca3ab94fdc026b","observation_id":"8a4e52cc-4297-444f-9833-cbc98e3e5243","resolution":{"observed_at":"2026-08-06T19:57:42.455393Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.14501","last_updated":"2023-05-22T04:56:11Z","snapshot_observed_at":"2026-08-16T16:28:18.579627Z","submitted_at":"2022-09-29T01:39:20Z","title":"On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks","version":2},"cited_work":{"arxiv_id":"2209.14501","doi":null,"metadata_source":"pith","pith_arxiv_id":"2209.14501","snapshot_observed_at":"2026-08-06T19:57:42.226707Z","title":"On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks","venue":"quant-ph","work_id":"b91921cf-8cb1-4f2c-bd00-224c25815250","year":2022},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:39.113760Z"},"links":{"cited_paper":"/paper/2209.14501","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:5c8c7af7c22c3d82ee4db11c9b4bfb2ec45eac474298fa79450d107056af60b3","observation_id":"937891b8-a8a1-47ac-94b6-df38fa874f12","resolution":{"observed_at":"2026-08-06T19:57:42.299439Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:47.162465Z","title":"6, 305–308","venue":null,"work_id":"c2184381-b498-4ca0-afce-15b93ef3e94e","year":1989},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:39.210697Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:6bce5e6eca870503b698f14b10553139d23ff26238c078f1a8aee2461f508d4c","observation_id":"8a713f1e-a2a9-4585-b7e5-4f2e3b23a94e","resolution":{"observed_at":"2026-08-06T19:57:47.246916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:47.022763Z","title":"5, 22–es","venue":null,"work_id":"4bd6c444-44bf-4cd9-9cb1-76225127e9fd","year":2007},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:39.292922Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:2a47efd680b850b3828427b8794a48445d97afca4f91a22ae5c6fe9baff3032d","observation_id":"2c9a037a-b20f-42fd-8375-f0a3759256fa","resolution":{"observed_at":"2026-08-06T19:57:47.093969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.03464","last_updated":"2024-03-08T10:06:43Z","snapshot_observed_at":"2026-08-16T16:18:08.501171Z","submitted_at":"2022-11-07T11:25:47Z","title":"A Survey on Quantum Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.03464","snapshot_observed_at":"2026-08-06T19:57:39.379508Z","title":"Scherer, Axel Plinge, and Christo- pher Mutschler, A survey on quantum reinforcement learning , arXiv preprint arXiv:2211.03464 (2022), arXiv:2211.03464","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:39.379508Z"},"links":{"cited_paper":"/paper/2211.03464","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:8d9f841383751a6384de0191b39c0457d697c0ecc3678f16218780e2a7c1e0a3","observation_id":"1bc370a5-53fc-401b-8024-4ad470453a1e","resolution":{"observed_at":"2026-08-06T19:57:39.379508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1504.06987","last_updated":"2017-07-11T10:38:52Z","snapshot_observed_at":"2026-08-14T22:50:56.169553Z","submitted_at":"2015-04-27T09:23:02Z","title":"Quantum speedup of Monte Carlo methods","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1504.06987","snapshot_observed_at":"2026-08-06T19:57:39.485811Z","title":"2181, 20150301, arXiv: 1504.06987","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:39.485811Z"},"links":{"cited_paper":"/paper/1504.06987","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:db5175248e0a2243d1ad87503ffb143277e35bded650fffdac540b4163cfb98a","observation_id":"1cd574c6-701e-4ff5-9ead-bc4e252d9154","resolution":{"observed_at":"2026-08-06T19:57:39.485811Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.10649","last_updated":"2022-09-12T02:25:50Z","snapshot_observed_at":"2026-08-08T08:59:33.343019Z","submitted_at":"2019-10-23T16:14:25Z","title":"Fast quantum subroutines for the simplex method","version":9},"cited_work":{"arxiv_id":"1910.10649","doi":null,"metadata_source":"pith","pith_arxiv_id":"1910.10649","snapshot_observed_at":"2026-08-06T19:57:42.060480Z","title":"Fast quantum subroutines for the simplex method","venue":"quant-ph","work_id":"2cd23854-2d29-4319-86de-742f10d8d01b","year":2019},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:39.563017Z"},"links":{"cited_paper":"/paper/1910.10649","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:d23d7b256c36de8c9c5b2e2ed42eb1b98137c4dffc3280d3ec957eb86d08284f","observation_id":"76481467-2506-4291-b0b1-372e30d7a8ea","resolution":{"observed_at":"2026-08-06T19:57:42.125165Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:46.843004Z","title":"5, 527–535","venue":null,"work_id":"c8240a9a-b3e4-4d63-bd34-2189f6d9e605","year":1952},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:39.690750Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:2d74eff5f394a9ecdcf9df9a7f79b7feb1e1a647b3e87f64da923611ac442bbd","observation_id":"6bdb3dc7-91a7-4ee8-89c6-d26b2549abac","resolution":{"observed_at":"2026-08-06T19:57:46.932157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:46.689842Z","title":null,"venue":null,"work_id":"ed716427-48c6-4c60-98c6-ec51aae7fbde","year":2010},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:39.754780Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:81d3e28d91a427e2083e3e19dee1c022b2832fa9fc26430828b72dd51d94fa00","observation_id":"45abe258-3fe8-4d3b-b62c-7828c2c65d88","resolution":{"observed_at":"2026-08-06T19:57:46.758369Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.07272","last_updated":"2024-04-03T21:32:42Z","snapshot_observed_at":"2026-08-14T16:46:13.266119Z","submitted_at":"2019-04-15T18:17:01Z","title":"Introduction to Multi-Armed Bandits","version":8},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.07272","snapshot_observed_at":"2026-08-06T19:57:39.842671Z","title":"1-2, 1–286, arXiv: 1904.07272","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:39.842671Z"},"links":{"cited_paper":"/paper/1904.07272","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:a3f0af8a0314c304db85338960a45ba9de0b7bee9f76e3eec2b270363df72939","observation_id":"cf02df83-950a-48ff-868b-55f209a71297","resolution":{"observed_at":"2026-08-06T19:57:39.842671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.14988","last_updated":"2022-05-30T10:54:53Z","snapshot_observed_at":"2026-08-16T16:56:42.793682Z","submitted_at":"2022-05-30T10:54:53Z","title":"Quantum Multi-Armed Bandits and Stochastic Linear Bandits Enjoy Logarithmic Regrets","version":1},"cited_work":{"arxiv_id":"2205.14988","doi":null,"metadata_source":"pith","pith_arxiv_id":"2205.14988","snapshot_observed_at":"2026-08-06T19:57:41.944960Z","title":"Quantum Multi-Armed Bandits and Stochastic Linear Bandits Enjoy Logarithmic Regrets","venue":"cs.LG","work_id":"efb0e59d-fb7b-4c68-864d-8055da32eb07","year":2022},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:39.923387Z"},"links":{"cited_paper":"/paper/2205.14988","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:749db79f7af877156c9d95530357b23e5391784723666eb8cc3b33f195d76fa4","observation_id":"903e563b-539a-47a2-9e62-335fbf81979d","resolution":{"observed_at":"2026-08-06T19:57:41.969116Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.07049","last_updated":"2020-12-15T18:31:01Z","snapshot_observed_at":"2026-07-30T15:48:38.236026Z","submitted_at":"2020-07-14T14:15:20Z","title":"Quantum exploration algorithms for multi-armed bandits","version":2},"cited_work":{"arxiv_id":"2007.07049","doi":null,"metadata_source":"pith","pith_arxiv_id":"2007.07049","snapshot_observed_at":"2026-08-06T19:57:41.788103Z","title":"Quantum exploration algorithms for multi-armed bandits","venue":"quant-ph","work_id":"f676ca38-5be8-4a5c-b900-1ed3ca25fa22","year":2020},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:40.046223Z"},"links":{"cited_paper":"/paper/2007.07049","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:5711c246c20547a2f6a8a7df6e88dc87008a1132c7b87f22e6976fbaf01d2412","observation_id":"5898810d-84a1-4297-b12a-40d6aeeb1623","resolution":{"observed_at":"2026-08-06T19:57:41.856421Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:46.509531Z","title":"2, 517–546","venue":null,"work_id":"b1a609a1-772f-48f4-aa7b-1f3a3099a492","year":2020},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:40.130883Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:4413de7e244086f0b287a443793362324c32132f7c033549d4be8b6cfb0cc7d8","observation_id":"0ff8b488-8263-4c52-928c-46787f052a43","resolution":{"observed_at":"2026-08-06T19:57:46.620183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:46.381049Z","title":null,"venue":null,"work_id":"d0e21fdb-bec4-402c-acc4-d13b56830b06","year":1992},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:40.207002Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:22c15bbb4eeef514e45ebb4a113794ff9f3aac092247f885b7f8a9380f9544a4","observation_id":"47accc2e-042c-4ccf-85e1-ec3920efb695","resolution":{"observed_at":"2026-08-06T19:57:46.423043Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:46.186252Z","title":"3, 737–757","venue":null,"work_id":"5530f38d-dffc-40a7-ae2e-e123c22178a8","year":2009},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:40.304182Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:ca5acc73180144d7d94eaefc58c890a63a7a28f1606311e5bf3c463429e41e6e","observation_id":"ab49cd41-d494-4232-a40e-3fba1b88046c","resolution":{"observed_at":"2026-08-06T19:57:46.285976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.03906","last_updated":"2023-06-04T18:33:54Z","snapshot_observed_at":"2026-08-16T16:10:13.765657Z","submitted_at":"2022-12-07T19:02:36Z","title":"Quantum Lower Bounds for Finding Stationary Points of Nonconvex Functions","version":2},"cited_work":{"arxiv_id":"2212.03906","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.03906","snapshot_observed_at":"2026-08-06T19:57:41.634123Z","title":"Quantum Lower Bounds for Finding Stationary Points of Nonconvex Functions","venue":"quant-ph","work_id":"4b6198c5-4bc9-4f1a-8805-5cfc4d1e26bf","year":2022},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:40.361964Z"},"links":{"cited_paper":"/paper/2212.03906","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:cadeae9d5e2a10af8cfa2a28312a940815445b1a36c56f9b6493cb52704b6d38","observation_id":"4f571398-1d1a-4e6d-ad4b-389ac2cf242c","resolution":{"observed_at":"2026-08-06T19:57:41.716828Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.10796","last_updated":"2024-06-13T17:00:41Z","snapshot_observed_at":"2026-08-16T15:53:47.577427Z","submitted_at":"2023-02-21T16:23:11Z","title":"Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret","version":2},"cited_work":{"arxiv_id":"2302.10796","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.10796","snapshot_observed_at":"2026-08-06T19:57:41.498928Z","title":"Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret","venue":"quant-ph","work_id":"7e3f3c2f-6dc1-4b46-897a-52f96e1120cb","year":2023},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:40.501641Z"},"links":{"cited_paper":"/paper/2302.10796","citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:b744e7859a491e08d09c83aa746f2b0ee76e37abf45a0cff45bd5e5ca8d8ac48","observation_id":"d52ee81a-1db6-4ab8-a5ef-eff87edfff8f","resolution":{"observed_at":"2026-08-06T19:57:41.560901Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:46.022097Z","title":"Intuitively, the duration of this stage is of order O(log T )","venue":null,"work_id":"d0a972b0-fb51-4f88-8fe7-fc92432164e6","year":null},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:40.573953Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:a998cd77116ce8653711383bfee5730120895acbede80af1343d0c1e259b7ed0","observation_id":"5acc628b-9cd3-4cbe-bdc6-3e9e5550db21","resolution":{"observed_at":"2026-08-06T19:57:46.114614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:45.905832Z","title":"This improved estimation ensures that the condition ∥C L ·,i(t) − C·,i∥∞ ≤ θ continues to hold, thereby guaranteeing the stability of the smallest singular value of C L(t)","venue":null,"work_id":"21ea0174-69c9-4977-bdbd-59c30f216af5","year":null},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:40.658965Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:2130164e4f02c70258817051a626171160557d89bf297a8b3f129830921f7511","observation_id":"0fb588bb-a554-478a-8a86-8580f921383b","resolution":{"observed_at":"2026-08-06T19:57:45.961864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:45.695583Z","title":"This stage occurs with a small probability and is expected to last only O(1) rounds","venue":null,"work_id":"95318a83-5b04-4fc5-9e83-7127698cf37f","year":null},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:40.728488Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:61852f11f971cc2f05689bab9790d7eeb275d1a260e08b1992dd6abd9daa0ce3","observation_id":"76c56b86-e854-4ce4-b798-9483f05d6300","resolution":{"observed_at":"2026-08-06T19:57:45.748552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:45.545114Z","title":null,"venue":null,"work_id":"34e4d3a9-8b61-495f-8779-434640542eb7","year":null},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:40.785378Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:dc630c2db8b627d90672c0b2a11eb1299ba9e9d982097faf0baae824f0032aca","observation_id":"3b1f6fa8-6425-49c0-9645-093430bc1093","resolution":{"observed_at":"2026-08-06T19:57:45.586633Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:45.397877Z","title":"Based on Lemma 1, the first part of Assumption 2 is satisfied with high probability","venue":null,"work_id":"efc3eaee-c905-468e-bc71-775c661ec9cb","year":null},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:40.883907Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:7f113a87d4aab9ff4f0400a2eb0a8f214bc5ea8b9261b09b022492e4825366e5","observation_id":"1f3172a8-b354-4cb0-b9dc-a94014dec9ec","resolution":{"observed_at":"2026-08-06T19:57:45.484076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:45.227880Z","title":"In this case, we upper bound the gap between the expected resource consumption and the average remaining resource as shown in (98)","venue":null,"work_id":"355da273-2bb6-4699-9470-000054b4a88f","year":null},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:40.960053Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:1f5bd96c3b2289ea0af52f6c8b1eaaf9c5843094a5d981a6f7e9ff3e1b69ddee","observation_id":"a6691b25-2b06-41a4-b12a-248491119a0b","resolution":{"observed_at":"2026-08-06T19:57:45.338675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:45.068886Z","title":"Since the resource consumption matrix is element-wise bounded in [0 , 1], we have 0 ≤ E C·,it+1 (b(t))|Ht ≤ 1","venue":null,"work_id":"f433f445-fa93-4407-b17f-0f6d8f30adc9","year":null},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:41.070200Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:b31a16e064c2e2411918a740bbdf9727400f90903319db75a4740727cefeaf98","observation_id":"766c46f6-b4be-4339-b860-3523ef38ff3e","resolution":{"observed_at":"2026-08-06T19:57:45.189854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:44.909779Z","title":null,"venue":null,"work_id":"1e074191-8349-49a0-8fc9-a2c6347100a0","year":null},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:41.150719Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:7ada4b939d47b0aa2f91243550261edfc77e36c881e8c7cede3c371046177c3d","observation_id":"31718aff-2803-4003-a40e-cb5a74820ffa","resolution":{"observed_at":"2026-08-06T19:57:45.002491Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:44.822853Z","title":null,"venue":null,"work_id":"0ffe5744-77ee-4c59-8e89-349b6b5b5817","year":null},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:41.229248Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:8c06feae42c0dea86ef2359b9c0e3fea36103b4cbf41fad2ea1cda08a6af9daf","observation_id":"137332ab-70ac-49e0-bdfa-665ec068d344","resolution":{"observed_at":"2026-08-06T19:57:44.845264Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:44.704739Z","title":null,"venue":null,"work_id":"5fae1e8b-eb1c-42a9-9827-d8fd1c1c7721","year":null},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:41.274680Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:f586cbe8ae6a5b97d68835d6a447dd3fdcbbc3fd097a965c37343613c1422dbd","observation_id":"fb860a35-094a-4e66-858d-928cb21ebc25","resolution":{"observed_at":"2026-08-06T19:57:44.756575Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:44.621833Z","title":null,"venue":null,"work_id":"5bdc6434-50ab-4b5e-99f1-78f9e7e2014e","year":null},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:41.339174Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:10ebce96d019243b17303ceab5b6e92c906e61b75897c171ccede9474ce788f3","observation_id":"6d10d9ad-8785-41ae-b1d5-5fa6b1b3d5f1","resolution":{"observed_at":"2026-08-06T19:57:44.667277Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06T19:57:44.533845Z","title":"For the first summation in (108), it is bound by sX k=1 E[∆k|Hk−1] ≤ TX k=1 |E[∆k|Hk−1]| = αTX k=1 ¯ϵ T − k + T −1X k=αT +1 ϵk T − k ≤ α¯ϵ 1 − α + T −1X k=αT +1 ϵk T − k","venue":null,"work_id":"58c58d61-ea68-42fb-9464-f8c3789db690","year":null},"citing_paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-06T19:57:41.424159Z"},"links":{"citing_paper":"/paper/2507.04438"},"observation_digest":"sha256:5b74ff1848e16270410d845780e2d00c2e3627868cc0c1323b1cfd9af6a32697","observation_id":"cf2b2868-4040-42db-82b3-740796dcd93b","resolution":{"observed_at":"2026-08-06T19:57:44.550906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.04438","last_updated":"2025-07-06T15:52:37Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-18T09:28:36.348797Z","submitted_at":"2025-07-06T15:52:37Z","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities"},"reference_resolution":{"displayed":76,"state_counts":{"malformed_identifier":0,"metadata_mismatch":8,"parse_uncertain":0,"unresolved":29,"verified_exact":14,"verified_fuzzy":25},"total_outbound_references":76},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 76 of 76 outbound references and 1 inbound Pith citation observation for arXiv:2507.04438."}