{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FMLJKQUYHR5KZIIRGD7EDJNZJ4","short_pith_number":"pith:FMLJKQUY","schema_version":"1.0","canonical_sha256":"2b169542983c7aaca11130fe41a5b94f110e2bed3a78ae7d3ef5decb39cf1c88","source":{"kind":"arxiv","id":"1811.06416","version":1},"attestation_state":"computed","paper":{"title":"The Sliding Frank-Wolfe Algorithm and its Application to Super-Resolution Microscopy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Emmanuel Soubies, Gabriel Peyr\\'e (DMA), Quentin Denoyelle (CEREMADE), Vincent Duval (MOKAPLAN)","submitted_at":"2018-11-15T15:02:17Z","abstract_excerpt":"This paper showcases the theoretical and numerical performance of the Sliding Frank-Wolfe, which is a novel optimization algorithm to solve the BLASSO sparse spikes super-resolution problem. The BLASSO is a continuous (i.e. off-the-grid or grid-less) counterpart to the well-known 1 sparse regularisation method (also known as LASSO or Basis Pursuit). Our algorithm is a variation on the classical Frank-Wolfe (also known as conditional gradient) which follows a recent trend of interleaving convex optimization updates (corresponding to adding new spikes) with non-convex optimization steps (corresp"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1811.06416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-15T15:02:17Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"555b40e787c9ca1d7a0b160d6acdd00910d910f93f3bcd8b650c68cfad4cd192","abstract_canon_sha256":"69f5360fe6f413735a6f24fa919fabceca9b8ecfc75e434e3438fc5116a50861"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:37.741292Z","signature_b64":"5f+UiB01jSUmI+IdjM9jO8ddzTFC/ZmtP8xvxYijAO1VxHmOdVlMZjtw2IZaSVDCUQd2sAcSA1gyGxNixdOWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b169542983c7aaca11130fe41a5b94f110e2bed3a78ae7d3ef5decb39cf1c88","last_reissued_at":"2026-05-18T00:00:37.740890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:37.740890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Sliding Frank-Wolfe Algorithm and its Application to Super-Resolution Microscopy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Emmanuel Soubies, Gabriel Peyr\\'e (DMA), Quentin Denoyelle (CEREMADE), Vincent Duval (MOKAPLAN)","submitted_at":"2018-11-15T15:02:17Z","abstract_excerpt":"This paper showcases the theoretical and numerical performance of the Sliding Frank-Wolfe, which is a novel optimization algorithm to solve the BLASSO sparse spikes super-resolution problem. The BLASSO is a continuous (i.e. off-the-grid or grid-less) counterpart to the well-known 1 sparse regularisation method (also known as LASSO or Basis Pursuit). Our algorithm is a variation on the classical Frank-Wolfe (also known as conditional gradient) which follows a recent trend of interleaving convex optimization updates (corresponding to adding new spikes) with non-convex optimization steps (corresp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06416","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.06416","created_at":"2026-05-18T00:00:37.740946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06416v1","created_at":"2026-05-18T00:00:37.740946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06416","created_at":"2026-05-18T00:00:37.740946+00:00"},{"alias_kind":"pith_short_12","alias_value":"FMLJKQUYHR5K","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FMLJKQUYHR5KZIIR","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FMLJKQUY","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.09919","citing_title":"On the linear convergence rates of exchange and continuous methods for total variation minimization","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FMLJKQUYHR5KZIIRGD7EDJNZJ4","json":"https://pith.science/pith/FMLJKQUYHR5KZIIRGD7EDJNZJ4.json","graph_json":"https://pith.science/api/pith-number/FMLJKQUYHR5KZIIRGD7EDJNZJ4/graph.json","events_json":"https://pith.science/api/pith-number/FMLJKQUYHR5KZIIRGD7EDJNZJ4/events.json","paper":"https://pith.science/paper/FMLJKQUY"},"agent_actions":{"view_html":"https://pith.science/pith/FMLJKQUYHR5KZIIRGD7EDJNZJ4","download_json":"https://pith.science/pith/FMLJKQUYHR5KZIIRGD7EDJNZJ4.json","view_paper":"https://pith.science/paper/FMLJKQUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06416&json=true","fetch_graph":"https://pith.science/api/pith-number/FMLJKQUYHR5KZIIRGD7EDJNZJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/FMLJKQUYHR5KZIIRGD7EDJNZJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FMLJKQUYHR5KZIIRGD7EDJNZJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FMLJKQUYHR5KZIIRGD7EDJNZJ4/action/storage_attestation","attest_author":"https://pith.science/pith/FMLJKQUYHR5KZIIRGD7EDJNZJ4/action/author_attestation","sign_citation":"https://pith.science/pith/FMLJKQUYHR5KZIIRGD7EDJNZJ4/action/citation_signature","submit_replication":"https://pith.science/pith/FMLJKQUYHR5KZIIRGD7EDJNZJ4/action/replication_record"}},"created_at":"2026-05-18T00:00:37.740946+00:00","updated_at":"2026-05-18T00:00:37.740946+00:00"}