{"as_of":"2026-08-19T21:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7d07248ac440a97c5a0951ad92a19253a887c777228b6f1ebea794bae2a30fbf","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T20:54:16.401959Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-22T04:22:05.402926Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T04:24:35.404663Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"cited_work":{"arxiv_id":"2602.22608","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.22608","snapshot_observed_at":"2026-07-15T02:22:01.225620Z","title":"Grimmer, N","venue":null,"work_id":"33f9686a-3e22-42b9-b0ab-bb9e8f5cb731","year":2026},"citing_paper":{"arxiv_id":"2605.08850","last_updated":"2026-05-09T10:03:24Z","snapshot_observed_at":"2026-08-14T10:25:32.490837Z","submitted_at":"2026-05-09T10:03:24Z","title":"Local LMO: Constrained Gradient Optimization via a Local Linear Minimization Oracle","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-12T01:18:15.063363Z"},"links":{"cited_paper":"/paper/2602.22608","citing_paper":"/paper/2605.08850"},"observation_digest":"sha256:b5afe1e91b8978189b0b04f1154185f40222602596e8cc96a5645edcf1046874","observation_id":"c8e5c149-2789-4f62-a309-806e0f36d9db","resolution":{"observed_at":"2026-07-15T02:22:01.225620Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"cited_work":{"arxiv_id":"2602.22608","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.22608","snapshot_observed_at":"2026-07-15T02:22:01.225620Z","title":"Grimmer, N","venue":null,"work_id":"33f9686a-3e22-42b9-b0ab-bb9e8f5cb731","year":2026},"citing_paper":{"arxiv_id":"2605.22539","last_updated":"2026-05-21T14:25:34Z","snapshot_observed_at":"2026-08-18T08:41:00.460915Z","submitted_at":"2026-05-21T14:25:34Z","title":"A conditional-gradient-based single-loop augmented Lagrangian method for inequality constrained optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-22T04:22:05.402926Z"},"links":{"cited_paper":"/paper/2602.22608","citing_paper":"/paper/2605.22539"},"observation_digest":"sha256:65c78013710e7a7ff6d91b4530f68ba11c48fdf1cbf4db27c4bb2e4ce4acfd70","observation_id":"8a86808c-2533-4488-845c-1642e7f93a86","resolution":{"observed_at":"2026-07-15T02:22:01.225620Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2602.22608/citation-record","integrity":"/paper/2602.22608/integrity","json":"/paper/2602.22608/citation-record.json","paper":"/paper/2602.22608"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T20:54:13.930005Z","title":"Faster rates for the Frank-Wolfe method over strongly-convex sets","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:13.930005Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:e63c1607a2ec3357b5ad3328d7744a0cdd95a36391fb359880975ac718c1714e","observation_id":"d8dee3c2-d3c0-412b-9e79-d24efb3a9c46","resolution":{"observed_at":"2026-08-02T20:54:13.930005Z","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-02T20:54:14.013136Z","title":"Combettes, Hamed Hassani, Amin Karbasi, Aryan Mokhtari, and Sebastian Pokutta.Conditional gradient methods: From core principles to AI applications","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:14.013136Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:c3c6b6467602bc0c01835987771593b00e0fe12cc24b7189f27b2b04e26572d7","observation_id":"d36aed1e-601b-4ccf-ac2d-5efc346a990e","resolution":{"observed_at":"2026-08-02T20:54:14.013136Z","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-02T20:54:14.085523Z","title":"Strong convexity of sets and functions.Journal of Mathematical Economics, 9(1-2):187–205, 1982","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:14.085523Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:be96b5ba9a092f8b413c2d72030c62469a261cbeecd0a946446a152b194aa776","observation_id":"9c6297e7-6bba-4cb2-8836-874a954b3b4f","resolution":{"observed_at":"2026-08-02T20:54:14.085523Z","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-02T20:54:14.174782Z","title":"Gauges and accelerated optimization over smooth and/or strongly convex sets, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:14.174782Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:03e5cd2f0d21b896e7c29d737b08f49a06fd562cea424aed92706dd891d232f8","observation_id":"e9fcc2f5-03aa-47b6-8610-7202eda7f380","resolution":{"observed_at":"2026-08-02T20:54:14.174782Z","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-02T20:54:14.258833Z","title":"On the global linear convergence of Frank-Wolfe optimization variants.Advances in neural information processing systems, 28, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:14.258833Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:15c0bcbb7e4364f1e589db13d1b26bf8b1c057667ac2c5386d303eb232366628","observation_id":"8a2e9c80-833f-445a-bd2b-352ebf33aba1","resolution":{"observed_at":"2026-08-02T20:54:14.258833Z","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-02T20:54:14.370185Z","title":"Linearly convergent away-step conditional gradient for non-strongly convex functions.Mathematical Programming, 164(1):1–27, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:14.370185Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:eb898c725bb88452319e320fb74ebc2b750e2e511b1fa3cd26033743cf31cd97","observation_id":"e7b67b21-8e77-499d-aea7-b52595a253af","resolution":{"observed_at":"2026-08-02T20:54:14.370185Z","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-02T20:54:14.471893Z","title":"Pairwise conditional gradients without swap steps and sparser kernel herding","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:14.471893Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:88ecb6d71418b9993f4bc96e8478cd70d3398d967a92c64cf2b362c000895f26","observation_id":"317cbcce-9207-4016-b214-f2507396b8c5","resolution":{"observed_at":"2026-08-02T20:54:14.471893Z","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-02T20:54:14.541297Z","title":"An extension of the Frank and Wolfe method of feasible directions.Mathematical Programming, 6(1):14–27, 1974","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:14.541297Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:4d2ce455f90caf4ee30ac57a4dfdb3d813861f847e4fcbeb28a7c371f63f4ff5","observation_id":"5db4e90d-093c-4052-9045-4d632900f248","resolution":{"observed_at":"2026-08-02T20:54:14.541297Z","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-02T20:54:14.595759Z","title":"Blended conditional gradients","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:14.595759Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:76973c6289fead48f21716680f49234f1bbd146fdee33370b2c6725cda379eaa","observation_id":"a78067b9-9fbf-4134-9e47-072d0207b0ea","resolution":{"observed_at":"2026-08-02T20:54:14.595759Z","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-02T20:54:14.679315Z","title":"An algorithm for quadratic programming.Naval research logistics quarterly, 3(1-2):95–110, 1956","venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:14.679315Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:1f7d16f0998cbf49edf80427de61aafe30ff320803c597c21dc428ae1bdd68cc","observation_id":"3f2bb55d-d024-405a-8f2c-40fcd2e66b11","resolution":{"observed_at":"2026-08-02T20:54:14.679315Z","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-02T20:54:14.793084Z","title":"Revisiting Frank-Wolfe: Projection-free sparse convex optimization","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:14.793084Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:05892454259d1ab99e176acb35b7c9eb4d398ddbacecd9e5ce9514248141d37a","observation_id":"05ea03db-1653-4407-8497-a2cdf3a45866","resolution":{"observed_at":"2026-08-02T20:54:14.793084Z","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-02T20:54:14.859475Z","title":"The complexity of large-scale convex programming under a linear optimization oracle,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:14.859475Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:6c985abc91aa7b978a1edb6504c4f314f7b3ce9cbe028b28cf02dfef52c2b25c","observation_id":"739e71b5-061a-4684-92b7-1f9ce288d2a0","resolution":{"observed_at":"2026-08-02T20:54:14.859475Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.04378","last_updated":"2026-06-23T14:33:11Z","snapshot_observed_at":"2026-08-03T04:48:06.505997Z","submitted_at":"2026-02-04T09:55:44Z","title":"Lower Bounds for Frank-Wolfe on Strongly Convex Sets","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.04378","snapshot_observed_at":"2026-08-02T20:54:14.916202Z","title":"Lower bounds for Frank-Wolfe on strongly convex sets, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:14.916202Z"},"links":{"cited_paper":"/paper/2602.04378","citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:0ba363bb2bf47509e39c4dfdbd57b65be3610d1c0112493165109ad329cd61ca","observation_id":"fbede5de-13da-4bda-8854-a54beca3658f","resolution":{"observed_at":"2026-08-02T20:54:14.916202Z","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-02T20:54:15.041398Z","title":"Wiley-Interscience Series in Discrete Mathematics","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:15.041398Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:29e151b55633e66260e37b26d6ed3b7a3e19a22222733264c6f087e58448b095","observation_id":"471ecd9e-9d98-475a-a5ef-b6ed1dc4ab95","resolution":{"observed_at":"2026-08-02T20:54:15.041398Z","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-02T20:54:15.170766Z","title":"Performance of first-order methods for smooth convex minimization: a novel approach.Mathematical Programming, 145(1):451–482, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:15.170766Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:938aa3139f4602be5a46f2e9a1cd9e54e35d0d289b0fb993f5846fb86cb3e6b8","observation_id":"47b54ac1-2406-4bef-ad4b-18b749f84d30","resolution":{"observed_at":"2026-08-02T20:54:15.170766Z","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-02T20:54:15.226556Z","title":"Smooth strongly convex interpolation and exact worst-case performance of first-order methods.Mathematical Programming, 161:307–345, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:15.226556Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:ea283a74437c0b6a4f9e76d6d698792720994ad5259cc8ead47d796ee02b4d80","observation_id":"07209d1a-2625-4d88-9c4e-dd3cf133cef7","resolution":{"observed_at":"2026-08-02T20:54:15.226556Z","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-02T20:54:15.301126Z","title":"Exact worst-case performance of first-order methods for composite convex optimization.SIAM Journal on Optimization, 27(3):1283–1313, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:15.301126Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:3cdb661e6f656b14f8083a7406aba31f25fb5df53502ab15700493d16b344e9b","observation_id":"82cf32f5-ab38-4155-a0e3-5bb9813bd1f6","resolution":{"observed_at":"2026-08-02T20:54:15.301126Z","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-02T20:54:15.371394Z","title":"Optimized first-order methods for smooth convex minimization","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:15.371394Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:6018923c96456ec5a59739860385889a37169b92af38af6b6b0bebaeb92370e9","observation_id":"a80aa2c4-7898-4bdb-9502-bab6852d8e06","resolution":{"observed_at":"2026-08-02T20:54:15.371394Z","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-02T20:54:15.467766Z","title":"The exact information-based complexity of smooth convex minimization.Journal of Complexity, 39:1–16, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:15.467766Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:dc08f97737aecf899853324e1fd3a09699609d9acba915c3b3f3db820a226249","observation_id":"42e5b682-9f14-4d73-96b4-911ccc9e5fc4","resolution":{"observed_at":"2026-08-02T20:54:15.467766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14811","last_updated":"2026-06-02T19:30:06Z","snapshot_observed_at":"2026-08-16T13:07:55.168246Z","submitted_at":"2024-10-18T18:32:33Z","title":"Performance Estimation for Smooth and Strongly Convex Sets","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.14811","snapshot_observed_at":"2026-08-02T20:54:15.532939Z","title":"Performance estimation for smooth and strongly convex sets, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:15.532939Z"},"links":{"cited_paper":"/paper/2410.14811","citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:894f8cbb4eb686996e566adefbe90f92eb2dd25b0c53bcd8a9b2a23ae0b23577","observation_id":"f6c80078-b47b-452b-a0ef-7f574673ab4c","resolution":{"observed_at":"2026-08-02T20:54:15.532939Z","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-02T20:54:15.580450Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:15.580450Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:335e505415446fa8598fc0ddd808e17bd889e6dac59644ec3a6dabc414bfbb46","observation_id":"45ea1120-1a70-41b2-a379-827b98ab6419","resolution":{"observed_at":"2026-08-02T20:54:15.580450Z","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-02T20:54:15.678295Z","title":"Accelerated affine-invariant convergence rates of the Frank–Wolfe algorithm with open-loop step-sizes.Mathematical Programming, 214(1–2):201–245, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:15.678295Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:eb7e736289bb9feb60b7c1866444541857c16dd1d7f043c000396774fec59240","observation_id":"c57d9d19-820c-461b-99ad-bd74ed33588d","resolution":{"observed_at":"2026-08-02T20:54:15.678295Z","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-02T20:54:15.767364Z","title":"Fast convergence of Frank-Wolfe algorithms on polytopes.Mathematics of Operations Research, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:15.767364Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:2dfb112a3bc6fe236800e227ef8b1bb3660d42b5e0aab9c82959895bc596c8db","observation_id":"1e54f890-160a-446b-afc7-849a37e2a98d","resolution":{"observed_at":"2026-08-02T20:54:15.767364Z","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-02T20:54:15.813131Z","title":"Efficient","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:15.813131Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:3a8397afd678e9f98fc0286bc57b8837158ca03cd35db626ea9edaab5ad89012","observation_id":"a52fa30f-2d29-4fa1-aa6c-b54d43aac9aa","resolution":{"observed_at":"2026-08-02T20:54:15.813131Z","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-02T20:54:15.887330Z","title":"Radial duality part i: foundations.Mathematical Programming, 205(1–2):33–68, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:15.887330Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:efbee763b7e9d2c55300273a138d851c7398a32bb8bcb23eb64d1d838090b588","observation_id":"df27f66d-21de-4752-ab77-25176044874b","resolution":{"observed_at":"2026-08-02T20:54:15.887330Z","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-02T20:54:15.939548Z","title":"Radial duality part ii: applications and algorithms.Mathematical Programming, 205(1–2):69–105, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:15.939548Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:794a5d4d2c9cc1e6d0a7269518c02024819cec6973e5319b51d41ca8f82e775c","observation_id":"61f704f1-4737-4812-9d56-4e8816fda962","resolution":{"observed_at":"2026-08-02T20:54:15.939548Z","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-02T20:54:16.088566Z","title":"Efficient projection-free online convex optimization with membership oracle","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:16.088566Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:35e8e78c4eb29d7efb6ddf02dce2b4a13f47e80c4de3251c131b6ac66ba76579","observation_id":"1c3ea8da-cf99-4df1-98e9-9f0a02cc090b","resolution":{"observed_at":"2026-08-02T20:54:16.088566Z","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-02T20:54:16.221936Z","title":"Projection-free adaptive regret with membership oracles","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:16.221936Z"},"links":{"citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:2976723cf49375093e77baf01bfd65c4ba1a1a17d7a0d0c6527d174fd91781f9","observation_id":"4cfb1910-3582-4800-908a-d92e389d1298","resolution":{"observed_at":"2026-08-02T20:54:16.221936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.13688","last_updated":"2024-04-29T20:43:31Z","snapshot_observed_at":"2026-08-16T14:07:59.172849Z","submitted_at":"2024-03-20T15:51:03Z","title":"Scalable Projection-Free Optimization Methods via MultiRadial Duality Theory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.13688","snapshot_observed_at":"2026-08-02T20:54:16.401959Z","title":"Scalable projection-free optimization methods via multira- dial duality theory, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T20:54:16.401959Z"},"links":{"cited_paper":"/paper/2403.13688","citing_paper":"/paper/2602.22608"},"observation_digest":"sha256:d86c5e6fb4350346af3f8f769b354ed7b4d119fc242aad282807cee73a9c35a7","observation_id":"719b0960-98e8-4494-9996-eb6172484432","resolution":{"observed_at":"2026-08-02T20:54:16.401959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.22608","last_updated":"2026-07-14T11:34:23Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-17T18:43:03.515032Z","submitted_at":"2026-02-26T04:29:27Z","title":"Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":29,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":29},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 2 inbound Pith citation observations for arXiv:2602.22608."}