{"as_of":"2026-08-09T13:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b8896ad7f312f924997e1823aa58a9b6737576e223bfc706526e2da77d3c4482","coverage":[{"denominator":84,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":84,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:28:16.563095Z","state":"measured"},{"denominator":84,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":84,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.08543/citation-record","integrity":"/paper/2507.08543/integrity","json":"/paper/2507.08543/citation-record.json","paper":"/paper/2507.08543"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:12.376721Z","title":"Linear convergence of a frank-wolfe type algorithm over trace-norm balls","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:12.376721Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:5a88230f11c12612e4df0fa938f7babf662ee9907ba9eddc675ed2d4f78c873a","observation_id":"df40467e-6b8c-4016-986e-7a6d8863f53c","resolution":{"observed_at":"2026-08-06T18:28:12.376721Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:12.435275Z","title":"Variable time amplitude amplification and a faster quantum algorithm for solving systems of linear equations","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:12.435275Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:71a33e0683b272d936249a05f0dd849cb952188e74d0bb7b9a16b99c18f6405d","observation_id":"5546895b-f30d-404b-8dcb-27e956494738","resolution":{"observed_at":"2026-08-06T18:28:12.435275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:12.519458Z","title":"Quantum algorithms for matching and network flows","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:12.519458Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:864e92b3776b9c492d1d87c2ba8eabc4ad8f33d6317c888cadac398251c08bd1","observation_id":"086b3236-ace6-4d89-853d-5e18de96e25b","resolution":{"observed_at":"2026-08-06T18:28:12.519458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:12.637235Z","title":"Quantum speedups for linear programming via interior point meth- ods","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:12.637235Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:84d90f37e8d39d0c88dc6309f6a6369879463d6924f8f701d3361c64ff1dde2f","observation_id":"43b096e0-615b-4fa5-af1e-25f6abd40b3a","resolution":{"observed_at":"2026-08-06T18:28:12.637235Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:12.716991Z","title":"Hybrid conditional gradient-smoothing algo- rithms with applications to sparse and low rank regularization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:12.716991Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:129b0755c750f50c5a435ccea316c2f145451f62a65027b01db54172a5755e51","observation_id":"b19a209f-6a91-4230-aea7-11e47a2bda98","resolution":{"observed_at":"2026-08-06T18:28:12.716991Z","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-06T18:28:18.048910Z","title":"Quantum algorithms for svd-based data representation and analysis","venue":null,"work_id":"9ce6bdce-0f45-47a9-bdd0-a92bb2d6d14d","year":2022},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:12.789652Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:f32b1f76892e354b0e62149e748ed8b6e044de839841cc3b47cc71336bb5ca2e","observation_id":"3352071d-08a4-4ae3-8a0a-b86865b04721","resolution":{"observed_at":"2026-08-06T18:28:18.053709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:18.032938Z","title":"A theoretical and empirical comparison of gradient approximations in derivative-free optimization","venue":null,"work_id":"b5b8e42a-cae5-414d-a4c7-2667315b4ffd","year":2022},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:12.852208Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:050bd9fee3ce88b9ddfdef5fd91c1b532cd0946dd730b0d32360a29d32227724","observation_id":"a3bdd360-b1e4-47a9-9330-b080431e8f5e","resolution":{"observed_at":"2026-08-06T18:28:18.037852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:18.015030Z","title":"Frank–wolfe and friends: a journey into projection-free first-order optimization methods","venue":null,"work_id":"c6b5cca6-c69d-4e7a-b261-6f598b376114","year":2021},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:12.920256Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:8c2aef2bc1eb8d43e5e7a29d5ceea76b9f673c1dd2427f6e985df917672eba27","observation_id":"2a65532d-20e4-444b-b350-f37b914c613f","resolution":{"observed_at":"2026-08-06T18:28:18.021251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.995144Z","title":"Quantum SDP solvers: Large speed-ups, optimality, and applications to quantum learning","venue":null,"work_id":"7336d9ce-e337-4511-9147-1d2d2a4342b4","year":2019},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:13.016146Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:0af1d13ad564ce92fc9990929d247ef3192f006874fdfe7ef2284beb0641661d","observation_id":"747f649f-5559-4624-8fec-f07b47d056d4","resolution":{"observed_at":"2026-08-06T18:28:18.000797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.976889Z","title":"Quantum speed-ups for solving semidefinite programs","venue":null,"work_id":"41e2b472-fdab-4fdd-afd9-848a7877c551","year":2017},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:13.106899Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:bec578ddc444456aaf3c193fef3b3552f30d0ffa695174dc7180f5e840504801","observation_id":"7803e274-4ff2-47bf-a505-477f9dfb9fb0","resolution":{"observed_at":"2026-08-06T18:28:17.982041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:13.183916Z","title":"Quantum amplitude amplification and estimation","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:13.183916Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:063277567e05b05f8c61ed8ef8074ca81819f8590b0a7410538bcc39cec35832","observation_id":"4aa7f5ba-f616-4007-aef8-27d93e5f4ddd","resolution":{"observed_at":"2026-08-06T18:28:13.183916Z","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-06T18:28:17.949184Z","title":"A tight upper bound on the rate of convergence of frank-wolfe algorithm","venue":null,"work_id":"26b84623-d9e9-4f99-8b26-39b19839e8e8","year":1968},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:13.265571Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:4ec236917e4e5c04573c4f4afe0fdd67d1e9409c01867400062dabc3a0442910","observation_id":"5b16fa12-ffce-4cfc-b9c8-0712e16f8525","resolution":{"observed_at":"2026-08-06T18:28:17.954390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.931564Z","title":"Quantum bandits","venue":null,"work_id":"c124e40d-34fa-4a89-90f3-1cbe3f92d23c","year":2020},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:13.372660Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:63f240f3ea7f4bd92177399391e0e702e48202799c801a1b69dc52d85938ddb9","observation_id":"e4163495-abb3-4350-bb8d-f9e21d97a4fa","resolution":{"observed_at":"2026-08-06T18:28:17.937485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.914849Z","title":"Quantum algorithms and lower bounds for convex optimization","venue":null,"work_id":"af775e79-3176-41ff-a32d-229b3a89e33b","year":2020},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:13.442488Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:257cbc17201f8dac5d5fc8988973ebf68ba71190ff139a65cca3a58fbf92f83d","observation_id":"b7748ce2-34f4-4712-9ab3-14e3aed76308","resolution":{"observed_at":"2026-08-06T18:28:17.919497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.898756Z","title":"The power of block-encoded matrix powers: Improved regression techniques via faster hamiltonian simulation","venue":null,"work_id":"3ceb1455-951b-4682-ac62-19c41179c81e","year":2019},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:13.490015Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:25f6e777c3e0d6120181c2daeb4f77a710435d1a63683d953863d0eba3d081a5","observation_id":"457bc0e7-0d56-497d-860e-ba2f97322310","resolution":{"observed_at":"2026-08-06T18:28:17.904294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.882159Z","title":"Projection-free online optimization with stochastic gradient: From convexity to submodularity","venue":null,"work_id":"7a51efa3-7f86-406c-8010-852a2bc1cdbc","year":2018},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:13.566128Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:0b7305e31338095343dadc9ba60139b4e24bb6e0c252850a66426e307918c8e8","observation_id":"ecfba6dc-652f-48d4-88a6-fb485af76512","resolution":{"observed_at":"2026-08-06T18:28:17.886898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.867209Z","title":"Quantum algorithms and lower bounds for linear regression with norm constraints","venue":null,"work_id":"7ae44937-eaf5-4711-85f2-b66178011bd1","year":2023},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:13.641057Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:7adbed908250df250e3fb10ef418b5736526a646cc66d3ca3081f4bfdafe726c","observation_id":"40681cf2-c5e4-44f8-abdf-05851d14a440","resolution":{"observed_at":"2026-08-06T18:28:17.871791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.849990Z","title":"A quantum speed-up for approximating the top eigen- vectors of a matrix","venue":null,"work_id":"05d8d6f4-e0b7-40c5-bfef-2bb39b3eaa05","year":2025},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:13.714270Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:56d001042ed533a313d524c34dc70ee27cf6e0a8b520a676de6a97566871662e","observation_id":"4c213bdd-1574-4446-9e3a-fbe83b37044a","resolution":{"observed_at":"2026-08-06T18:28:17.855935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:13.790008Z","title":"Quantum langevin dynamics for optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:13.790008Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:f85db930ffd2650a91a7e196ed849399c5e37b288ff5a702779348fe5d29bbed","observation_id":"bf31d3f2-d94f-4d19-83c0-e6205e4ffb74","resolution":{"observed_at":"2026-08-06T18:28:13.790008Z","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-06T18:28:17.822581Z","title":"Quantum algorithm for systems of lin- ear equations with exponentially improved dependence on precision","venue":null,"work_id":"e0a47472-887d-4fc5-9bf4-20655c2f45db","year":1920},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:13.867858Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:f69e2ad5573901b4abedaa3903686cc15e90317b982641aca18aac09ba008b61","observation_id":"1c6c4e15-aef5-4be2-b88c-ebce54620f2a","resolution":{"observed_at":"2026-08-06T18:28:17.827603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.805694Z","title":"Lifted coordinate descent for learning with trace- norm regularization","venue":null,"work_id":"517c9a0e-1797-4256-bdb8-275b53c6531a","year":2012},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:13.949053Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:33c76bcd760c0b08396578d109a41db1cb6abf50ebd0193bb66cdd32a6944b8f","observation_id":"a6104a1b-38dd-478d-80d7-90351398a82c","resolution":{"observed_at":"2026-08-06T18:28:17.810760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.789998Z","title":"Conditional gradient algorithms with open loop step size rules","venue":null,"work_id":"719c8c6b-de70-494f-b119-b6b00448c2fc","year":1978},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:14.019230Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:e7f018bd144e5c03ee988ff15d74700c167f728261613a6b294b4887f54f33e8","observation_id":"a4a70465-df76-42ce-955b-6905154ef092","resolution":{"observed_at":"2026-08-06T18:28:17.794688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:14.084498Z","title":"Quantum query complexity of some graph problems","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:14.084498Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:2cedbe029f1ce0595f676ad6890a39315e6aab44ce28b08c87d69768d1d49491","observation_id":"20c40f2a-8154-4dd3-98d8-24959d1f62ba","resolution":{"observed_at":"2026-08-06T18:28:14.084498Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9607014","last_updated":"1999-01-07T16:50:45Z","snapshot_observed_at":"2026-07-07T07:26:17.833366Z","submitted_at":"1996-07-18T19:12:42Z","title":"A Quantum Algorithm for Finding the Minimum","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9607014","snapshot_observed_at":"2026-08-06T18:28:14.150194Z","title":"A quantum algorithm for finding the minimum","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:14.150194Z"},"links":{"cited_paper":"/paper/quant-ph/9607014","citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:6baeec38e5cc4ccf199e7c5d96f7f68f816c13e8f438d2a61df468654c36a2c7","observation_id":"8f007a5c-c01e-4c25-b564-97dd9e29c58c","resolution":{"observed_at":"2026-08-06T18:28:14.150194Z","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-06T18:28:17.764162Z","title":"An algorithm for quadratic programming","venue":null,"work_id":"01194df0-ab79-4ca2-ae88-c2d3fb6002de","year":1956},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:14.220481Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:2ee6a935c0045d222e66f83f1c8d1a4eae0d9c9275f0db4897982ba37864c0f5","observation_id":"b36297b2-fc44-41f7-a4bd-ab118caf6323","resolution":{"observed_at":"2026-08-06T18:28:17.768459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.748065Z","title":"Faster projection-free convex optimization over the spectrahedron","venue":null,"work_id":"56bf5873-2bc0-4750-9f41-d59c3b3ab2ed","year":2016},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:14.267667Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:715d56c6167f3a934b499f06bb5038a54d3b0003b74618797242a2d2047c0cbb","observation_id":"f9cadcea-cb1e-4894-8a16-2542c4921d52","resolution":{"observed_at":"2026-08-06T18:28:17.753182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.732399Z","title":"A linearly convergent variant of the conditional gradient algorithm under strong convexity, with applications to online and stochastic optimization","venue":null,"work_id":"43db3299-e3fa-4b46-83a3-5767961feb69","year":2016},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:14.325484Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:63f807205868cfd38fdd0eda4fd90033ef39c930f85fc29ab955047b3b94939d","observation_id":"37bafeec-a672-4ae9-b243-29408d9630b0","resolution":{"observed_at":"2026-08-06T18:28:17.737362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.716049Z","title":"Optimizing quantum optimization algo- rithms via faster quantum gradient computation","venue":null,"work_id":"cfeea8c9-5b61-49f0-8132-51dd20bd4915","year":2019},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:14.374418Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:56ed1390e2005ce31becc84804a1ea9a21dcb457e761f4f045223806acbacb4c","observation_id":"27037fda-1242-4c97-8bc2-0a2b4ac8f4c5","resolution":{"observed_at":"2026-08-06T18:28:17.721526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.701061Z","title":"A fast quantum mechanical algorithm for database search","venue":null,"work_id":"e2909990-f3ae-4834-b45e-56a51a9523f6","year":1996},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:14.430575Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:b35b311627fad9dec6a7d902235c274060028d025d1cb53c56459a15056612b0","observation_id":"a1e2fffa-fd7a-4d43-a7e6-065aa3807743","resolution":{"observed_at":"2026-08-06T18:28:17.705511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.685042Z","title":"Conditional gradient algorithms for norm- regularized smooth convex optimization","venue":null,"work_id":"a11af9e6-47a6-4680-9f14-788ea03e5ab5","year":2015},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:14.484036Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:ff2ebbfd03b69d5295d6ca8f2dc594d213a489d1ef7d3af1399a457a708dcbe5","observation_id":"77f14136-0751-47bd-b14f-522f03aec570","resolution":{"observed_at":"2026-08-06T18:28:17.690318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.668593Z","title":"Quantum algorithm for linear systems of equa- tions","venue":null,"work_id":"7e3bbf47-7f3c-4074-a815-57b9f3da5b5d","year":2009},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:14.548066Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:a0d0c8be676cd3a427128ee2e86d048cb45e0cbf9ba860a365584249f8604163","observation_id":"f6aa9d9c-495b-4639-b4fe-67e77ab1b516","resolution":{"observed_at":"2026-08-06T18:28:17.673802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.647970Z","title":"Stochastic conditional gradi- ent++:(non) convex minimization and continuous submodular maximization","venue":null,"work_id":"227a4052-c949-435b-935c-3f57494580db","year":2020},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:14.604256Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:4491daccd2e88d65c8a9a3891da2af9a0354012d95299da7118d4315a6595228","observation_id":"a9773c6d-23b1-41db-8a6a-ea0cd82a9693","resolution":{"observed_at":"2026-08-06T18:28:17.653438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1206.4657","last_updated":"2012-06-18T15:26:34Z","snapshot_observed_at":"2026-07-06T02:50:20.241587Z","submitted_at":"2012-06-18T15:26:34Z","title":"Projection-free Online Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1206.4657","snapshot_observed_at":"2026-08-06T18:28:14.649099Z","title":"Projection-free online learning","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:14.649099Z"},"links":{"cited_paper":"/paper/1206.4657","citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:bd3e5dc3b0af6f7003995ca1dbe033323947c5287c3c17c44e94a3d8e0c8294a","observation_id":"3524f17d-9f30-4d05-9995-131980a29248","resolution":{"observed_at":"2026-08-06T18:28:14.649099Z","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-06T18:28:17.631898Z","title":"Near-optimal algorithms for online matrix predic- tion","venue":null,"work_id":"9fee21b8-8525-4996-8898-fb4246475b18","year":2012},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:14.717529Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:db518e680dd2a4377f6c1151d9609284336ed9f6d6a0043083e0908b9317f0be","observation_id":"9c4fe24e-ea9b-411d-b79d-6a1c981b6df6","resolution":{"observed_at":"2026-08-06T18:28:17.636784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.616105Z","title":"Variance-reduced and projection-free stochastic optimization","venue":null,"work_id":"663acb21-bf73-4a77-b8a7-8c532eadb578","year":2016},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:14.747464Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:d2be601974c5df5e924b744081ccf2c70b44348ca15b88dcf7483f2c7e374310","observation_id":"50b17ad9-f76c-46e1-8c35-1b9194316520","resolution":{"observed_at":"2026-08-06T18:28:17.621041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.601063Z","title":null,"venue":null,"work_id":"da036267-4fea-465b-874e-616a08e126d9","year":2024},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:14.797645Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:0d6e24b0244b562984c1ca1c23ec5b24925b8eef68f178f666d64d9bbb46b86a","observation_id":"70f2542f-3033-41eb-98bb-af05a99d24e5","resolution":{"observed_at":"2026-08-06T18:28:17.605832Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.584278Z","title":"Quantum algorithm for online convex opti- mization","venue":null,"work_id":"a48a508c-c3a5-4643-810d-7b40c879244d","year":2022},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:14.866770Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:dab13c44546e10f14030c7da639db7b5eec8577aa1c515c013f2040a2b67e1bf","observation_id":"b77defcc-d3e0-42c2-990d-888dd78434f5","resolution":{"observed_at":"2026-08-06T18:28:17.589658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.08721","last_updated":"2020-09-18T09:50:33Z","snapshot_observed_at":"2026-08-07T03:00:37.078991Z","submitted_at":"2020-09-18T09:50:33Z","title":"Quantum Search with Prior Knowledge","version":1},"cited_work":{"arxiv_id":"2009.08721","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.08721","snapshot_observed_at":"2026-08-06T18:28:16.743933Z","title":"Quantum Search with Prior Knowledge","venue":"quant-ph","work_id":"2ee27997-8903-4de9-b6c3-269816e19e06","year":2020},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:14.922062Z"},"links":{"cited_paper":"/paper/2009.08721","citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:9f566ab282ee48f5519fba50c3df051e284ed4b93771244c6117ed512b371857","observation_id":"6919058e-2d19-4842-999b-a46b33273c29","resolution":{"observed_at":"2026-08-06T18:28:16.748391Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.568946Z","title":"Revisiting frank-wolfe: Projection-free sparse convex optimization","venue":null,"work_id":"e2624142-a031-4e29-9cab-9fa0e10b3027","year":2013},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:14.994345Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:6d30568e1217a07d45c7560b88da852791520dce4d1c9854438b4d958547788c","observation_id":"e8e8e57a-3f3b-47d5-86ce-286025bfd35b","resolution":{"observed_at":"2026-08-06T18:28:17.574145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.552107Z","title":"Structured variable selection with sparsity- inducing norms","venue":null,"work_id":"302baae3-49a8-492e-acbf-02e749b2a185","year":2011},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:15.044441Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:1f793e1544b1bb2b13baf6aab080e119cf8a6fd880bae5ce6ab78b6735492ae9","observation_id":"0cb2997e-5c2a-452c-b34b-e9acd232240c","resolution":{"observed_at":"2026-08-06T18:28:17.557417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.537013Z","title":"Fast quantum algorithm for numerical gradient estimation","venue":null,"work_id":"ddeb1aeb-67b9-40a6-8a79-7203734dd6b8","year":2005},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:15.075237Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:2783dfa628e8e3bdc8095d77db9e0451889db9e47b8c1cdd741fb853122a81cf","observation_id":"33c3ce83-326a-4499-aeec-5377d74e1241","resolution":{"observed_at":"2026-08-06T18:28:17.541705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.520427Z","title":"Quantum expectation-maximization for gaussian mixture models","venue":null,"work_id":"0947a32d-f8e1-4223-a91f-266be9970773","year":2020},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:15.134064Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:0da4be042c5b6eedb248dd993eb3b6e716ccfdbaaa12cebb71b1f7691074e284","observation_id":"c3e69a6a-886e-4cde-8b82-a0a67b47aef4","resolution":{"observed_at":"2026-08-06T18:28:17.526365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.502854Z","title":"Quantum recommendation systems","venue":null,"work_id":"000f7cf1-e2b7-456b-888c-8d5476f07eff","year":2017},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:15.165004Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:27705ec52a33b31ca19593abc29ff00f3cdc926e662697371e47891e155be120","observation_id":"e20c897e-c34f-4f1a-83e3-7491f0416016","resolution":{"observed_at":"2026-08-06T18:28:17.508285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.486970Z","title":"Quantum gradient descent for linear systems and least squares","venue":null,"work_id":"0c2d631b-3589-4d1e-836d-f609b64ab441","year":2020},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:15.188607Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:602ea486b3741866c47a31e6e3bb456f32d375b62d5b1b4ac8e103a92cd8a713","observation_id":"6e5758c5-7665-4651-b37c-e5541f65d7f7","resolution":{"observed_at":"2026-08-06T18:28:17.491901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.470769Z","title":"A quantum interior point method for LPs and SDPs","venue":null,"work_id":"f64dbbd6-b78c-40c3-a706-577590bbd180","year":2020},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:15.255902Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:e70e93744bfc06b06e882fa63587262596c722d3535a07d22b6a6ed0eed84071","observation_id":"d8acb15e-2d86-46b4-8f6d-a72e1df7f18f","resolution":{"observed_at":"2026-08-06T18:28:17.476683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.455032Z","title":"Quantum algorithms for portfolio optimiza- tion","venue":null,"work_id":"f3890257-26c1-4cf9-9d52-7ae8a4759deb","year":2019},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:15.554012Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:316a2d6c2fe798cbde98d36bc0778611b0fa13eb84fc6dc987021a0465386ded","observation_id":"93e28bb3-52c0-44c0-a495-68afdcddd841","resolution":{"observed_at":"2026-08-06T18:28:17.460278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.06720","last_updated":"2021-04-05T17:33:22Z","snapshot_observed_at":"2026-08-03T05:12:08.045479Z","submitted_at":"2019-08-19T12:02:13Z","title":"Quantum algorithms for Second-Order Cone Programming and Support Vector Machines","version":4},"cited_work":{"arxiv_id":"1908.06720","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.06720","snapshot_observed_at":"2026-08-06T18:28:16.720393Z","title":"Quantum algorithms for Second-Order Cone Programming and Support Vector Machines","venue":"quant-ph","work_id":"96fd2ec0-dd48-4a0b-93f9-892fe6e3b7ef","year":2019},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:15.669016Z"},"links":{"cited_paper":"/paper/1908.06720","citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:37cc6832d94ee2712385b731c710acd075a54c4c62ceb2bad16b8e1bf21fb81c","observation_id":"ffb0c6c3-1d83-4438-a345-9a46428d88d5","resolution":{"observed_at":"2026-08-06T18:28:16.725488Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.439862Z","title":"A quantum interior-point method for second- order cone programming","venue":null,"work_id":"2466dcbf-7d95-4f24-9b56-07435bbc15c8","year":2019},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:15.738947Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:c5c97574bee3ab5e3b9673e51b94cf3d49f2286dbf11bb9bfbd70ed0385c306b","observation_id":"e7e1a4e6-b9e4-47cf-b93a-385b89327e71","resolution":{"observed_at":"2026-08-06T18:28:17.444600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:15.848396Z","title":"Estimating the largest eigenvalue by the power and lanczos algorithms with a random start","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:15.848396Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:9a9d7f1c2f488595faf1616cfa3ac77d890fefd51adc9dbe961e2dcd56495f20","observation_id":"6ddf94bb-fd5e-4811-ae3c-860101568856","resolution":{"observed_at":"2026-08-06T18:28:15.848396Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1309.5550","last_updated":"2014-06-27T00:20:04Z","snapshot_observed_at":"2026-07-06T03:23:37.989040Z","submitted_at":"2013-09-22T01:36:01Z","title":"The Complexity of Large-scale Convex Programming under a Linear Optimization Oracle","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1309.5550","snapshot_observed_at":"2026-08-06T18:28:15.991861Z","title":"The complexity of large-scale convex programming under a linear optimization oracle","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:15.991861Z"},"links":{"cited_paper":"/paper/1309.5550","citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:b58f954f3a0e35e2d3c7e258153ad9ff73e5874fab171e34b74ec8f5c373b878","observation_id":"311b3d9c-3954-432f-9c77-8d2edb4c2223","resolution":{"observed_at":"2026-08-06T18:28:15.991861Z","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-06T18:28:17.412598Z","title":"Conditional gradient sliding for convex optimization","venue":null,"work_id":"d63bfb5e-d16c-42c0-bf5d-8757a39fe5e4","year":2016},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.142938Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:80f9b81579a4db87be4cbcc6731954d0cd0c566653a3e195c1e77b7ac5962cad","observation_id":"7a226a10-4002-463d-a0aa-448ec4f000a6","resolution":{"observed_at":"2026-08-06T18:28:17.417220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.396863Z","title":"Constrained minimization methods","venue":null,"work_id":"50da52b7-dd30-46b6-b4fd-cc22ce255a6d","year":1966},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.196522Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:bdf13f3d9b1357b06b8b1e26e70ee182c02de5e0b90a2b1fd066c114794f8bbb","observation_id":"6746d9ed-f8e1-43a0-9737-17b453502882","resolution":{"observed_at":"2026-08-06T18:28:17.401625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.381133Z","title":"Projection free online learning over smooth sets","venue":null,"work_id":"f50e97f3-e4af-4cc8-866f-b84c1d3eae74","year":2019},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.227810Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:f46be8fe353a08ba76f176ca30630e5c0e4878ad3c034fe00f5fe21ea7cab2a6","observation_id":"db659398-4261-482a-9541-b4445da39cbe","resolution":{"observed_at":"2026-08-06T18:28:17.385862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.365193Z","title":"Sublinear quantum algorithms for training linear and kernel-based classifiers","venue":null,"work_id":"297dcdc5-af0c-4c5a-a328-6e3c48845dda","year":2019},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.260496Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:19f8a1beccce58a23010d17f1ded2d59f7191019df53c998758f4fb65e96a548","observation_id":"65b5d1e1-fa90-4db4-a82b-bdd333aa5398","resolution":{"observed_at":"2026-08-06T18:28:17.370030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.349499Z","title":"Quantum speedups of optimizing approximately convex functions with applications to logarithmic regret stochastic convex bandits","venue":null,"work_id":"7cc61cd4-8fcf-4f75-991f-6eca1df32ec2","year":2022},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.332290Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:15ebbab92fe6670dbc0594863d8116e64ad94e12e92021d6ccaa35fff2686172","observation_id":"636aa309-e0db-439d-aa5e-53f6c35092a5","resolution":{"observed_at":"2026-08-06T18:28:17.354260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.14749","last_updated":"2023-01-31T13:06:23Z","snapshot_observed_at":"2026-07-06T13:47:14.953794Z","submitted_at":"2022-08-31T09:51:32Z","title":"A Quantum Online Portfolio Optimization Algorithm","version":2},"cited_work":{"arxiv_id":"2208.14749","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.14749","snapshot_observed_at":"2026-08-06T18:28:16.675066Z","title":"A Quantum Online Portfolio Optimization Algorithm","venue":"quant-ph","work_id":"34ce0aac-ab81-4e0e-a73a-97c36101b802","year":2022},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.400338Z"},"links":{"cited_paper":"/paper/2208.14749","citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:3c1d3df415fa99e53722c2723a5a5d7f31f5c970fe3b24aaa81ce535f4ae6ba9","observation_id":"9c9d6ee5-1fd3-4582-8734-e59354fd846b","resolution":{"observed_at":"2026-08-06T18:28:16.680770Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1307.0411","last_updated":"2013-11-04T22:51:55Z","snapshot_observed_at":"2026-07-06T03:17:09.663659Z","submitted_at":"2013-07-01T15:38:12Z","title":"Quantum algorithms for supervised and unsupervised machine learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1307.0411","snapshot_observed_at":"2026-08-06T18:28:16.434520Z","title":"Quantum algorithms for supervised and unsu- pervised machine learning","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.434520Z"},"links":{"cited_paper":"/paper/1307.0411","citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:c90e497b38e77bd97733209a77c3c20302d0394fb8962b00427705e7286d27cd","observation_id":"6e1ad5bb-69bc-4f25-bc90-a599a0018592","resolution":{"observed_at":"2026-08-06T18:28:16.434520Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:16.440345Z","title":"Quantum principal component analysis","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.440345Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:2b8b1f0f5483772a9e15a4bd9bf10106810ed91754843ea44ae155463329861a","observation_id":"22c188f9-f408-48fd-84c2-8bcda0fcbf75","resolution":{"observed_at":"2026-08-06T18:28:16.440345Z","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-06T18:28:17.321572Z","title":"Critically damped quantum search","venue":null,"work_id":"66ea7c84-af5f-4b85-97b7-00d07e7171f9","year":2009},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.445202Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:e52f5ed647adaee60840165489cb4637bd18d9af94605d6bb4fc611a2aacc751","observation_id":"57f02dc2-4d00-4bc8-bbf3-af52181ba9b3","resolution":{"observed_at":"2026-08-06T18:28:17.326861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.303881Z","title":"PhD thesis, INRIA Grenoble, 2014","venue":null,"work_id":"8a6c3fbb-23ec-47d8-9f76-d5ba541d4277","year":2014},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.449715Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:0a006fff5f109bdcc978b93c2cf6ab876f9525d1e6e2dd4e4f0d6333af4152d7","observation_id":"75637da2-5d1d-4a71-bf10-e2c22bc4bd6a","resolution":{"observed_at":"2026-08-06T18:28:17.310407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.283037Z","title":"The frank-wolfe algorithm: a short introduction","venue":null,"work_id":"140af24a-60ad-4bbc-9141-58ec71b3427a","year":2023},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.454660Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:afeb400aa9a8aa74c7669f3d76e7da5c2dbcbbe6b2d1b3c46b17abac5daaa49c","observation_id":"19d0fc84-75ba-43c0-96e4-c27902025eeb","resolution":{"observed_at":"2026-08-06T18:28:17.288768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.266374Z","title":"Quantum support vector machine for big data classification","venue":null,"work_id":"f783eca5-8b2b-46d7-9a7a-4e3d2d569711","year":2014},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.459427Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:cdf44b7db40561375df1f845e091222af8b37d6bd6a3c48db213015f26468ddc","observation_id":"d0986675-1c19-46b0-ba88-2f682dfda2a9","resolution":{"observed_at":"2026-08-06T18:28:17.270934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.249436Z","title":"Quantum gradient descent and newton’s method for constrained polynomial optimization.New Journal of Physics, 21(7):073023, 2019","venue":null,"work_id":"cded78fe-89ae-4a58-bc9a-715f78a9f3b2","year":2019},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.464158Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:9a73a1310f20ca8622ef5654d4b0353647ea27a5c541fd9666c8b8e001de25bf","observation_id":"eb8236a4-e4fd-4307-9653-4d313c247bce","resolution":{"observed_at":"2026-08-06T18:28:17.254886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1506.04030","last_updated":"2017-01-27T14:48:02Z","snapshot_observed_at":"2026-07-06T04:20:44.956253Z","submitted_at":"2015-06-12T14:34:28Z","title":"Quantum search with prior knowledge","version":3},"cited_work":{"arxiv_id":"1506.04030","doi":null,"metadata_source":"pith","pith_arxiv_id":"1506.04030","snapshot_observed_at":"2026-08-06T18:28:16.625513Z","title":"Quantum search with prior knowledge","venue":"quant-ph","work_id":"10288b8c-bcf7-4454-a367-a7bdd2cbcdbf","year":2015},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.468737Z"},"links":{"cited_paper":"/paper/1506.04030","citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:9a80a6e24c54eca7d4ac3064e244aa95e82c959355e105497668fb674915f770","observation_id":"b075af6d-1966-4da7-abef-58bf3ff1b175","resolution":{"observed_at":"2026-08-06T18:28:16.633217Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.232284Z","title":"Quantum speedups for stochastic optimization","venue":null,"work_id":"433d977f-c43a-4a8d-8760-8f7a18ef4853","year":2023},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.473780Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:78883861483dd6940efde194be40bb283c90368b92abdc137593fe48d3771f67","observation_id":"60f35061-7bb8-467c-a417-fc5a7e8a1d4b","resolution":{"observed_at":"2026-08-06T18:28:17.236764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.215234Z","title":"Improvements in quantum SDP-solving with applications","venue":null,"work_id":"dc613031-fc23-41a8-8a57-a9cf77f66232","year":2019},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.479248Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:9afedd33d31ed67217c1c9372d44dcb8a318862b6112f39312d83e7b2eea57cc","observation_id":"9f681c8d-67a3-48e6-9d13-b8d8057df2e5","resolution":{"observed_at":"2026-08-06T18:28:17.220467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.03180","last_updated":"2019-04-05T17:58:44Z","snapshot_observed_at":"2026-08-01T23:20:45.000582Z","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-06T18:28:16.483639Z","title":"Quantum algorithms for zero-sum games","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.483639Z"},"links":{"cited_paper":"/paper/1904.03180","citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:b9012200e22dd04d51816667bbdc5d1ce88fb130155ec8151860b83d007a5580","observation_id":"10cfa2d1-b3f2-4580-969f-e10a90e28e8c","resolution":{"observed_at":"2026-08-06T18:28:16.483639Z","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-06T18:28:17.196697Z","title":"Quantum SDP-solvers: Better upper and lower bounds","venue":null,"work_id":"45c34ad0-e1ef-44eb-bb63-907af60c591e","year":2017},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.488497Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:bee3da173e5eb931930d5dd0e7e5b0fb2987557a4d9f9cab0dc7393d332ed881","observation_id":"3f06804d-a8a2-4553-adab-5459a057283b","resolution":{"observed_at":"2026-08-06T18:28:17.201529Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.181211Z","title":"Convex optimization using quantum oracles","venue":null,"work_id":"19d3a4eb-f141-4c49-b183-77041adf31e4","year":2020},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.493411Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:34806174ca52ed1330c136a1b5294794f3068537d923748bd469ab4453a73023","observation_id":"62085dc6-ef94-47c5-a7ab-21e9e9f76484","resolution":{"observed_at":"2026-08-06T18:28:17.186237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.165881Z","title":"Quantum multi-armed bandits and stochastic linear bandits enjoy logarithmic regrets","venue":null,"work_id":"143771ce-238e-4537-a697-3ab8989e0db1","year":2023},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.498311Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:71b56c584647c8d09f2a57f331b5b40c7e0f2f7e1895caaddf412cfcf0a59724","observation_id":"93b1bdff-9553-45b0-9eb2-f39221750ad4","resolution":{"observed_at":"2026-08-06T18:28:17.170604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.148889Z","title":"Quantum exploration algorithms for multi-armed bandits","venue":null,"work_id":"e609f86a-172e-437b-b03c-6a0c5582ea02","year":2021},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.503000Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:79bd9fdf3163b8554ee2af237f3856ea5581c4ed119783f0e86548493c5ef812","observation_id":"fff3117b-c0ca-4596-9346-d8239e86a30a","resolution":{"observed_at":"2026-08-06T18:28:17.153889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.130435Z","title":"Convergence theory in nonlinear programming","venue":null,"work_id":"9aec30d8-170d-44c8-82a3-bfeefe75753d","year":1970},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.507044Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:02625b068bf782cf90f8a2eb004e962bf9c646104bb38ebb6009fe8aeb60fc34","observation_id":"8a2fc94c-de27-4799-9e16-47abc409891c","resolution":{"observed_at":"2026-08-06T18:28:17.136553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:16.511399Z","title":"Quantum linear system algorithm for dense matrices","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.511399Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:6d07ec31930e376bf691b19b9b91371989c743d74ded2a3621eb67953579e7db","observation_id":"9cc7f2df-19b5-4947-9870-3e719bf44d5c","resolution":{"observed_at":"2026-08-06T18:28:16.511399Z","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-06T18:28:17.098813Z","title":"Efficient projection-free online meth- ods with stochastic recursive gradient","venue":null,"work_id":"eb8821d4-cf59-44da-9103-b1b7e3c9862c","year":2020},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.515931Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:761b9c2663f9da0e47b465684822b6baac553099a1be48ef20146a06950f5628","observation_id":"9b031dd8-fcd8-4725-9d58-54c01c1cc435","resolution":{"observed_at":"2026-08-06T18:28:17.104122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.070026Z","title":"Fixed-point quantum search with an optimal number of queries","venue":null,"work_id":"7aef5e50-22c5-4fee-9a42-758aeaec37ea","year":2014},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.520369Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:451fc06973dd518310d54d28d85c65af3c61f60ef412b66c91b585e92ca77ebc","observation_id":"b6288872-8137-4dcf-9063-a5269dbf92b1","resolution":{"observed_at":"2026-08-06T18:28:17.083273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.051707Z","title":"Conditional gradient methods via stochastic path- integrated differential estimator","venue":null,"work_id":"beb71c52-5335-4e05-90ee-885ad5833af8","year":2019},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.524782Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:9ab74d9949b0bda3947b70bf207014b1c01f2c1472e655482b1b02e124e5b042","observation_id":"03f5505f-7e43-406a-bedb-5889f7ad2e00","resolution":{"observed_at":"2026-08-06T18:28:17.057754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.027611Z","title":"Quantum lower bounds for finding stationary points of nonconvex functions","venue":null,"work_id":"fb5ae19f-0e26-469d-8afc-17518578b6a4","year":2023},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.529530Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:d467fe4c643bcab12f8c026ee80bf643cea054e8e06343a49351d5982630b16b","observation_id":"22700cbe-8aeb-4343-b35e-28a86028c21b","resolution":{"observed_at":"2026-08-06T18:28:17.033076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:17.009214Z","title":"One sample stochas- tic frank-wolfe","venue":null,"work_id":"28097d5a-ede3-4289-bef6-8ce1b0cba285","year":2020},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.534089Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:19c2cb4b9c56a01da141c665cdbb8d065e56aee29387bf01b68ecab513a67f9c","observation_id":"d683ab8d-f5c6-451d-869f-055fa6153263","resolution":{"observed_at":"2026-08-06T18:28:17.015129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:16.989780Z","title":"Accelerated training for matrix-norm regulariza- tion: A boosting approach","venue":null,"work_id":"e495dd75-6078-4fd7-b804-79621086907c","year":2012},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.538635Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:d75e750419e654cb2e4309c7e7be4681019264a6f9c81de16626161b2e73145a","observation_id":"68e2816c-5122-4a5f-930d-b9ca848c3ff8","resolution":{"observed_at":"2026-08-06T18:28:16.995951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:16.972177Z","title":"Quantum algorithms and lower bounds for finite-sum optimization","venue":null,"work_id":"93db46d8-6fd3-4fac-9f5e-a428ec30ad73","year":2024},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.543159Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:e2300b6579343e258e04d062dbd08ba99a9aa11ccfe8ce188a3b009aae7daa4c","observation_id":"b14ea096-c1f3-49c1-b324-9203129be1e4","resolution":{"observed_at":"2026-08-06T18:28:16.976919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:16.954472Z","title":null,"venue":null,"work_id":"993b810f-215b-4c58-b90f-29414f6ebf6c","year":null},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.548635Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:2802a1ffb3c29235396c2ed4cc878d3b34d29f60b250843ce52c6e8f63b60f84","observation_id":"c1309e01-ec93-4903-b433-e4bd7590b2ea","resolution":{"observed_at":"2026-08-06T18:28:16.959537Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:16.933626Z","title":null,"venue":null,"work_id":"5a371724-a279-43b1-a3dd-e9d606469e49","year":null},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.553511Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:90c5f007ee97e87c24fa0337e7276aed584dec3cb2ebce938c4313598d79d107","observation_id":"e4a8dd0f-e9f9-415f-9cc1-10bcffb1a6f2","resolution":{"observed_at":"2026-08-06T18:28:16.939317Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:16.912554Z","title":null,"venue":null,"work_id":"daabb6de-e9f9-4526-9e35-410a43ad191b","year":null},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.558034Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:e2c4e4eedb809a921ee5238a74fbbe8fc8abfe6d7f7fe8d329c5fa909e31b085","observation_id":"132a38cd-ba45-4394-b14a-2025906f7180","resolution":{"observed_at":"2026-08-06T18:28:16.917708Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:28:16.890561Z","title":"By Theorem 1 of [24], the algorithm finds the minimum gi(x) with probability 1 /2, O( √ d) applications of Ug, U † g and O( √ d) elementary gates","venue":null,"work_id":"1de34780-e3fa-4644-a672-59f004e0e2f9","year":2019},"citing_paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-06T18:28:16.563095Z"},"links":{"citing_paper":"/paper/2507.08543"},"observation_digest":"sha256:d3049043a51571e9263c33000bbd6557458006d563b37a042cd2bd8180bd4f70","observation_id":"059cf5d3-b131-4dc1-8813-1e95ddbff5fd","resolution":{"observed_at":"2026-08-06T18:28:16.896004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.08543","last_updated":"2025-07-11T12:43:58Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-06T18:14:07.203517Z","submitted_at":"2025-07-11T12:43:58Z","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization"},"reference_resolution":{"displayed":84,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":4,"verified_fuzzy":60},"total_outbound_references":84},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 84 of 84 outbound references and 0 inbound Pith citation observations for arXiv:2507.08543."}