{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SFUWTAR5Q36WENXJWOWNIRJ6WC","short_pith_number":"pith:SFUWTAR5","canonical_record":{"source":{"id":"1404.3591","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-14T14:09:43Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d09fbeaf360aaf2576d99935d6088e64e7a68c697e30f094300c2d95f8dafabc","abstract_canon_sha256":"0ee89e555a516ac92a7bfb834f500680593cd133abd5c3f3b31bad64b7caf897"},"schema_version":"1.0"},"canonical_sha256":"916969823d86fd6236e9b3acd4453eb096d487ee45bbebd969bd79cf185e59ba","source":{"kind":"arxiv","id":"1404.3591","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3591","created_at":"2026-05-18T02:54:13Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3591v2","created_at":"2026-05-18T02:54:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3591","created_at":"2026-05-18T02:54:13Z"},{"alias_kind":"pith_short_12","alias_value":"SFUWTAR5Q36W","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SFUWTAR5Q36WENXJ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SFUWTAR5","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SFUWTAR5Q36WENXJWOWNIRJ6WC","target":"record","payload":{"canonical_record":{"source":{"id":"1404.3591","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-14T14:09:43Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d09fbeaf360aaf2576d99935d6088e64e7a68c697e30f094300c2d95f8dafabc","abstract_canon_sha256":"0ee89e555a516ac92a7bfb834f500680593cd133abd5c3f3b31bad64b7caf897"},"schema_version":"1.0"},"canonical_sha256":"916969823d86fd6236e9b3acd4453eb096d487ee45bbebd969bd79cf185e59ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:13.762621Z","signature_b64":"uv9z7ZcAaYwWWn0daEwuERtPBrvqttMRg58PVlW7f6vQfxSz+xDPHKPvkHcxcXgIahmL0CAEDjx9UpWrHRMBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"916969823d86fd6236e9b3acd4453eb096d487ee45bbebd969bd79cf185e59ba","last_reissued_at":"2026-05-18T02:54:13.762181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:13.762181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.3591","source_version":2,"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-18T02:54:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pifQqpCqyntAzs+POuo4dZzjOqpTcmfO98rKJUrMGULKKOFzZWUVGZxU6lLitmi1DG6N4Xd7FLoSWCRjvtz8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:14:26.792186Z"},"content_sha256":"a031db435d825c8127ed699d5e03999c26c9cd1ab12c7bd31b78661cc79017a9","schema_version":"1.0","event_id":"sha256:a031db435d825c8127ed699d5e03999c26c9cd1ab12c7bd31b78661cc79017a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SFUWTAR5Q36WENXJWOWNIRJ6WC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hybrid Conditional Gradient - Smoothing Algorithms with Applications to Sparse and Low Rank Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Andreas Argyriou, Johan Suykens, Marco Signoretto","submitted_at":"2014-04-14T14:09:43Z","abstract_excerpt":"We study a hybrid conditional gradient - smoothing algorithm (HCGS) for solving composite convex optimization problems which contain several terms over a bounded set. Examples of these include regularization problems with several norms as penalties and a norm constraint. HCGS extends conditional gradient methods to cases with multiple nonsmooth terms, in which standard conditional gradient methods may be difficult to apply. The HCGS algorithm borrows techniques from smoothing proximal methods and requires first-order computations (subgradients and proximity operations). Unlike proximal methods"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3591","kind":"arxiv","version":2},"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-18T02:54:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FXTYTINAlk4xWtKg3YLqKvzCHj1qhL1pod3VzMgfPdEoC2uE9dJvV7vUInsoDS9fD+g/9f0cAy0EDKdKrWfBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:14:26.792563Z"},"content_sha256":"68cefc6587531a1c361a755b9523fb041f6297d5f0f2b24bd3a01ea34941c88d","schema_version":"1.0","event_id":"sha256:68cefc6587531a1c361a755b9523fb041f6297d5f0f2b24bd3a01ea34941c88d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SFUWTAR5Q36WENXJWOWNIRJ6WC/bundle.json","state_url":"https://pith.science/pith/SFUWTAR5Q36WENXJWOWNIRJ6WC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SFUWTAR5Q36WENXJWOWNIRJ6WC/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-05-27T01:14:26Z","links":{"resolver":"https://pith.science/pith/SFUWTAR5Q36WENXJWOWNIRJ6WC","bundle":"https://pith.science/pith/SFUWTAR5Q36WENXJWOWNIRJ6WC/bundle.json","state":"https://pith.science/pith/SFUWTAR5Q36WENXJWOWNIRJ6WC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SFUWTAR5Q36WENXJWOWNIRJ6WC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SFUWTAR5Q36WENXJWOWNIRJ6WC","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":"0ee89e555a516ac92a7bfb834f500680593cd133abd5c3f3b31bad64b7caf897","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-14T14:09:43Z","title_canon_sha256":"d09fbeaf360aaf2576d99935d6088e64e7a68c697e30f094300c2d95f8dafabc"},"schema_version":"1.0","source":{"id":"1404.3591","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3591","created_at":"2026-05-18T02:54:13Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3591v2","created_at":"2026-05-18T02:54:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3591","created_at":"2026-05-18T02:54:13Z"},{"alias_kind":"pith_short_12","alias_value":"SFUWTAR5Q36W","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SFUWTAR5Q36WENXJ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SFUWTAR5","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:68cefc6587531a1c361a755b9523fb041f6297d5f0f2b24bd3a01ea34941c88d","target":"graph","created_at":"2026-05-18T02:54:13Z","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":"We study a hybrid conditional gradient - smoothing algorithm (HCGS) for solving composite convex optimization problems which contain several terms over a bounded set. Examples of these include regularization problems with several norms as penalties and a norm constraint. HCGS extends conditional gradient methods to cases with multiple nonsmooth terms, in which standard conditional gradient methods may be difficult to apply. The HCGS algorithm borrows techniques from smoothing proximal methods and requires first-order computations (subgradients and proximity operations). Unlike proximal methods","authors_text":"Andreas Argyriou, Johan Suykens, Marco Signoretto","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-14T14:09:43Z","title":"Hybrid Conditional Gradient - Smoothing Algorithms with Applications to Sparse and Low Rank Regularization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3591","kind":"arxiv","version":2},"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:a031db435d825c8127ed699d5e03999c26c9cd1ab12c7bd31b78661cc79017a9","target":"record","created_at":"2026-05-18T02:54:13Z","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":"0ee89e555a516ac92a7bfb834f500680593cd133abd5c3f3b31bad64b7caf897","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-04-14T14:09:43Z","title_canon_sha256":"d09fbeaf360aaf2576d99935d6088e64e7a68c697e30f094300c2d95f8dafabc"},"schema_version":"1.0","source":{"id":"1404.3591","kind":"arxiv","version":2}},"canonical_sha256":"916969823d86fd6236e9b3acd4453eb096d487ee45bbebd969bd79cf185e59ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"916969823d86fd6236e9b3acd4453eb096d487ee45bbebd969bd79cf185e59ba","first_computed_at":"2026-05-18T02:54:13.762181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:13.762181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uv9z7ZcAaYwWWn0daEwuERtPBrvqttMRg58PVlW7f6vQfxSz+xDPHKPvkHcxcXgIahmL0CAEDjx9UpWrHRMBDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:13.762621Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3591","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a031db435d825c8127ed699d5e03999c26c9cd1ab12c7bd31b78661cc79017a9","sha256:68cefc6587531a1c361a755b9523fb041f6297d5f0f2b24bd3a01ea34941c88d"],"state_sha256":"6d497bcb22487e2380d884e71c60c595868561b0f8e40b6f20b7d8ffe2ded95c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+71n8OCj0qDC1+3eUxi81yt9LiSPgJcTJNEP7MSWkguQ2SUKgeB0e+xXy7U3KdCBVCS8YDyfVTGEUXnFgm8HAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:14:26.794565Z","bundle_sha256":"7d3f80cf530a735219322de7f7c9e1590b4043258422a65724edab1dcfe110a3"}}