{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ANDBYWWXYRUW45IJ3GOFTWUUGF","short_pith_number":"pith:ANDBYWWX","canonical_record":{"source":{"id":"1906.02436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-06T06:25:37Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"e4bb182dbbc272729b801a9a03b94642de60757e4e3ec4232a4259b4b1bd2ce6","abstract_canon_sha256":"954023efe5cde7a6b6c9ee7fca95c2e0247a92cba55be75e257b56a2a27fcdef"},"schema_version":"1.0"},"canonical_sha256":"03461c5ad7c4696e7509d99c59da943176f7931d1cd4ddcfb018b73c4d8fe113","source":{"kind":"arxiv","id":"1906.02436","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02436","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02436v1","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02436","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"pith_short_12","alias_value":"ANDBYWWXYRUW","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"ANDBYWWXYRUW45IJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"ANDBYWWX","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ANDBYWWXYRUW45IJ3GOFTWUUGF","target":"record","payload":{"canonical_record":{"source":{"id":"1906.02436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-06T06:25:37Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"e4bb182dbbc272729b801a9a03b94642de60757e4e3ec4232a4259b4b1bd2ce6","abstract_canon_sha256":"954023efe5cde7a6b6c9ee7fca95c2e0247a92cba55be75e257b56a2a27fcdef"},"schema_version":"1.0"},"canonical_sha256":"03461c5ad7c4696e7509d99c59da943176f7931d1cd4ddcfb018b73c4d8fe113","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:01.222089Z","signature_b64":"AiXzs3fI6DtErYD/4uWD76QWo90kqWM6RYQclqga9O0Z8zCdYmqJY3B5coCeRgT36fraANIql4lEQVRjJNqSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03461c5ad7c4696e7509d99c59da943176f7931d1cd4ddcfb018b73c4d8fe113","last_reissued_at":"2026-05-17T23:44:01.221537Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:01.221537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.02436","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-17T23:44:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hgxNTQPJGEghDvChEfdE5gGBg5FrhW1zb9YNuCvHamgx4SirSXOVbKltPvruT8oe3tKgNVRmERKdRIoPGltABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:03:38.934861Z"},"content_sha256":"8bf95a6b371e34ae3609829d699aad616f5e78488858d684039c2aec1cea77db","schema_version":"1.0","event_id":"sha256:8bf95a6b371e34ae3609829d699aad616f5e78488858d684039c2aec1cea77db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ANDBYWWXYRUW45IJ3GOFTWUUGF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Primal-Dual Block Frank-Wolfe","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandros G. Dimakis, Constantine Caramanis, Inderjit S. Dhillon, Jiacheng Zhuo, Qi Lei","submitted_at":"2019-06-06T06:25:37Z","abstract_excerpt":"We propose a variant of the Frank-Wolfe algorithm for solving a class of sparse/low-rank optimization problems. Our formulation includes Elastic Net, regularized SVMs and phase retrieval as special cases. The proposed Primal-Dual Block Frank-Wolfe algorithm reduces the per-iteration cost while maintaining linear convergence rate. The per iteration cost of our method depends on the structural complexity of the solution (i.e. sparsity/low-rank) instead of the ambient dimension. We empirically show that our algorithm outperforms the state-of-the-art methods on (multi-class) classification tasks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02436","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-17T23:44:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CL+lj7slwGnnMReE87MolW/QQyCqeHV+NSXg8Jwu5xtlxLqO4OhPNOQZnGqZn7bsLO/wxO5iqiFV9QTpkS39Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:03:38.935345Z"},"content_sha256":"d7daf61cdd417c8fb5412cf1ad18c2ad96c59ec8f8ed54574a76c647f23cf5b2","schema_version":"1.0","event_id":"sha256:d7daf61cdd417c8fb5412cf1ad18c2ad96c59ec8f8ed54574a76c647f23cf5b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ANDBYWWXYRUW45IJ3GOFTWUUGF/bundle.json","state_url":"https://pith.science/pith/ANDBYWWXYRUW45IJ3GOFTWUUGF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ANDBYWWXYRUW45IJ3GOFTWUUGF/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-25T12:03:38Z","links":{"resolver":"https://pith.science/pith/ANDBYWWXYRUW45IJ3GOFTWUUGF","bundle":"https://pith.science/pith/ANDBYWWXYRUW45IJ3GOFTWUUGF/bundle.json","state":"https://pith.science/pith/ANDBYWWXYRUW45IJ3GOFTWUUGF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ANDBYWWXYRUW45IJ3GOFTWUUGF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ANDBYWWXYRUW45IJ3GOFTWUUGF","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":"954023efe5cde7a6b6c9ee7fca95c2e0247a92cba55be75e257b56a2a27fcdef","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-06T06:25:37Z","title_canon_sha256":"e4bb182dbbc272729b801a9a03b94642de60757e4e3ec4232a4259b4b1bd2ce6"},"schema_version":"1.0","source":{"id":"1906.02436","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02436","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02436v1","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02436","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"pith_short_12","alias_value":"ANDBYWWXYRUW","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"ANDBYWWXYRUW45IJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"ANDBYWWX","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:d7daf61cdd417c8fb5412cf1ad18c2ad96c59ec8f8ed54574a76c647f23cf5b2","target":"graph","created_at":"2026-05-17T23:44:01Z","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 propose a variant of the Frank-Wolfe algorithm for solving a class of sparse/low-rank optimization problems. Our formulation includes Elastic Net, regularized SVMs and phase retrieval as special cases. The proposed Primal-Dual Block Frank-Wolfe algorithm reduces the per-iteration cost while maintaining linear convergence rate. The per iteration cost of our method depends on the structural complexity of the solution (i.e. sparsity/low-rank) instead of the ambient dimension. We empirically show that our algorithm outperforms the state-of-the-art methods on (multi-class) classification tasks.","authors_text":"Alexandros G. Dimakis, Constantine Caramanis, Inderjit S. Dhillon, Jiacheng Zhuo, Qi Lei","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-06T06:25:37Z","title":"Primal-Dual Block Frank-Wolfe"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02436","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:8bf95a6b371e34ae3609829d699aad616f5e78488858d684039c2aec1cea77db","target":"record","created_at":"2026-05-17T23:44:01Z","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":"954023efe5cde7a6b6c9ee7fca95c2e0247a92cba55be75e257b56a2a27fcdef","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-06T06:25:37Z","title_canon_sha256":"e4bb182dbbc272729b801a9a03b94642de60757e4e3ec4232a4259b4b1bd2ce6"},"schema_version":"1.0","source":{"id":"1906.02436","kind":"arxiv","version":1}},"canonical_sha256":"03461c5ad7c4696e7509d99c59da943176f7931d1cd4ddcfb018b73c4d8fe113","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03461c5ad7c4696e7509d99c59da943176f7931d1cd4ddcfb018b73c4d8fe113","first_computed_at":"2026-05-17T23:44:01.221537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:01.221537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AiXzs3fI6DtErYD/4uWD76QWo90kqWM6RYQclqga9O0Z8zCdYmqJY3B5coCeRgT36fraANIql4lEQVRjJNqSAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:01.222089Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.02436","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8bf95a6b371e34ae3609829d699aad616f5e78488858d684039c2aec1cea77db","sha256:d7daf61cdd417c8fb5412cf1ad18c2ad96c59ec8f8ed54574a76c647f23cf5b2"],"state_sha256":"aede3b31c395a382b87dc359ba677134631874672dfe4f7f87164930037e4c01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oQNndxbIAerfGJ1aZ6Gvi827y2y3ccf6kMkZVd181vp2IJ+ZrGX/tmDvFoGVthYHLKcAp9a74gObBtcipI9jBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:03:38.938865Z","bundle_sha256":"a64f85c3c1aedc983f9559336b89727bd84cb739196df9ee7731f243590c46c4"}}