{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:37XLFD3YZWVGF6YH7AULIHRS7O","short_pith_number":"pith:37XLFD3Y","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"},"canonical_sha256":"dfeeb28f78cdaa62fb07f828b41e32fb9120aee197a5a8d4eacbf5b9bca61177","source":{"kind":"arxiv","id":"1302.2325","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2325","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2325v4","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2325","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"37XLFD3YZWVG","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"37XLFD3YZWVGF6YH","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"37XLFD3Y","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:37XLFD3YZWVGF6YH7AULIHRS7O","target":"record","payload":{"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"},"canonical_sha256":"dfeeb28f78cdaa62fb07f828b41e32fb9120aee197a5a8d4eacbf5b9bca61177","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"},"source_kind":"arxiv","source_id":"1302.2325","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:29:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"snVHv5ZyqAiYnSCBR8hYar/kX0xC+Pkd/XE6r+FIRwUZyTuBzzyr0sN1TTMp5TLvyNs8SkcD95DtJJnEgCZeBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:56:12.621644Z"},"content_sha256":"20d266fb0cecc09e2d0a8c323a0c04746b016a9e1c3f5164a18add24eecf80da","schema_version":"1.0","event_id":"sha256:20d266fb0cecc09e2d0a8c323a0c04746b016a9e1c3f5164a18add24eecf80da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:37XLFD3YZWVGF6YH7AULIHRS7O","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:29:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I3/2SiiCiXGncyEABY/0BDKy9ieuzwWQ75iXZ/IB6s0B+CYlbW0RpCrr+69B94kT1gihdYGd1u3VzJ4FXOqlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:56:12.622346Z"},"content_sha256":"0f03b15acf62cf8b35e051bbcc8622816202f18452878ff71d9c5b87a3165b82","schema_version":"1.0","event_id":"sha256:0f03b15acf62cf8b35e051bbcc8622816202f18452878ff71d9c5b87a3165b82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/37XLFD3YZWVGF6YH7AULIHRS7O/bundle.json","state_url":"https://pith.science/pith/37XLFD3YZWVGF6YH7AULIHRS7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/37XLFD3YZWVGF6YH7AULIHRS7O/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T07:56:12Z","links":{"resolver":"https://pith.science/pith/37XLFD3YZWVGF6YH7AULIHRS7O","bundle":"https://pith.science/pith/37XLFD3YZWVGF6YH7AULIHRS7O/bundle.json","state":"https://pith.science/pith/37XLFD3YZWVGF6YH7AULIHRS7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/37XLFD3YZWVGF6YH7AULIHRS7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:37XLFD3YZWVGF6YH7AULIHRS7O","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9c523d46f45d4ecc93753be88ad1f96942fcb3402284deedc2649cf0e00294b8","cross_cats_sorted":["stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-10T12:24:44Z","title_canon_sha256":"ece1fc41ae0390e467f3c5791bfecbb6579b2fe210c96cf919edc9eb95660f0b"},"schema_version":"1.0","source":{"id":"1302.2325","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2325","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2325v4","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2325","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"37XLFD3YZWVG","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"37XLFD3YZWVGF6YH","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"37XLFD3Y","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:0f03b15acf62cf8b35e051bbcc8622816202f18452878ff71d9c5b87a3165b82","target":"graph","created_at":"2026-05-18T03:29:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Anatoli Juditsky, Arkadi Nemirovski, Zaid Harchaoui","cross_cats":["stat.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-10T12:24:44Z","title":"Conditional Gradient Algorithms for Norm-Regularized Smooth Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2325","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:20d266fb0cecc09e2d0a8c323a0c04746b016a9e1c3f5164a18add24eecf80da","target":"record","created_at":"2026-05-18T03:29:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9c523d46f45d4ecc93753be88ad1f96942fcb3402284deedc2649cf0e00294b8","cross_cats_sorted":["stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-10T12:24:44Z","title_canon_sha256":"ece1fc41ae0390e467f3c5791bfecbb6579b2fe210c96cf919edc9eb95660f0b"},"schema_version":"1.0","source":{"id":"1302.2325","kind":"arxiv","version":4}},"canonical_sha256":"dfeeb28f78cdaa62fb07f828b41e32fb9120aee197a5a8d4eacbf5b9bca61177","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfeeb28f78cdaa62fb07f828b41e32fb9120aee197a5a8d4eacbf5b9bca61177","first_computed_at":"2026-05-18T03:29:38.453797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:38.453797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PrgzGr03L0h6SuR/2ojxqlmOsu2LP0C9LKH2tJCMFUdQ0ilGG5b7x2wGLWaX5GRbtnR9DNQ2gOP8DnTKbmLOAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:38.454302Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2325","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20d266fb0cecc09e2d0a8c323a0c04746b016a9e1c3f5164a18add24eecf80da","sha256:0f03b15acf62cf8b35e051bbcc8622816202f18452878ff71d9c5b87a3165b82"],"state_sha256":"64d9bbf7ab6ab4248e5e511df65b5cb502da6d1e22ae49976d69d866ad251c53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D2q7qIgv20iTwGaX6uBLxpEhFMASQQcTmO7Ym5v9VOUYXKi2vHNr4n38ANlRexTMIOnTlGZAzFWnQh/rN1h7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:56:12.626229Z","bundle_sha256":"09f06a18564d25a7727470cecf304b7934d522b420494d98d7ddbb4c246db757"}}