{"as_of":"2026-08-09T06:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e4a91be2df1a042f2a0dd7796b21766867062fe6ea2a18153d65c0f99a0f91b9","coverage":[{"denominator":10,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T20:01:36.215138Z","state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.04321/citation-record","integrity":"/paper/2608.04321/integrity","json":"/paper/2608.04321/citation-record.json","paper":"/paper/2608.04321"},"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-08T20:01:36.407919Z","title":null,"venue":null,"work_id":"4e818b8e-0ef0-4a08-935c-171249b1d5c4","year":2025},"citing_paper":{"arxiv_id":"2608.04321","last_updated":"2026-08-05T01:04:00Z","snapshot_observed_at":"2026-08-08T23:11:27.444486Z","submitted_at":"2026-08-05T01:04:00Z","title":"A Linearly Convergent Projection-Free Algorithm for Smooth Convex Sets","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T20:01:36.179673Z"},"links":{"citing_paper":"/paper/2608.04321"},"observation_digest":"sha256:602a43258ae1321b840e7a1db667f0fa4581e2c85c77a461ce3da027437e20c5","observation_id":"1830f710-c3ce-4617-8e78-6990086bca23","resolution":{"observed_at":"2026-08-08T20:01:36.411228Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:01:36.397546Z","title":"An algorithm for quadratic programming.Naval Research Logistics Quarterly, 3(1–2):95–110, 1956","venue":null,"work_id":"8743a796-8eb1-46c7-90d0-16cb9ccdf987","year":1956},"citing_paper":{"arxiv_id":"2608.04321","last_updated":"2026-08-05T01:04:00Z","snapshot_observed_at":"2026-08-08T23:11:27.444486Z","submitted_at":"2026-08-05T01:04:00Z","title":"A Linearly Convergent Projection-Free Algorithm for Smooth Convex Sets","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T20:01:36.184199Z"},"links":{"citing_paper":"/paper/2608.04321"},"observation_digest":"sha256:119195246f16c8ca4394ba2c6750cdac1a188f1971a85cd42dfa9059bb58101a","observation_id":"05253be9-46fe-4e67-aa01-c8d0a5e13757","resolution":{"observed_at":"2026-08-08T20:01:36.401244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1301.4666","last_updated":"2015-08-14T18:02:18Z","snapshot_observed_at":"2026-08-01T18:43:40.042418Z","submitted_at":"2013-01-20T15:54:22Z","title":"A Linearly Convergent Conditional Gradient Algorithm with Applications to Online and Stochastic Optimization","version":6},"cited_work":{"arxiv_id":"1301.4666","doi":null,"metadata_source":"pith","pith_arxiv_id":"1301.4666","snapshot_observed_at":"2026-08-08T20:01:36.325463Z","title":"A Linearly Convergent Conditional Gradient Algorithm with Applications to Online and Stochastic Optimization","venue":"cs.LG","work_id":"ef1f2df8-f5cd-4b3e-9a85-519f127faf5a","year":2013},"citing_paper":{"arxiv_id":"2608.04321","last_updated":"2026-08-05T01:04:00Z","snapshot_observed_at":"2026-08-08T23:11:27.444486Z","submitted_at":"2026-08-05T01:04:00Z","title":"A Linearly Convergent Projection-Free Algorithm for Smooth Convex Sets","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T20:01:36.187979Z"},"links":{"cited_paper":"/paper/1301.4666","citing_paper":"/paper/2608.04321"},"observation_digest":"sha256:e982da7a4c0fc33fb790252dcd6e9f90fb8f9f952c68460587a8da545206e54d","observation_id":"07e9a801-e35e-4e81-bbf7-8705ddf6bf1b","resolution":{"observed_at":"2026-08-08T20:01:36.332715Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.05207","last_updated":"2023-08-06T14:24:26Z","snapshot_observed_at":"2026-08-06T03:42:24.250183Z","submitted_at":"2019-09-07T19:06:23Z","title":"Introduction to Online Convex Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.05207","snapshot_observed_at":"2026-08-08T20:01:36.192102Z","title":"Now Publishers, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.04321","last_updated":"2026-08-05T01:04:00Z","snapshot_observed_at":"2026-08-08T23:11:27.444486Z","submitted_at":"2026-08-05T01:04:00Z","title":"A Linearly Convergent Projection-Free Algorithm for Smooth Convex Sets","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T20:01:36.192102Z"},"links":{"cited_paper":"/paper/1909.05207","citing_paper":"/paper/2608.04321"},"observation_digest":"sha256:4719f70e86cb9cf43db1d5c0249556ade0745fcf686b57d253cf11d00ad49b2c","observation_id":"71e36459-d049-4efd-a977-64c157105efc","resolution":{"observed_at":"2026-08-08T20:01:36.192102Z","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-08T20:01:36.386871Z","title":null,"venue":null,"work_id":"d1d069ff-d2cd-46f6-abae-2e8d82665252","year":2018},"citing_paper":{"arxiv_id":"2608.04321","last_updated":"2026-08-05T01:04:00Z","snapshot_observed_at":"2026-08-08T23:11:27.444486Z","submitted_at":"2026-08-05T01:04:00Z","title":"A Linearly Convergent Projection-Free Algorithm for Smooth Convex Sets","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T20:01:36.197377Z"},"links":{"citing_paper":"/paper/2608.04321"},"observation_digest":"sha256:1259e6136ab1d21a6c510a141fc3feaec1349865620f752c5627240b2bb19088","observation_id":"ca85a7dd-6093-43e1-81f1-a5fdb4e3b2e1","resolution":{"observed_at":"2026-08-08T20:01:36.390603Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:01:36.376624Z","title":"Levy and Andreas Krause","venue":null,"work_id":"3fb57d41-24e7-474b-a0c8-e6dcc9ec9a6e","year":2019},"citing_paper":{"arxiv_id":"2608.04321","last_updated":"2026-08-05T01:04:00Z","snapshot_observed_at":"2026-08-08T23:11:27.444486Z","submitted_at":"2026-08-05T01:04:00Z","title":"A Linearly Convergent Projection-Free Algorithm for Smooth Convex Sets","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T20:01:36.200854Z"},"links":{"citing_paper":"/paper/2608.04321"},"observation_digest":"sha256:e000076582e9d9b7af550e12e3a10d58a68781591a97896ea4719926b7b8a03f","observation_id":"dcf4f897-027d-4c7b-a452-1ec6dce11d2e","resolution":{"observed_at":"2026-08-08T20:01:36.380141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:01:36.365936Z","title":"Fast projection-free approach (without optimization oracle) for optimization over compact convex set","venue":null,"work_id":"9bb1ac08-25f5-4231-bf3c-42783dad7e3e","year":2025},"citing_paper":{"arxiv_id":"2608.04321","last_updated":"2026-08-05T01:04:00Z","snapshot_observed_at":"2026-08-08T23:11:27.444486Z","submitted_at":"2026-08-05T01:04:00Z","title":"A Linearly Convergent Projection-Free Algorithm for Smooth Convex Sets","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T20:01:36.204578Z"},"links":{"citing_paper":"/paper/2608.04321"},"observation_digest":"sha256:f02c9f8c5d904fb396ca47eb1d75e3ff3f727c4e3646b8d57baa5011af5469fe","observation_id":"b293bc90-83c2-4c5f-8d95-8bf8f20514d2","resolution":{"observed_at":"2026-08-08T20:01:36.369657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:01:36.208213Z","title":"Gauges and accelerated optimization over smooth and/or strongly convex sets, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.04321","last_updated":"2026-08-05T01:04:00Z","snapshot_observed_at":"2026-08-08T23:11:27.444486Z","submitted_at":"2026-08-05T01:04:00Z","title":"A Linearly Convergent Projection-Free Algorithm for Smooth Convex Sets","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T20:01:36.208213Z"},"links":{"citing_paper":"/paper/2608.04321"},"observation_digest":"sha256:0d331157a2c3a0821f9f53201a926e7a5c40ec1278f351d4074984c89045ec2e","observation_id":"27f40a00-fc2e-41ba-ae4e-13f8abe52068","resolution":{"observed_at":"2026-08-08T20:01:36.208213Z","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-08T20:01:36.353980Z","title":"Efficient projection-free online convex optimization with membership oracle","venue":null,"work_id":"8777dff6-69fe-4b0d-85ca-a4fd4a3ba7f9","year":2022},"citing_paper":{"arxiv_id":"2608.04321","last_updated":"2026-08-05T01:04:00Z","snapshot_observed_at":"2026-08-08T23:11:27.444486Z","submitted_at":"2026-08-05T01:04:00Z","title":"A Linearly Convergent Projection-Free Algorithm for Smooth Convex Sets","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T20:01:36.211638Z"},"links":{"citing_paper":"/paper/2608.04321"},"observation_digest":"sha256:b02dc3026a23e22d65436b16b39e424290e8916dbd0f67aad6dab83c8ae5127c","observation_id":"73c2b888-b0d0-4b5a-9074-361468aef4b6","resolution":{"observed_at":"2026-08-08T20:01:36.358031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T20:01:36.341592Z","title":"Local LMO: Constrained gradient optimization via a local linear minimization oracle, 2026","venue":null,"work_id":"4f01ad85-6ed3-4719-a015-aac4fa3fc7aa","year":2026},"citing_paper":{"arxiv_id":"2608.04321","last_updated":"2026-08-05T01:04:00Z","snapshot_observed_at":"2026-08-08T23:11:27.444486Z","submitted_at":"2026-08-05T01:04:00Z","title":"A Linearly Convergent Projection-Free Algorithm for Smooth Convex Sets","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T20:01:36.215138Z"},"links":{"citing_paper":"/paper/2608.04321"},"observation_digest":"sha256:4bd0aa4aa027aba870a2bbdd318fe3dff5d3e22703ff9363551b8399f9e6acae","observation_id":"3cedde9c-5ee0-4496-869c-5376d3d88330","resolution":{"observed_at":"2026-08-08T20:01:36.346028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.04321","last_updated":"2026-08-05T01:04:00Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-08T23:11:27.444486Z","submitted_at":"2026-08-05T01:04:00Z","title":"A Linearly Convergent Projection-Free Algorithm for Smooth Convex Sets"},"reference_resolution":{"displayed":10,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":5},"total_outbound_references":10},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 0 inbound Pith citation observations for arXiv:2608.04321."}