{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:37XLFD3YZWVGF6YH7AULIHRS7O","short_pith_number":"pith:37XLFD3Y","schema_version":"1.0","canonical_sha256":"dfeeb28f78cdaa62fb07f828b41e32fb9120aee197a5a8d4eacbf5b9bca61177","source":{"kind":"arxiv","id":"1302.2325","version":4},"attestation_state":"computed","paper":{"title":"Conditional Gradient Algorithms for Norm-Regularized Smooth Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ML"],"primary_cat":"math.OC","authors_text":"Anatoli Juditsky, Arkadi Nemirovski, Zaid Harchaoui","submitted_at":"2013-02-10T12:24:44Z","abstract_excerpt":"Motivated by some applications in signal processing and machine learning, we consider two convex optimization problems where, given a cone $K$, a norm $\\|\\cdot\\|$ and a smooth convex function $f$, we want either 1) to minimize the norm over the intersection of the cone and a level set of $f$, or 2) to minimize over the cone the sum of $f$ and a multiple of the norm. We focus on the case where (a) the dimension of the problem is too large to allow for interior point algorithms, (b) $\\|\\cdot\\|$ is \"too complicated\" to allow for computationally cheap Bregman projections required in the first-orde"},"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":"1302.2325","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-10T12:24:44Z","cross_cats_sorted":["stat.CO","stat.ML"],"title_canon_sha256":"ece1fc41ae0390e467f3c5791bfecbb6579b2fe210c96cf919edc9eb95660f0b","abstract_canon_sha256":"9c523d46f45d4ecc93753be88ad1f96942fcb3402284deedc2649cf0e00294b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:38.454302Z","signature_b64":"PrgzGr03L0h6SuR/2ojxqlmOsu2LP0C9LKH2tJCMFUdQ0ilGG5b7x2wGLWaX5GRbtnR9DNQ2gOP8DnTKbmLOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfeeb28f78cdaa62fb07f828b41e32fb9120aee197a5a8d4eacbf5b9bca61177","last_reissued_at":"2026-05-18T03:29:38.453797Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:38.453797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conditional Gradient Algorithms for Norm-Regularized Smooth Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ML"],"primary_cat":"math.OC","authors_text":"Anatoli Juditsky, Arkadi Nemirovski, Zaid Harchaoui","submitted_at":"2013-02-10T12:24:44Z","abstract_excerpt":"Motivated by some applications in signal processing and machine learning, we consider two convex optimization problems where, given a cone $K$, a norm $\\|\\cdot\\|$ and a smooth convex function $f$, we want either 1) to minimize the norm over the intersection of the cone and a level set of $f$, or 2) to minimize over the cone the sum of $f$ and a multiple of the norm. We focus on the case where (a) the dimension of the problem is too large to allow for interior point algorithms, (b) $\\|\\cdot\\|$ is \"too complicated\" to allow for computationally cheap Bregman projections required in the first-orde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2325","kind":"arxiv","version":4},"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":"1302.2325","created_at":"2026-05-18T03:29:38.453886+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.2325v4","created_at":"2026-05-18T03:29:38.453886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2325","created_at":"2026-05-18T03:29:38.453886+00:00"},{"alias_kind":"pith_short_12","alias_value":"37XLFD3YZWVG","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"37XLFD3YZWVGF6YH","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"37XLFD3Y","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/37XLFD3YZWVGF6YH7AULIHRS7O","json":"https://pith.science/pith/37XLFD3YZWVGF6YH7AULIHRS7O.json","graph_json":"https://pith.science/api/pith-number/37XLFD3YZWVGF6YH7AULIHRS7O/graph.json","events_json":"https://pith.science/api/pith-number/37XLFD3YZWVGF6YH7AULIHRS7O/events.json","paper":"https://pith.science/paper/37XLFD3Y"},"agent_actions":{"view_html":"https://pith.science/pith/37XLFD3YZWVGF6YH7AULIHRS7O","download_json":"https://pith.science/pith/37XLFD3YZWVGF6YH7AULIHRS7O.json","view_paper":"https://pith.science/paper/37XLFD3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.2325&json=true","fetch_graph":"https://pith.science/api/pith-number/37XLFD3YZWVGF6YH7AULIHRS7O/graph.json","fetch_events":"https://pith.science/api/pith-number/37XLFD3YZWVGF6YH7AULIHRS7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37XLFD3YZWVGF6YH7AULIHRS7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37XLFD3YZWVGF6YH7AULIHRS7O/action/storage_attestation","attest_author":"https://pith.science/pith/37XLFD3YZWVGF6YH7AULIHRS7O/action/author_attestation","sign_citation":"https://pith.science/pith/37XLFD3YZWVGF6YH7AULIHRS7O/action/citation_signature","submit_replication":"https://pith.science/pith/37XLFD3YZWVGF6YH7AULIHRS7O/action/replication_record"}},"created_at":"2026-05-18T03:29:38.453886+00:00","updated_at":"2026-05-18T03:29:38.453886+00:00"}