{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:F66QAERAKDRPUJSU6A55K4ZX7Y","short_pith_number":"pith:F66QAERA","canonical_record":{"source":{"id":"1108.1170","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-04T19:15:04Z","cross_cats_sorted":["cs.AI","cs.SY"],"title_canon_sha256":"dc3d4e39350cbcfb9c2d8974e54c828bcce99e649c0a6f62b91f89a5d58959ec","abstract_canon_sha256":"9c9b836f61a76be9d32bd09db82509498fe1db476124b551f26ffa2520ad3a42"},"schema_version":"1.0"},"canonical_sha256":"2fbd00122050e2fa2654f03bd57337fe06498ef3f0c524577983a2f7f37ceb50","source":{"kind":"arxiv","id":"1108.1170","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1170","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1170v6","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1170","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"F66QAERAKDRP","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"F66QAERAKDRPUJSU","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"F66QAERA","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:F66QAERAKDRPUJSU6A55K4ZX7Y","target":"record","payload":{"canonical_record":{"source":{"id":"1108.1170","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-04T19:15:04Z","cross_cats_sorted":["cs.AI","cs.SY"],"title_canon_sha256":"dc3d4e39350cbcfb9c2d8974e54c828bcce99e649c0a6f62b91f89a5d58959ec","abstract_canon_sha256":"9c9b836f61a76be9d32bd09db82509498fe1db476124b551f26ffa2520ad3a42"},"schema_version":"1.0"},"canonical_sha256":"2fbd00122050e2fa2654f03bd57337fe06498ef3f0c524577983a2f7f37ceb50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:38.467143Z","signature_b64":"WDpkmDfWX06QCa09KSGVfe/kWbx1dBYziyi2cmhVaW4ZPuuOsn9OAI4uwMx+sLrU1Kr1ucN/vYrUk1tt26TqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fbd00122050e2fa2654f03bd57337fe06498ef3f0c524577983a2f7f37ceb50","last_reissued_at":"2026-05-18T04:05:38.466779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:38.466779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.1170","source_version":6,"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-18T04:05:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qjxqip5rrW861lH38BAJsjo+Ruyai3QmkGyqsLl+/UzfTJasp/0Xek77NPtxOxFdnE3LmwetQGMX1qVHBFyHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:28:47.019771Z"},"content_sha256":"187be0595d858ef0533758550f244192444271eb3e66e3dc3f6bf9dbeba2308d","schema_version":"1.0","event_id":"sha256:187be0595d858ef0533758550f244192444271eb3e66e3dc3f6bf9dbeba2308d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:F66QAERAKDRPUJSU6A55K4ZX7Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex Optimization without Projection Steps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SY"],"primary_cat":"math.OC","authors_text":"Martin Jaggi","submitted_at":"2011-08-04T19:15:04Z","abstract_excerpt":"For the general problem of minimizing a convex function over a compact convex domain, we will investigate a simple iterative approximation algorithm based on the method by Frank & Wolfe 1956, that does not need projection steps in order to stay inside the optimization domain. Instead of a projection step, the linearized problem defined by a current subgradient is solved, which gives a step direction that will naturally stay in the domain. Our framework generalizes the sparse greedy algorithm of Frank & Wolfe and its primal-dual analysis by Clarkson 2010 (and the low-rank SDP approach by Hazan "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1170","kind":"arxiv","version":6},"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-18T04:05:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2KjceyQbIMmgZz8DdvdmM7UPNmv9Wxo+vr0Gu/hFtMjzwohir+6lg9JuEYUiWb8SN5IDk1EATOLGDl0WoV72CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:28:47.020122Z"},"content_sha256":"bf19a1c487a8172b7458e5516b072c16af37dd113d9b42d0e44f25eaf68d7fb6","schema_version":"1.0","event_id":"sha256:bf19a1c487a8172b7458e5516b072c16af37dd113d9b42d0e44f25eaf68d7fb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F66QAERAKDRPUJSU6A55K4ZX7Y/bundle.json","state_url":"https://pith.science/pith/F66QAERAKDRPUJSU6A55K4ZX7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F66QAERAKDRPUJSU6A55K4ZX7Y/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-05T05:28:47Z","links":{"resolver":"https://pith.science/pith/F66QAERAKDRPUJSU6A55K4ZX7Y","bundle":"https://pith.science/pith/F66QAERAKDRPUJSU6A55K4ZX7Y/bundle.json","state":"https://pith.science/pith/F66QAERAKDRPUJSU6A55K4ZX7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F66QAERAKDRPUJSU6A55K4ZX7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:F66QAERAKDRPUJSU6A55K4ZX7Y","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":"9c9b836f61a76be9d32bd09db82509498fe1db476124b551f26ffa2520ad3a42","cross_cats_sorted":["cs.AI","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-04T19:15:04Z","title_canon_sha256":"dc3d4e39350cbcfb9c2d8974e54c828bcce99e649c0a6f62b91f89a5d58959ec"},"schema_version":"1.0","source":{"id":"1108.1170","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1170","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1170v6","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1170","created_at":"2026-05-18T04:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"F66QAERAKDRP","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"F66QAERAKDRPUJSU","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"F66QAERA","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:bf19a1c487a8172b7458e5516b072c16af37dd113d9b42d0e44f25eaf68d7fb6","target":"graph","created_at":"2026-05-18T04:05:38Z","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":"For the general problem of minimizing a convex function over a compact convex domain, we will investigate a simple iterative approximation algorithm based on the method by Frank & Wolfe 1956, that does not need projection steps in order to stay inside the optimization domain. Instead of a projection step, the linearized problem defined by a current subgradient is solved, which gives a step direction that will naturally stay in the domain. Our framework generalizes the sparse greedy algorithm of Frank & Wolfe and its primal-dual analysis by Clarkson 2010 (and the low-rank SDP approach by Hazan ","authors_text":"Martin Jaggi","cross_cats":["cs.AI","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-04T19:15:04Z","title":"Convex Optimization without Projection Steps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1170","kind":"arxiv","version":6},"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:187be0595d858ef0533758550f244192444271eb3e66e3dc3f6bf9dbeba2308d","target":"record","created_at":"2026-05-18T04:05:38Z","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":"9c9b836f61a76be9d32bd09db82509498fe1db476124b551f26ffa2520ad3a42","cross_cats_sorted":["cs.AI","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-08-04T19:15:04Z","title_canon_sha256":"dc3d4e39350cbcfb9c2d8974e54c828bcce99e649c0a6f62b91f89a5d58959ec"},"schema_version":"1.0","source":{"id":"1108.1170","kind":"arxiv","version":6}},"canonical_sha256":"2fbd00122050e2fa2654f03bd57337fe06498ef3f0c524577983a2f7f37ceb50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fbd00122050e2fa2654f03bd57337fe06498ef3f0c524577983a2f7f37ceb50","first_computed_at":"2026-05-18T04:05:38.466779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:38.466779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WDpkmDfWX06QCa09KSGVfe/kWbx1dBYziyi2cmhVaW4ZPuuOsn9OAI4uwMx+sLrU1Kr1ucN/vYrUk1tt26TqBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:38.467143Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.1170","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:187be0595d858ef0533758550f244192444271eb3e66e3dc3f6bf9dbeba2308d","sha256:bf19a1c487a8172b7458e5516b072c16af37dd113d9b42d0e44f25eaf68d7fb6"],"state_sha256":"5838923c7c97040ae762631c4d899a757b2b0c0051943aec0bb72e7c777c1741"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kFB6S6X4p3qW4TiWUjjaeN1I+09PYgfBaWCj1JzrCLWbh8xTl3MT/2wVtmQ5ROYpV1SrKJ6BwCOt8hLb6F0NAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:28:47.022243Z","bundle_sha256":"4130edc452d663311d1fd0c423a7ab9abb52237c5cee1f4a765acf1233f868d4"}}