{"as_of":"2026-08-22T18:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:298fd570fa8a2cd77cd123bc503a20c3e0ace845f497c67fb193995b30e5b09f","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:32:24.025776Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2505.09886/citation-record","integrity":"/paper/2505.09886/integrity","json":"/paper/2505.09886/citation-record.json","paper":"/paper/2505.09886"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:32:24.885855Z","title":"Unsupervised learning from narrated instruc- tion videos","venue":null,"work_id":"ce736a0a-b7d7-466c-9b2d-05b8e17adfc8","year":2016},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.772746Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:bc04eafebda0b913ef7f20f6a0719ac36ff4b501882d7c84ea5923afcd474f02","observation_id":"b2ae5903-ae20-44a7-9aea-31a72aa2f8a4","resolution":{"observed_at":"2026-08-15T21:32:24.890709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.870983Z","title":"Linear convergence of a Frank-Wolfe type algorithm over trace-norm balls","venue":null,"work_id":"3535bdb2-8b91-4f74-8f09-ac371acb0bb5","year":2017},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.778326Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:49166185ffa8c6d4428d9c6f783a6cdab3c64051ff06873a82201c4ce016cdf2","observation_id":"28dc23d3-2ae7-436f-8ccb-1db29e8a8c38","resolution":{"observed_at":"2026-08-15T21:32:24.875998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.856392Z","title":"Learning with submodular functions: A convex optimization perspective","venue":null,"work_id":"1fe62c88-82d3-42c4-8510-eb89ee1f3666","year":2013},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.783658Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:6b43021108af32dff124aaa903eedc24e7c8cc38db6706ee2a26cc5fd52a5574","observation_id":"ecee689d-41c2-404c-a4b4-2306c2da5e0c","resolution":{"observed_at":"2026-08-15T21:32:24.860797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.841202Z","title":"On the equiva- lence between herding and conditional gradient algorithms","venue":null,"work_id":"5e8693e7-83ba-484e-a555-305a2aa57083","year":2012},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.789429Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:8ddd53353836c70ccbef33427f7167a6a80603ecb2db1883d2a3d18dd3b57024","observation_id":"d03db833-0515-4a6f-8074-2ade3f8b5437","resolution":{"observed_at":"2026-08-15T21:32:24.846184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.826432Z","title":"Distribution-based sketching of single-cell samples","venue":null,"work_id":"4b0e01ab-79b4-4b3c-aaa6-1b1f14ea7649","year":2022},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.795311Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:82596e2388a6fde813cd9256b5d41055b49daf99dac5a69c5bb7de001080fd78","observation_id":"cb2c12c5-6952-439d-a376-ba332883f9e0","resolution":{"observed_at":"2026-08-15T21:32:24.831083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.810392Z","title":"Frankwolfe","venue":null,"work_id":"c39ce3d2-e3b7-4fa6-8a99-52af5b042638","year":2022},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.800309Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:a9a3c3a568e5f2b127a6e950e1678949b796fddc6bd024016f3b5a9b617811b9","observation_id":"8c959e00-9326-4956-a780-57b0f809e0bc","resolution":{"observed_at":"2026-08-15T21:32:24.815186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.793906Z","title":"Guaranteed non-convex optimization: Submodular maximization over continuous domains","venue":null,"work_id":"c98beb7e-cca0-4995-9a01-b7a0b4140684","year":2017},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.806524Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:71ec7356a1cfe335b7ec94676bf7657115fbe31f29adc909fbfee4c64482f00e","observation_id":"4c65d422-369d-419c-bc96-33abb400071c","resolution":{"observed_at":"2026-08-15T21:32:24.799496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.777802Z","title":"Weakly-supervised alignment of video with text","venue":null,"work_id":"9c6d18a2-8dc4-49f0-8582-9571c5fed664","year":2015},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.811518Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:055e61ad3aff94433a5332f1b4d015a509dced3bc7bc34c05a6efe16e35fad63","observation_id":"c2b9eb7a-0b00-45c9-b25a-a551542a65e3","resolution":{"observed_at":"2026-08-15T21:32:24.782883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.14103","last_updated":"2025-08-01T13:28:50Z","snapshot_observed_at":"2026-08-19T12:40:20.944470Z","submitted_at":"2022-11-25T13:36:11Z","title":"Conditional Gradient Methods","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.14103","snapshot_observed_at":"2026-08-15T21:32:23.816703Z","title":"Conditional gradient methods","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.816703Z"},"links":{"cited_paper":"/paper/2211.14103","citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:58e419347be572dc8774db1eb2d2d7d4e32d6ab8d5976f64b0a81a069a373139","observation_id":"8c5a0a1a-1a00-4270-8c9c-4ff5d757b1e9","resolution":{"observed_at":"2026-08-15T21:32:23.816703Z","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-15T21:32:24.762679Z","title":"Nonnegative tensor comple- tion via integer optimization","venue":null,"work_id":"6f69b82a-71ae-47da-b645-96dba8b6f530","year":2022},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.822908Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:cec2584357b2513c96bb0b7c590511fda2100428d7b900e7cafe2b7b03748974","observation_id":"a29eef76-7e1e-4021-a7e0-033353b01eee","resolution":{"observed_at":"2026-08-15T21:32:24.767511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.746999Z","title":"Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions","venue":null,"work_id":"a0063d0f-44cb-41eb-8e14-d0791474d633","year":2021},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.828218Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:3302af1a24f89f7280d00cd1888efa2ab421e9e1cb16779c4b02094719574b25","observation_id":"1e926ba2-960d-4723-8056-9fca288fa67b","resolution":{"observed_at":"2026-08-15T21:32:24.752046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.731064Z","title":"Sublinear optimization for machine learning","venue":null,"work_id":"454992c1-dc6e-446f-8594-ec1b54c6d0f0","year":2012},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.833021Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:92dd3f064467c2ec9ad63cfad012998b845996c5f65fde3013b3a31b812ac6d7","observation_id":"e4d86f97-b642-4c4f-8172-993cf8068ca4","resolution":{"observed_at":"2026-08-15T21:32:24.736040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.715392Z","title":"Complexity of linear minimization and projection on some sets","venue":null,"work_id":"5d75b41d-7cc1-4dba-8986-2020a5ff5213","year":2021},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.837825Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:69430df55be37ad5b3b3c22502e6f3e294273af6071bc19d96d8c2b1c5e7c8aa","observation_id":"904da948-70b6-42d1-ac65-05605e36443f","resolution":{"observed_at":"2026-08-15T21:32:24.720422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:23.842394Z","title":"Conditional gradient algorithms with open loop step size rules","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.842394Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:3dc4579b7ec9256c4a21360e0936c8f32812d80e6dbb17a7fe5e78971d9e833c","observation_id":"1731ddd1-9725-4f91-9f2d-0365459605e2","resolution":{"observed_at":"2026-08-15T21:32:23.842394Z","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-15T21:32:24.689242Z","title":"An algorithm for quadratic programming","venue":null,"work_id":"45f17aae-7c13-458a-bf19-0c479c37aaec","year":1956},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.847268Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:aadb4209924f80d3efb1bda802365805ecbab6a970252f21b4878647b6cff3ab","observation_id":"a96eae05-c876-4845-af48-ff679d40f095","resolution":{"observed_at":"2026-08-15T21:32:24.694170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.674199Z","title":"An extended Frank-Wolfe method with “in-face” directions, and its application to low-rank matrix comple- tion","venue":null,"work_id":"9b2edb60-fd42-4f3a-9a48-7742f3126647","year":2017},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.852328Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:56833d7dc3903a38a314f252a4587ce124652b4744f6968651c90d074ebb9fe6","observation_id":"f34a56cb-9e99-4cba-8ec9-9074619f10bc","resolution":{"observed_at":"2026-08-15T21:32:24.679172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.658869Z","title":"Faster rates for the Frank-Wolfe method over strongly-convex sets","venue":null,"work_id":"3b810bd1-73be-4d73-8ad1-64b9350a24b4","year":2015},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.857164Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:25d9ca983bce61a2a76d224372281ba80f21f79c24a7440d78693bc0f000016b","observation_id":"ae1333e3-b5bf-4177-b442-624fae774d78","resolution":{"observed_at":"2026-08-15T21:32:24.664061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.644442Z","title":"Linear-memory and decomposition-invariant linearly convergent conditional gradient algorithm for structured polytopes","venue":null,"work_id":"90bff5f1-55e7-4365-a876-9a5e375e069c","year":2016},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.861749Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:a790eba1ce89ea866fab582c3d7334cce899a9466298732a90def2d169c7f208","observation_id":"22981e09-a295-4069-ab52-6c69d593d43a","resolution":{"observed_at":"2026-08-15T21:32:24.649308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.05581","last_updated":"2019-11-15T19:27:35Z","snapshot_observed_at":"2026-08-14T19:45:32.643701Z","submitted_at":"2018-02-15T14:48:23Z","title":"Improved Complexities of Conditional Gradient-Type Methods with Applications to Robust Matrix Recovery Problems","version":3},"cited_work":{"arxiv_id":"1802.05581","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.05581","snapshot_observed_at":"2026-08-15T21:32:24.132386Z","title":"Improved Complexities of Conditional Gradient-Type Methods with Applications to Robust Matrix Recovery Problems","venue":"cs.LG","work_id":"4e7c83e8-2cb3-4f5e-9db8-512a4d272c91","year":2018},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.866344Z"},"links":{"cited_paper":"/paper/1802.05581","citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:bed0ed40d02ff646e71b100ea11069f1e894e0e0d45988d8cce702c78a977dd2","observation_id":"c0fc55d6-0fe0-4295-967b-b6c88c73e936","resolution":{"observed_at":"2026-08-15T21:32:24.137819Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.628870Z","title":"Conditional gradient type methods for composite nonlinear and stochastic optimization","venue":null,"work_id":"8cc29517-fee8-4e7b-abd0-2a71633513f4","year":2019},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.871164Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:cf70ebd0f0e4e3df6e0beba46951936e14d9c68d44f6744106dc60115c726694","observation_id":"2012f44d-ca62-4bd2-9cce-228956c7e67c","resolution":{"observed_at":"2026-08-15T21:32:24.633847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.612264Z","title":"Efficient sparse low-rank tensor completion using the Frank-Wolfe algorithm","venue":null,"work_id":"fe82cc62-8c8d-4b4e-a69d-7580214aec97","year":2017},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.875866Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:4d72c676edecee392a133f0a0a2bcbc4206b50c38cc699e04f6f390e5426d02c","observation_id":"27b862da-e7af-40a5-87ed-7245950c1ebd","resolution":{"observed_at":"2026-08-15T21:32:24.617531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.597203Z","title":"The movielens datasets: History and context","venue":null,"work_id":"4cecbbd7-70e3-4f00-b3b8-be514e460a92","year":2015},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.880343Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:227ddc379c31049cb25d3d2e4925321d2ccdcf7f943169be894713bfc4716438","observation_id":"00b77467-8d09-4ee4-8003-6ca8cd2f569b","resolution":{"observed_at":"2026-08-15T21:32:24.601951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.582066Z","title":"An extension of the Frank and Wolfe method of feasible directions","venue":null,"work_id":"a96ef0ef-29d1-4ef4-a97e-2071400b69e0","year":1974},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.884986Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:d8770001e25617f241cf274e08169ef55748cc177dc12610e76388f3fb0e5109","observation_id":"b45a6eb0-b044-4620-ba8a-e5a9adeb58d2","resolution":{"observed_at":"2026-08-15T21:32:24.587041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.566625Z","title":"Robust estimation of a location parameter","venue":null,"work_id":"1d0e6ff9-0a64-48ef-822a-ff2fd72b965d","year":1992},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.889708Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:58e6fe77ef0c06f47c331ebd6189117805173b9e5298b9fba49058a0a704e1a0","observation_id":"bde422f9-0fa9-4294-a703-2f4255d61104","resolution":{"observed_at":"2026-08-15T21:32:24.571421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.551698Z","title":"Revisiting Frank-Wolfe: Projection-free sparse convex optimization","venue":null,"work_id":"1c688250-370d-4933-ac13-3158843b6397","year":null},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.894429Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:c9ca2304eb3ec1ffa2c768eeba68ddb6f83f53cab881783d29f6634ed72fab07","observation_id":"89426804-e414-40a2-b2f5-f2b64d52acca","resolution":{"observed_at":"2026-08-15T21:32:24.556494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.536567Z","title":"Efficient image and video co- localization with Frank-Wolfe algorithm","venue":null,"work_id":"766963a6-33e4-4460-addd-7c905c13855f","year":2014},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.899918Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:6cc6529234a770b6ed054c22866350336f6b0dcd2b5b2d70a524ac8f7a143dce","observation_id":"9e8a014d-4298-417e-8e11-318c0fec060b","resolution":{"observed_at":"2026-08-15T21:32:24.541569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.521709Z","title":"Projection- free optimization on uniformly convex sets","venue":null,"work_id":"5b630741-7d46-4a47-baa3-3dbb664ccd5e","year":2021},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.904462Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:81b4827daaee10487cb4ec445978829bdc84a30c65154ea3e1f9189529d4183c","observation_id":"8ab98212-17b4-4346-9c42-e38f57f0258e","resolution":{"observed_at":"2026-08-15T21:32:24.526644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.506858Z","title":"On the global linear convergence of Frank- Wolfe optimization variants","venue":null,"work_id":"0c8e66c9-c452-4ce1-9bbb-fa4dbd57f03f","year":2015},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.908913Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:038510ef72c372184a53c0b9b919c296a0715278abf3a2de159de6b75320a0b7","observation_id":"f43cf33b-a719-4e4b-a0d7-c5eb5cc00c2d","resolution":{"observed_at":"2026-08-15T21:32:24.511627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.491995Z","title":"Block- coordinate Frank-Wolfe optimization for structural svms","venue":null,"work_id":"287ffb18-cea2-4732-950d-e8a7f2869766","year":2013},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.913624Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:3b41bee6ed1f2e5dbdc8d2a2ac877dc5a17930bc6b8804c53878c5bd3be31560","observation_id":"90ebbf0f-2c13-49d4-99d0-07eace88d376","resolution":{"observed_at":"2026-08-15T21:32:24.496790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.477012Z","title":"Sequential kernel herd- ing: Frank-Wolfe optimization for particle filtering","venue":null,"work_id":"a5500003-d303-421a-8f50-31f8a1362b7d","year":2015},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.918172Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:074e51564d06fd891b2a219c286582747fda8ff7046872b3df9e700aa733f76c","observation_id":"56094829-ddbe-4e9d-8a1d-b8d5c56f3cf4","resolution":{"observed_at":"2026-08-15T21:32:24.481856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1309.5550","last_updated":"2014-06-27T00:20:04Z","snapshot_observed_at":"2026-08-19T18:55:42.761404Z","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-15T21:32:23.922816Z","title":"The complexity of large-scale convex programming under a linear optimization oracle","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.922816Z"},"links":{"cited_paper":"/paper/1309.5550","citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:30213c43ce208e3affdeedefaf9000bf58e7e0d552f4b423939c28531e3c68fc","observation_id":"fd1df35f-2832-4bcf-9adc-d6be7074fd4d","resolution":{"observed_at":"2026-08-15T21:32:23.922816Z","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-15T21:32:24.462292Z","title":"Constrained minimization methods","venue":null,"work_id":"50a0214b-a656-496b-97f5-238a098aeacd","year":1966},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.928245Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:fe93a9d22094c7f8fc074b5fde9dcca9cad1fab3f6aa9b272b597f38ddf5c2cc","observation_id":"2b42f573-0935-49b3-97bc-3bf24efe106a","resolution":{"observed_at":"2026-08-15T21:32:24.466804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.447108Z","title":"A momentum-guided Frank-Wolfe algorithm","venue":null,"work_id":"7467e45a-5e2d-4af8-8d17-e58a359be0b6","year":2021},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.933198Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:99e55efbd5e7cffb3ea2c4e6c0aece35b4f6d3ce2a7db25fd76e890ebc0e59b2","observation_id":"ad01e388-3655-4ca5-a512-814cccd1faeb","resolution":{"observed_at":"2026-08-15T21:32:24.451879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.432155Z","title":"Robust collaborative filtering","venue":null,"work_id":"41d9a12b-3512-491b-8c2d-7a2dffdf087e","year":2007},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.938068Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:c8c0b336c21eabd8eb476e580d12ac8be4b7d2736bb9e475b4c9478663101184","observation_id":"c3a4aa07-ed67-4ea9-b98a-f19f35b852ae","resolution":{"observed_at":"2026-08-15T21:32:24.436792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.415862Z","title":"Learning from video and text via large-scale discriminative clustering","venue":null,"work_id":"56a7c886-72b0-4388-bd3b-b20badd55c24","year":2017},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.942720Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:4b51b0493381d970bd5090ea4993197444be9f50c5c65f0e99c2fc71410bf74b","observation_id":"bd702d54-cf0f-4f6a-8b1c-bcd097402cac","resolution":{"observed_at":"2026-08-15T21:32:24.421800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.400609Z","title":"Conditional gradient method for stochastic submodular maximization: Closing the gap","venue":null,"work_id":"dfd437d0-81c5-479c-b31f-5a9f4d8235ab","year":2018},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.947210Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:0b0d9bd1b944a79fb3ff2294b8adc1756605ad4120e8cdabe644ad808dd3976f","observation_id":"8c525a54-f73a-461e-87cb-6470e98b9a84","resolution":{"observed_at":"2026-08-15T21:32:24.405281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.385895Z","title":"Scalable robust ma- trix recovery: Frank–Wolfe meets proximal methods","venue":null,"work_id":"e4e1459a-6200-4edb-922e-6e699eab507e","year":2016},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.952013Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:4ed5b099385a94ceba2feaccb2820fe9b61ccabc427db53809dabb14a91f1b25","observation_id":"aa5cb13f-8cb0-4b02-877c-480f3f4ab0a9","resolution":{"observed_at":"2026-08-15T21:32:24.390597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.370293Z","title":"Complexity bounds for primal-dual methods minimizing the model of objective function","venue":null,"work_id":"23d596ee-ae72-4f1b-984b-54f3b36455c9","year":2018},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.956637Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:7246b40047f4bfaeeb012f1a38d3926046f7f620f541e4f9defe9157cbf95a55","observation_id":"87f350cf-dbf5-46e4-a779-b931c5078b6a","resolution":{"observed_at":"2026-08-15T21:32:24.375091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.354441Z","title":"Minding the gaps for block Frank-Wolfe optimization of structured svms","venue":null,"work_id":"cd08df06-b719-468d-9ecb-bfe4c08918de","year":2016},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.961157Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:88648bdaf58dafd9d227f53a36ad5f603b38429710371def74533b10a026605a","observation_id":"58e5006d-fe26-4fb1-b9e0-2df906fc9f11","resolution":{"observed_at":"2026-08-15T21:32:24.359891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.338493Z","title":"Fast stochastic frank-wolfe algorithms for non- linear svms","venue":null,"work_id":"d8f63f76-66c5-47ba-9c5d-c072c3c74dac","year":2010},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.965485Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:d8f833fb1b4f13861280a0cabb9db9836a6e7782ff58231181c97de48313fb1e","observation_id":"7322b70f-b36e-4a6c-bba1-274522376de5","resolution":{"observed_at":"2026-08-15T21:32:24.344016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.05123","last_updated":"2022-09-08T08:42:43Z","snapshot_observed_at":"2026-08-14T19:04:08.859683Z","submitted_at":"2018-06-13T15:55:58Z","title":"Linearly Convergent Frank-Wolfe with Backtracking Line-Search","version":5},"cited_work":{"arxiv_id":"1806.05123","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.05123","snapshot_observed_at":"2026-08-15T21:32:24.091542Z","title":"Linearly Convergent Frank-Wolfe with Backtracking Line-Search","venue":"math.OC","work_id":"eb1e10a3-5d52-4008-933b-c55feb1a8725","year":2018},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.969800Z"},"links":{"cited_paper":"/paper/1806.05123","citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:4d7ba91ea483000427f4bc63f0ef2a341c92827d19a5a91ccf2261eafbd2b3ae","observation_id":"7e5c0eca-26b2-49cc-8328-4d6d29a77b2c","resolution":{"observed_at":"2026-08-15T21:32:24.097304Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.323288Z","title":"Affine invariant convergence rates of the conditional gradient method","venue":null,"work_id":"a5cdb263-7c5f-47f7-8999-fb8fef5f848e","year":2023},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.974855Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:9504e0710dcc3b7b655c412dcc6b9b3875ef678f8505d8978b3702b0844d42eb","observation_id":"0dbc56ab-df6d-4d4f-813e-e7ab97aa2aaf","resolution":{"observed_at":"2026-08-15T21:32:24.328157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.307145Z","title":"Weakly-supervised learning of visual relations","venue":null,"work_id":"02599e02-4130-4855-aec9-bf07504da3a2","year":2017},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.979671Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:d8e8d61743652037ffe4916b75e0513c29fdf85637c94bed3396d0ca3b7ff949","observation_id":"bdecb3c2-65de-4743-9b26-94cdca88ac62","resolution":{"observed_at":"2026-08-15T21:32:24.312511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.291695Z","title":"The Frank-Wolfe algorithm: a short introduction","venue":null,"work_id":"bede7c02-760d-44a8-9f0a-e2b7b7979f4d","year":2024},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.984033Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:6e849424a9fba4eb0e82c066e764ba7bd3039b4a0f8a98a85881a20da13a9904","observation_id":"6be51e96-560c-404d-a61b-ad0d9a0397f2","resolution":{"observed_at":"2026-08-15T21:32:24.296801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.276637Z","title":"Background subtraction via fast robust matrix completion","venue":null,"work_id":"eae99856-a0bf-418f-b06a-6efa3f8ec998","year":2017},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.988836Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:afc1736f9dbe60ba5fbd1149f4e05423d381fbc7885a6aec48d1ce8bf79fc5e0","observation_id":"1f034477-435b-4a76-96a3-ad3f0488dfc4","resolution":{"observed_at":"2026-08-15T21:32:24.281552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.261140Z","title":"Instance- level video segmentation from object tracks","venue":null,"work_id":"6f8cedc5-c7c0-43db-9fff-8ae5641792ca","year":2016},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.993180Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:a33e2b467bb4be65bbb223484abc2bbbb44c75e7d38a7e17cda32530c7e963a7","observation_id":"8ce53829-4941-4654-9c2d-129e7ea57473","resolution":{"observed_at":"2026-08-15T21:32:24.266862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1106.1622","last_updated":"2011-06-08T19:07:09Z","snapshot_observed_at":"2026-08-19T18:37:04.390545Z","submitted_at":"2011-06-08T19:07:09Z","title":"Large-Scale Convex Minimization with a Low-Rank Constraint","version":1},"cited_work":{"arxiv_id":"1106.1622","doi":null,"metadata_source":"pith","pith_arxiv_id":"1106.1622","snapshot_observed_at":"2026-08-15T21:32:24.063857Z","title":"Large-Scale Convex Minimization with a Low-Rank Constraint","venue":"cs.LG","work_id":"0ca025dc-572e-4faf-98ce-d437db6c463a","year":2011},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:23.997983Z"},"links":{"cited_paper":"/paper/1106.1622","citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:11fcd3a8eb013828f586fa8f59ec8893da765d6df7de437a0333e3b009feaec6","observation_id":"6f2d537e-c220-4c3c-abb0-0bab8646ee2c","resolution":{"observed_at":"2026-08-15T21:32:24.072477Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.244488Z","title":"Pairwise conditional gradients without swap steps and sparser kernel herding","venue":null,"work_id":"97bb1bee-5e94-42bc-8552-5701095c156e","year":2022},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:24.003015Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:cb0d35ab64d75a20615a390a87fa39e278e1b428df158d226ef42009d1bde21c","observation_id":"c245c5c8-c2e7-4baf-90b0-86a06f76bf5a","resolution":{"observed_at":"2026-08-15T21:32:24.249961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.227801Z","title":"Approximate vanishing ideal computations at scale","venue":null,"work_id":"7424b404-7e9d-4353-a390-19e6a6c9fcd5","year":2023},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:24.007459Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:86ceb6d24799b2acd9df6594b90735eb534372c7472cbdbb7f5de5edb87efb39","observation_id":"de9a9d4b-13d8-4354-9cf3-601b16902278","resolution":{"observed_at":"2026-08-15T21:32:24.232755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.212408Z","title":"Acceleration of Frank- Wolfe algorithms with open-loop step-sizes","venue":null,"work_id":"e2e90cb6-49a3-4e4e-a2c3-98082067c9ea","year":2023},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:24.012004Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:1f86f8375582a5982a1134bc63f9ee6093be994bf52abc6ec7e19f0e5bbdd8cd","observation_id":"cdff9e93-6e9b-45a9-90de-87ae367fa43d","resolution":{"observed_at":"2026-08-15T21:32:24.217268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.196646Z","title":"Accelerated affine-invariant convergence rates of the Frank-Wolfe algorithm with open-loop step-sizes","venue":null,"work_id":"9614f9c5-ff11-49e5-8e16-af209c0791f1","year":2025},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:24.016569Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:d39d3d7e79a79c4e61f902a992f0d5688d2dc29c5450ad23862904afbce881f6","observation_id":"d0b6fab4-ca9b-49ce-bace-48993a662c8e","resolution":{"observed_at":"2026-08-15T21:32:24.201672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.180937Z","title":"Conditional gradients for the approximately vanishing ideal","venue":null,"work_id":"fdcbd55b-51c6-4de9-a1db-c47c1073bddc","year":2022},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:24.021142Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:a9109afa61309c7701e16c7bb14d299d0d866de10f424ac5c15abf1479ec7afe","observation_id":"1eca256e-325b-415a-a11a-489771e39ffc","resolution":{"observed_at":"2026-08-15T21:32:24.186030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-15T21:32:24.165250Z","title":"Convergence theory in nonlinear programming","venue":null,"work_id":"d7ab9c1c-f778-4608-aa9c-15d67277b852","year":1970},"citing_paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:24.025776Z"},"links":{"citing_paper":"/paper/2505.09886"},"observation_digest":"sha256:53dffb49d692b735d213334b0ed7f5e9b01a363edeec7d74222fd23a30876fa2","observation_id":"12066f1f-cfd8-4953-b927-3614083e487f","resolution":{"observed_at":"2026-08-15T21:32:24.170343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.09886","last_updated":"2025-05-15T01:09:03Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-17T01:20:47.174170Z","submitted_at":"2025-05-15T01:09:03Z","title":"Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":3,"verified_exact":2,"verified_fuzzy":47},"total_outbound_references":53},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 0 inbound Pith citation observations for arXiv:2505.09886."}