{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IIKLQRXNQTH6Y65LCUPFHIIAJT","short_pith_number":"pith:IIKLQRXN","canonical_record":{"source":{"id":"1410.4828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-17T19:19:29Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"abb19d4114e6c7ca8bafd741dd7fb3d3a7ceb32981360488aafdf6e2397c8a65","abstract_canon_sha256":"596e61ddca5b303abf1b6989d2d647d96a432e4c2906d345156eaa1c035489cc"},"schema_version":"1.0"},"canonical_sha256":"4214b846ed84cfec7bab151e53a1004ce569a5a22a70de4f65f20b8d642aa04f","source":{"kind":"arxiv","id":"1410.4828","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4828","created_at":"2026-05-18T02:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4828v1","created_at":"2026-05-18T02:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4828","created_at":"2026-05-18T02:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"IIKLQRXNQTH6","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IIKLQRXNQTH6Y65L","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IIKLQRXN","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IIKLQRXNQTH6Y65LCUPFHIIAJT","target":"record","payload":{"canonical_record":{"source":{"id":"1410.4828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-17T19:19:29Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"abb19d4114e6c7ca8bafd741dd7fb3d3a7ceb32981360488aafdf6e2397c8a65","abstract_canon_sha256":"596e61ddca5b303abf1b6989d2d647d96a432e4c2906d345156eaa1c035489cc"},"schema_version":"1.0"},"canonical_sha256":"4214b846ed84cfec7bab151e53a1004ce569a5a22a70de4f65f20b8d642aa04f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:54.646964Z","signature_b64":"R72llv6UxU+T7TmkRYDnYawewXM2vweHtQ1fpX9BTIa7ZmGTrkYFxCvSkN+7Z4BKcAFglBcZG5s8PjYxmvIvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4214b846ed84cfec7bab151e53a1004ce569a5a22a70de4f65f20b8d642aa04f","last_reissued_at":"2026-05-18T02:39:54.646413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:54.646413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.4828","source_version":1,"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:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tKsaksb/CY7/sJU4D7y69S9gDMOz+2zWgM5kSWRWILOpnrYtpzFvrs+m31fFVrn85RdZLZdrf0a1jKpY9qpYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:44:27.772704Z"},"content_sha256":"d6ab75bd04590d860e6422fe387ccf874b5ba5d60b37bb07079f63c1b8e6dc0d","schema_version":"1.0","event_id":"sha256:d6ab75bd04590d860e6422fe387ccf874b5ba5d60b37bb07079f63c1b8e6dc0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IIKLQRXNQTH6Y65LCUPFHIIAJT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Conditional Gradient for Sparse Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Dale Schuurmans, Xinhua Zhang, Yaoliang Yu","submitted_at":"2014-10-17T19:19:29Z","abstract_excerpt":"Structured sparsity is an important modeling tool that expands the applicability of convex formulations for data analysis, however it also creates significant challenges for efficient algorithm design. In this paper we investigate the generalized conditional gradient (GCG) algorithm for solving structured sparse optimization problems---demonstrating that, with some enhancements, it can provide a more efficient alternative to current state of the art approaches. After providing a comprehensive overview of the convergence properties of GCG, we develop efficient methods for evaluating polar opera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4828","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"},"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:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RmsJwlGGYoPOQZwmUkqnT2Ymxk9Gh6rluC89tIpgCkcgB20iz3s86ZGQQGDsSaOShcABaH01pfbrJzVUS8wLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:44:27.773415Z"},"content_sha256":"2c07fd4e19a52eae6209261f033dbf03912c4a509108e83f0b2bda245ba37d68","schema_version":"1.0","event_id":"sha256:2c07fd4e19a52eae6209261f033dbf03912c4a509108e83f0b2bda245ba37d68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IIKLQRXNQTH6Y65LCUPFHIIAJT/bundle.json","state_url":"https://pith.science/pith/IIKLQRXNQTH6Y65LCUPFHIIAJT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IIKLQRXNQTH6Y65LCUPFHIIAJT/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-07T20:44:27Z","links":{"resolver":"https://pith.science/pith/IIKLQRXNQTH6Y65LCUPFHIIAJT","bundle":"https://pith.science/pith/IIKLQRXNQTH6Y65LCUPFHIIAJT/bundle.json","state":"https://pith.science/pith/IIKLQRXNQTH6Y65LCUPFHIIAJT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IIKLQRXNQTH6Y65LCUPFHIIAJT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IIKLQRXNQTH6Y65LCUPFHIIAJT","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":"596e61ddca5b303abf1b6989d2d647d96a432e4c2906d345156eaa1c035489cc","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-17T19:19:29Z","title_canon_sha256":"abb19d4114e6c7ca8bafd741dd7fb3d3a7ceb32981360488aafdf6e2397c8a65"},"schema_version":"1.0","source":{"id":"1410.4828","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4828","created_at":"2026-05-18T02:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4828v1","created_at":"2026-05-18T02:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4828","created_at":"2026-05-18T02:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"IIKLQRXNQTH6","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IIKLQRXNQTH6Y65L","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IIKLQRXN","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:2c07fd4e19a52eae6209261f033dbf03912c4a509108e83f0b2bda245ba37d68","target":"graph","created_at":"2026-05-18T02:39:54Z","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":"Structured sparsity is an important modeling tool that expands the applicability of convex formulations for data analysis, however it also creates significant challenges for efficient algorithm design. In this paper we investigate the generalized conditional gradient (GCG) algorithm for solving structured sparse optimization problems---demonstrating that, with some enhancements, it can provide a more efficient alternative to current state of the art approaches. After providing a comprehensive overview of the convergence properties of GCG, we develop efficient methods for evaluating polar opera","authors_text":"Dale Schuurmans, Xinhua Zhang, Yaoliang Yu","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-17T19:19:29Z","title":"Generalized Conditional Gradient for Sparse Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4828","kind":"arxiv","version":1},"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:d6ab75bd04590d860e6422fe387ccf874b5ba5d60b37bb07079f63c1b8e6dc0d","target":"record","created_at":"2026-05-18T02:39:54Z","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":"596e61ddca5b303abf1b6989d2d647d96a432e4c2906d345156eaa1c035489cc","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-17T19:19:29Z","title_canon_sha256":"abb19d4114e6c7ca8bafd741dd7fb3d3a7ceb32981360488aafdf6e2397c8a65"},"schema_version":"1.0","source":{"id":"1410.4828","kind":"arxiv","version":1}},"canonical_sha256":"4214b846ed84cfec7bab151e53a1004ce569a5a22a70de4f65f20b8d642aa04f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4214b846ed84cfec7bab151e53a1004ce569a5a22a70de4f65f20b8d642aa04f","first_computed_at":"2026-05-18T02:39:54.646413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:54.646413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R72llv6UxU+T7TmkRYDnYawewXM2vweHtQ1fpX9BTIa7ZmGTrkYFxCvSkN+7Z4BKcAFglBcZG5s8PjYxmvIvBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:54.646964Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4828","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6ab75bd04590d860e6422fe387ccf874b5ba5d60b37bb07079f63c1b8e6dc0d","sha256:2c07fd4e19a52eae6209261f033dbf03912c4a509108e83f0b2bda245ba37d68"],"state_sha256":"c830fd95b119d03dcb4598173060221a9501f65889819ef7783c6ead6868c86e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qCRWcVF1hhdJth5V/wh2D7p/QVP9LToVR4F10EwIikaT1JgDaooWaGkFzic4uwemRTH+e4geHDe8llxuBo2FDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:44:27.777181Z","bundle_sha256":"e922fd2d706d1586cb5058e451a1344e31bfa0e2392a1b02dd80d3b0da1ea62c"}}