{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FZAU6LKFOWL3WVXEOFBFP4VLHA","short_pith_number":"pith:FZAU6LKF","schema_version":"1.0","canonical_sha256":"2e414f2d457597bb56e4714257f2ab38095fb48f4496fef7b10ce205c22758e5","source":{"kind":"arxiv","id":"1605.06203","version":1},"attestation_state":"computed","paper":{"title":"Faster Projection-free Convex Optimization over the Spectrahedron","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Dan Garber","submitted_at":"2016-05-20T03:07:40Z","abstract_excerpt":"Minimizing a convex function over the spectrahedron, i.e., the set of all positive semidefinite matrices with unit trace, is an important optimization task with many applications in optimization, machine learning, and signal processing. It is also notoriously difficult to solve in large-scale since standard techniques require expensive matrix decompositions. An alternative, is the conditional gradient method (aka Frank-Wolfe algorithm) that regained much interest in recent years, mostly due to its application to this specific setting. The key benefit of the CG method is that it avoids expensiv"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1605.06203","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-20T03:07:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"96843644ab72ac7fd5e54af93d6aab56a408f3a83e93431ad7a3e3614e9335ac","abstract_canon_sha256":"35c2ceef6a00ff56931ef099dc7cd41d927dfb0e25f51f5b8355f99108de8d50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:19.615570Z","signature_b64":"vdvOB0AxFGSQ1tVLVZ/ESGqFFuptScN43gvgg0dsAQecfINOR1A6rmwUstgbwHgMIwIYGsm9+DkviV27o+0oBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e414f2d457597bb56e4714257f2ab38095fb48f4496fef7b10ce205c22758e5","last_reissued_at":"2026-05-18T01:14:19.615034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:19.615034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Projection-free Convex Optimization over the Spectrahedron","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Dan Garber","submitted_at":"2016-05-20T03:07:40Z","abstract_excerpt":"Minimizing a convex function over the spectrahedron, i.e., the set of all positive semidefinite matrices with unit trace, is an important optimization task with many applications in optimization, machine learning, and signal processing. It is also notoriously difficult to solve in large-scale since standard techniques require expensive matrix decompositions. An alternative, is the conditional gradient method (aka Frank-Wolfe algorithm) that regained much interest in recent years, mostly due to its application to this specific setting. The key benefit of the CG method is that it avoids expensiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06203","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.06203","created_at":"2026-05-18T01:14:19.615117+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.06203v1","created_at":"2026-05-18T01:14:19.615117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06203","created_at":"2026-05-18T01:14:19.615117+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZAU6LKFOWL3","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZAU6LKFOWL3WVXE","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZAU6LKF","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FZAU6LKFOWL3WVXEOFBFP4VLHA","json":"https://pith.science/pith/FZAU6LKFOWL3WVXEOFBFP4VLHA.json","graph_json":"https://pith.science/api/pith-number/FZAU6LKFOWL3WVXEOFBFP4VLHA/graph.json","events_json":"https://pith.science/api/pith-number/FZAU6LKFOWL3WVXEOFBFP4VLHA/events.json","paper":"https://pith.science/paper/FZAU6LKF"},"agent_actions":{"view_html":"https://pith.science/pith/FZAU6LKFOWL3WVXEOFBFP4VLHA","download_json":"https://pith.science/pith/FZAU6LKFOWL3WVXEOFBFP4VLHA.json","view_paper":"https://pith.science/paper/FZAU6LKF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.06203&json=true","fetch_graph":"https://pith.science/api/pith-number/FZAU6LKFOWL3WVXEOFBFP4VLHA/graph.json","fetch_events":"https://pith.science/api/pith-number/FZAU6LKFOWL3WVXEOFBFP4VLHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZAU6LKFOWL3WVXEOFBFP4VLHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZAU6LKFOWL3WVXEOFBFP4VLHA/action/storage_attestation","attest_author":"https://pith.science/pith/FZAU6LKFOWL3WVXEOFBFP4VLHA/action/author_attestation","sign_citation":"https://pith.science/pith/FZAU6LKFOWL3WVXEOFBFP4VLHA/action/citation_signature","submit_replication":"https://pith.science/pith/FZAU6LKFOWL3WVXEOFBFP4VLHA/action/replication_record"}},"created_at":"2026-05-18T01:14:19.615117+00:00","updated_at":"2026-05-18T01:14:19.615117+00:00"}