{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4EH5W7C5HZRYYFSTKOZZ5GWA2P","short_pith_number":"pith:4EH5W7C5","canonical_record":{"source":{"id":"1211.6302","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-27T13:46:59Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"7c7d13df1d107cf01dcbc7c4b0351b863e9bd68422846a3e29b4eaa2c4213580","abstract_canon_sha256":"5a3b0a8cc4eedfaefe3dc20d66e47d4b8da50bc446575a96d93ef610bd1841a6"},"schema_version":"1.0"},"canonical_sha256":"e10fdb7c5d3e638c165353b39e9ac0d3c6818d47bbc65a76e7587044b06ec340","source":{"kind":"arxiv","id":"1211.6302","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6302","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6302v3","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6302","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"4EH5W7C5HZRY","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4EH5W7C5HZRYYFST","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4EH5W7C5","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4EH5W7C5HZRYYFSTKOZZ5GWA2P","target":"record","payload":{"canonical_record":{"source":{"id":"1211.6302","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-27T13:46:59Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"7c7d13df1d107cf01dcbc7c4b0351b863e9bd68422846a3e29b4eaa2c4213580","abstract_canon_sha256":"5a3b0a8cc4eedfaefe3dc20d66e47d4b8da50bc446575a96d93ef610bd1841a6"},"schema_version":"1.0"},"canonical_sha256":"e10fdb7c5d3e638c165353b39e9ac0d3c6818d47bbc65a76e7587044b06ec340","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:12.040456Z","signature_b64":"DhSKj6c4Xxp5/s2BzYQKDARCIcgo7UD2Z6TcL6cW6HvF9OBtD8DMaUv7BzQ7190FnMbYojxp8BkPatbYWv6ACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e10fdb7c5d3e638c165353b39e9ac0d3c6818d47bbc65a76e7587044b06ec340","last_reissued_at":"2026-05-18T03:10:12.039759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:12.039759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.6302","source_version":3,"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:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A2GJxwTM/GostKhnc89Q+jVy3T1+WrqdqgAEuLtLrjnb5GWTFWMKZek3ynNw1gzKopPqS2lvMpteULXLgeN5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:07:37.889521Z"},"content_sha256":"c5b004fb9d1c1da67ef84882d989a7ed4e390fc00b83a80558dca32ceb68648c","schema_version":"1.0","event_id":"sha256:c5b004fb9d1c1da67ef84882d989a7ed4e390fc00b83a80558dca32ceb68648c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4EH5W7C5HZRYYFSTKOZZ5GWA2P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Duality between subgradient and conditional gradient methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Francis Bach (INRIA Paris - Rocquencourt, LIENS)","submitted_at":"2012-11-27T13:46:59Z","abstract_excerpt":"Given a convex optimization problem and its dual, there are many possible first-order algorithms. In this paper, we show the equivalence between mirror descent algorithms and algorithms generalizing the conditional gradient method. This is done through convex duality, and implies notably that for certain problems, such as for supervised machine learning problems with non-smooth losses or problems regularized by non-smooth regularizers, the primal subgradient method and the dual conditional gradient method are formally equivalent. The dual interpretation leads to a form of line search for mirro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6302","kind":"arxiv","version":3},"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:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2jp3l7SjDVoeYcaE9uXQMCLZALmCsxfpxpz26HOm6/MVwXMHhUwWI+tvbTl36zDTulSlTjMVPocVOZR5F4qIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:07:37.889869Z"},"content_sha256":"9f2b47f763df066599e2f36a57488b8befd98a3fffb66b985cd355fccebf805e","schema_version":"1.0","event_id":"sha256:9f2b47f763df066599e2f36a57488b8befd98a3fffb66b985cd355fccebf805e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4EH5W7C5HZRYYFSTKOZZ5GWA2P/bundle.json","state_url":"https://pith.science/pith/4EH5W7C5HZRYYFSTKOZZ5GWA2P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4EH5W7C5HZRYYFSTKOZZ5GWA2P/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-05T03:07:37Z","links":{"resolver":"https://pith.science/pith/4EH5W7C5HZRYYFSTKOZZ5GWA2P","bundle":"https://pith.science/pith/4EH5W7C5HZRYYFSTKOZZ5GWA2P/bundle.json","state":"https://pith.science/pith/4EH5W7C5HZRYYFSTKOZZ5GWA2P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4EH5W7C5HZRYYFSTKOZZ5GWA2P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4EH5W7C5HZRYYFSTKOZZ5GWA2P","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":"5a3b0a8cc4eedfaefe3dc20d66e47d4b8da50bc446575a96d93ef610bd1841a6","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-27T13:46:59Z","title_canon_sha256":"7c7d13df1d107cf01dcbc7c4b0351b863e9bd68422846a3e29b4eaa2c4213580"},"schema_version":"1.0","source":{"id":"1211.6302","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6302","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6302v3","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6302","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"4EH5W7C5HZRY","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4EH5W7C5HZRYYFST","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4EH5W7C5","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:9f2b47f763df066599e2f36a57488b8befd98a3fffb66b985cd355fccebf805e","target":"graph","created_at":"2026-05-18T03:10:12Z","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":"Given a convex optimization problem and its dual, there are many possible first-order algorithms. In this paper, we show the equivalence between mirror descent algorithms and algorithms generalizing the conditional gradient method. This is done through convex duality, and implies notably that for certain problems, such as for supervised machine learning problems with non-smooth losses or problems regularized by non-smooth regularizers, the primal subgradient method and the dual conditional gradient method are formally equivalent. The dual interpretation leads to a form of line search for mirro","authors_text":"Francis Bach (INRIA Paris - Rocquencourt, LIENS)","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-27T13:46:59Z","title":"Duality between subgradient and conditional gradient methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6302","kind":"arxiv","version":3},"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:c5b004fb9d1c1da67ef84882d989a7ed4e390fc00b83a80558dca32ceb68648c","target":"record","created_at":"2026-05-18T03:10:12Z","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":"5a3b0a8cc4eedfaefe3dc20d66e47d4b8da50bc446575a96d93ef610bd1841a6","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-11-27T13:46:59Z","title_canon_sha256":"7c7d13df1d107cf01dcbc7c4b0351b863e9bd68422846a3e29b4eaa2c4213580"},"schema_version":"1.0","source":{"id":"1211.6302","kind":"arxiv","version":3}},"canonical_sha256":"e10fdb7c5d3e638c165353b39e9ac0d3c6818d47bbc65a76e7587044b06ec340","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e10fdb7c5d3e638c165353b39e9ac0d3c6818d47bbc65a76e7587044b06ec340","first_computed_at":"2026-05-18T03:10:12.039759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:12.039759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DhSKj6c4Xxp5/s2BzYQKDARCIcgo7UD2Z6TcL6cW6HvF9OBtD8DMaUv7BzQ7190FnMbYojxp8BkPatbYWv6ACg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:12.040456Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.6302","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5b004fb9d1c1da67ef84882d989a7ed4e390fc00b83a80558dca32ceb68648c","sha256:9f2b47f763df066599e2f36a57488b8befd98a3fffb66b985cd355fccebf805e"],"state_sha256":"1bdac6e61370deda3923fa5c1a26d7ea14405de4f84641f338533baa290170f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"clGx5YsHl/o7SqrgiXIqx6BLo0R/HPjwpfRxz31ywTwxzHEIHkeQFUuC53jv1tzv0EDmMpMIABcueYhv+dkXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:07:37.891829Z","bundle_sha256":"a5a6e1a6c29431c5cfe2c630eab3b67b1b11267aa3f810201cc6119f57d56353"}}