{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7C24YSPKM2HDU7GB3LBEIYVR3E","short_pith_number":"pith:7C24YSPK","canonical_record":{"source":{"id":"1708.02105","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-07T13:07:20Z","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"title_canon_sha256":"d4bb85cb35d3cf3df5e98bd02a12b945b81839e6045ee4eb42c94fd5ac4b2c83","abstract_canon_sha256":"e655ea3de2cc0f4b2ca89f7817f8d088e3bc596ca20b2407950fea49bfbe7a99"},"schema_version":"1.0"},"canonical_sha256":"f8b5cc49ea668e3a7cc1dac24462b1d9206abe80f194b72130e7ba6b043b6bae","source":{"kind":"arxiv","id":"1708.02105","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02105","created_at":"2026-05-18T00:30:57Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02105v3","created_at":"2026-05-18T00:30:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02105","created_at":"2026-05-18T00:30:57Z"},{"alias_kind":"pith_short_12","alias_value":"7C24YSPKM2HD","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7C24YSPKM2HDU7GB","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7C24YSPK","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7C24YSPKM2HDU7GB3LBEIYVR3E","target":"record","payload":{"canonical_record":{"source":{"id":"1708.02105","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-07T13:07:20Z","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"title_canon_sha256":"d4bb85cb35d3cf3df5e98bd02a12b945b81839e6045ee4eb42c94fd5ac4b2c83","abstract_canon_sha256":"e655ea3de2cc0f4b2ca89f7817f8d088e3bc596ca20b2407950fea49bfbe7a99"},"schema_version":"1.0"},"canonical_sha256":"f8b5cc49ea668e3a7cc1dac24462b1d9206abe80f194b72130e7ba6b043b6bae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:57.519807Z","signature_b64":"9Ssocbunqct3iEsd1/WZe9gtcmcMssY4sEc9w54DP3KwSrk4w/15pYf7zod3fk5tbe0f4adncxp4oHTni935Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8b5cc49ea668e3a7cc1dac24462b1d9206abe80f194b72130e7ba6b043b6bae","last_reissued_at":"2026-05-18T00:30:57.519356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:57.519356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.02105","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-18T00:30:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qcWG58hFJB8m7ZtwIj78fIO6GmpCyHTuIup9XK857TIopvqF9gCq3duvnws3/MFs2JSA/fVMXFSS1VDJ41dJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:37:40.761405Z"},"content_sha256":"7fe6f03469f281f2d234864cac15516b6ce16bdaa3cb352764b6967ce8747d3d","schema_version":"1.0","event_id":"sha256:7fe6f03469f281f2d234864cac15516b6ce16bdaa3cb352764b6967ce8747d3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7C24YSPKM2HDU7GB3LBEIYVR3E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Convergence of a Frank-Wolfe Type Algorithm over Trace-Norm Balls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Elad Hazan, Wei Hu, Yuanzhi Li, Zeyuan Allen-Zhu","submitted_at":"2017-08-07T13:07:20Z","abstract_excerpt":"We propose a rank-$k$ variant of the classical Frank-Wolfe algorithm to solve convex optimization over a trace-norm ball. Our algorithm replaces the top singular-vector computation ($1$-SVD) in Frank-Wolfe with a top-$k$ singular-vector computation ($k$-SVD), which can be done by repeatedly applying $1$-SVD $k$ times. Alternatively, our algorithm can be viewed as a rank-$k$ restricted version of projected gradient descent. We show that our algorithm has a linear convergence rate when the objective function is smooth and strongly convex, and the optimal solution has rank at most $k$. This impro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02105","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-18T00:30:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eJKVppGQw8uV7gwkBuEbAwBuixV/BMb2tb9dRkZwpulJcTneH5HE+ZfB9pVfoBIG66DjFOkQjjASlIqEfH2TCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:37:40.762027Z"},"content_sha256":"bcec2bf2419c68627d11b643a78b22a091e948373ce2e5c264fd3527c949c40d","schema_version":"1.0","event_id":"sha256:bcec2bf2419c68627d11b643a78b22a091e948373ce2e5c264fd3527c949c40d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7C24YSPKM2HDU7GB3LBEIYVR3E/bundle.json","state_url":"https://pith.science/pith/7C24YSPKM2HDU7GB3LBEIYVR3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7C24YSPKM2HDU7GB3LBEIYVR3E/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-01T04:37:40Z","links":{"resolver":"https://pith.science/pith/7C24YSPKM2HDU7GB3LBEIYVR3E","bundle":"https://pith.science/pith/7C24YSPKM2HDU7GB3LBEIYVR3E/bundle.json","state":"https://pith.science/pith/7C24YSPKM2HDU7GB3LBEIYVR3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7C24YSPKM2HDU7GB3LBEIYVR3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7C24YSPKM2HDU7GB3LBEIYVR3E","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":"e655ea3de2cc0f4b2ca89f7817f8d088e3bc596ca20b2407950fea49bfbe7a99","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-07T13:07:20Z","title_canon_sha256":"d4bb85cb35d3cf3df5e98bd02a12b945b81839e6045ee4eb42c94fd5ac4b2c83"},"schema_version":"1.0","source":{"id":"1708.02105","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02105","created_at":"2026-05-18T00:30:57Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02105v3","created_at":"2026-05-18T00:30:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02105","created_at":"2026-05-18T00:30:57Z"},{"alias_kind":"pith_short_12","alias_value":"7C24YSPKM2HD","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"7C24YSPKM2HDU7GB","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"7C24YSPK","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:bcec2bf2419c68627d11b643a78b22a091e948373ce2e5c264fd3527c949c40d","target":"graph","created_at":"2026-05-18T00:30:57Z","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 rank-$k$ variant of the classical Frank-Wolfe algorithm to solve convex optimization over a trace-norm ball. Our algorithm replaces the top singular-vector computation ($1$-SVD) in Frank-Wolfe with a top-$k$ singular-vector computation ($k$-SVD), which can be done by repeatedly applying $1$-SVD $k$ times. Alternatively, our algorithm can be viewed as a rank-$k$ restricted version of projected gradient descent. We show that our algorithm has a linear convergence rate when the objective function is smooth and strongly convex, and the optimal solution has rank at most $k$. This impro","authors_text":"Elad Hazan, Wei Hu, Yuanzhi Li, Zeyuan Allen-Zhu","cross_cats":["cs.DS","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-07T13:07:20Z","title":"Linear Convergence of a Frank-Wolfe Type Algorithm over Trace-Norm Balls"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02105","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:7fe6f03469f281f2d234864cac15516b6ce16bdaa3cb352764b6967ce8747d3d","target":"record","created_at":"2026-05-18T00:30:57Z","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":"e655ea3de2cc0f4b2ca89f7817f8d088e3bc596ca20b2407950fea49bfbe7a99","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-07T13:07:20Z","title_canon_sha256":"d4bb85cb35d3cf3df5e98bd02a12b945b81839e6045ee4eb42c94fd5ac4b2c83"},"schema_version":"1.0","source":{"id":"1708.02105","kind":"arxiv","version":3}},"canonical_sha256":"f8b5cc49ea668e3a7cc1dac24462b1d9206abe80f194b72130e7ba6b043b6bae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8b5cc49ea668e3a7cc1dac24462b1d9206abe80f194b72130e7ba6b043b6bae","first_computed_at":"2026-05-18T00:30:57.519356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:57.519356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9Ssocbunqct3iEsd1/WZe9gtcmcMssY4sEc9w54DP3KwSrk4w/15pYf7zod3fk5tbe0f4adncxp4oHTni935Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:57.519807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02105","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fe6f03469f281f2d234864cac15516b6ce16bdaa3cb352764b6967ce8747d3d","sha256:bcec2bf2419c68627d11b643a78b22a091e948373ce2e5c264fd3527c949c40d"],"state_sha256":"b2319173eb34ea458421aa8f99f21ce73bf4256a0f539517b5721501162ceda9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U2Pg7IWJC2NDF6EXBuVnsRcLVIhZhnQry4TmymM3Rv7+u01uG2Om8+vp8b/hQQ7/JWLMKa7OUzZSimcegL5kAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:37:40.764823Z","bundle_sha256":"14966dfc0c001b9b86030c21146a0d0cc02116846b0e1e90c538294265e9976f"}}