{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:M5TFNOJRGSWRRY3AEV42DKJ5GW","short_pith_number":"pith:M5TFNOJR","canonical_record":{"source":{"id":"2208.05127","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-08-10T03:47:35Z","cross_cats_sorted":[],"title_canon_sha256":"f6dc4e58e04288b1424af6f887c86fb3c12cb5d6a44aef29e150679589cc95f7","abstract_canon_sha256":"004f01bea060b3a2697fb8f5a29105515999d884c6cd4afadb3eb373a59e43c8"},"schema_version":"1.0"},"canonical_sha256":"676656b93134ad18e3602579a1a93d3584d2f996b1584595492cda9880982ac3","source":{"kind":"arxiv","id":"2208.05127","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.05127","created_at":"2026-07-05T06:21:03Z"},{"alias_kind":"arxiv_version","alias_value":"2208.05127v3","created_at":"2026-07-05T06:21:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.05127","created_at":"2026-07-05T06:21:03Z"},{"alias_kind":"pith_short_12","alias_value":"M5TFNOJRGSWR","created_at":"2026-07-05T06:21:03Z"},{"alias_kind":"pith_short_16","alias_value":"M5TFNOJRGSWRRY3A","created_at":"2026-07-05T06:21:03Z"},{"alias_kind":"pith_short_8","alias_value":"M5TFNOJR","created_at":"2026-07-05T06:21:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:M5TFNOJRGSWRRY3AEV42DKJ5GW","target":"record","payload":{"canonical_record":{"source":{"id":"2208.05127","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-08-10T03:47:35Z","cross_cats_sorted":[],"title_canon_sha256":"f6dc4e58e04288b1424af6f887c86fb3c12cb5d6a44aef29e150679589cc95f7","abstract_canon_sha256":"004f01bea060b3a2697fb8f5a29105515999d884c6cd4afadb3eb373a59e43c8"},"schema_version":"1.0"},"canonical_sha256":"676656b93134ad18e3602579a1a93d3584d2f996b1584595492cda9880982ac3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:21:03.884117Z","signature_b64":"+w1Q1zUWiW4y8MVNiZrE96x94JIndOlDlfd/zlPOgk0aPUn8Z1QK6cwo++x2ulkcquzNB0kTHaO9BueJ+wyPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"676656b93134ad18e3602579a1a93d3584d2f996b1584595492cda9880982ac3","last_reissued_at":"2026-07-05T06:21:03.883746Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:21:03.883746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.05127","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-07-05T06:21:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ilnp+jnT/O8V4FjM5mzCwYZmv5kiouuMnYypbe1KGzvKKaeahaDK9A37DfZiNz2TMoDE/rgfKD/Gm2XhRJ+7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:33:12.873891Z"},"content_sha256":"e16beb45e8d4d33b029f8ae5c0debe67ac813e1935839cb078f99b203e42932a","schema_version":"1.0","event_id":"sha256:e16beb45e8d4d33b029f8ae5c0debe67ac813e1935839cb078f99b203e42932a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:M5TFNOJRGSWRRY3AEV42DKJ5GW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Projection-Free Non-Smooth Convex Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kamiar Asgari, Michael J. Neely","submitted_at":"2022-08-10T03:47:35Z","abstract_excerpt":"In this paper, we provide a sub-gradient based algorithm to solve general constrained convex optimization without taking projections onto the domain set. The well studied Frank-Wolfe type algorithms also avoid projections. However, they are only designed to handle smooth objective functions. The proposed algorithm treats both smooth and non-smooth problems and achieves an $O(1/\\sqrt{T})$ convergence rate (which matches existing lower bounds). The algorithm yields similar performance in expectation when the deterministic sub-gradients are replaced by stochastic sub-gradients. Thus, the proposed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.05127","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.05127/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:21:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D+u28F+jGcI23ujIcefN7G6cfT6NekU38fiXrru+CLCcEP41OzV3iAqjvjPrLLXlGnXfVg1jJ/jgUZzxQFe7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:33:12.874481Z"},"content_sha256":"9489fa3d284d387707523b8b3572ca2d2ab79a93658c24344cdcdc27114e388b","schema_version":"1.0","event_id":"sha256:9489fa3d284d387707523b8b3572ca2d2ab79a93658c24344cdcdc27114e388b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M5TFNOJRGSWRRY3AEV42DKJ5GW/bundle.json","state_url":"https://pith.science/pith/M5TFNOJRGSWRRY3AEV42DKJ5GW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M5TFNOJRGSWRRY3AEV42DKJ5GW/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-08-13T01:33:12Z","links":{"resolver":"https://pith.science/pith/M5TFNOJRGSWRRY3AEV42DKJ5GW","bundle":"https://pith.science/pith/M5TFNOJRGSWRRY3AEV42DKJ5GW/bundle.json","state":"https://pith.science/pith/M5TFNOJRGSWRRY3AEV42DKJ5GW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M5TFNOJRGSWRRY3AEV42DKJ5GW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:M5TFNOJRGSWRRY3AEV42DKJ5GW","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":"004f01bea060b3a2697fb8f5a29105515999d884c6cd4afadb3eb373a59e43c8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-08-10T03:47:35Z","title_canon_sha256":"f6dc4e58e04288b1424af6f887c86fb3c12cb5d6a44aef29e150679589cc95f7"},"schema_version":"1.0","source":{"id":"2208.05127","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.05127","created_at":"2026-07-05T06:21:03Z"},{"alias_kind":"arxiv_version","alias_value":"2208.05127v3","created_at":"2026-07-05T06:21:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.05127","created_at":"2026-07-05T06:21:03Z"},{"alias_kind":"pith_short_12","alias_value":"M5TFNOJRGSWR","created_at":"2026-07-05T06:21:03Z"},{"alias_kind":"pith_short_16","alias_value":"M5TFNOJRGSWRRY3A","created_at":"2026-07-05T06:21:03Z"},{"alias_kind":"pith_short_8","alias_value":"M5TFNOJR","created_at":"2026-07-05T06:21:03Z"}],"graph_snapshots":[{"event_id":"sha256:9489fa3d284d387707523b8b3572ca2d2ab79a93658c24344cdcdc27114e388b","target":"graph","created_at":"2026-07-05T06:21:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2208.05127/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we provide a sub-gradient based algorithm to solve general constrained convex optimization without taking projections onto the domain set. The well studied Frank-Wolfe type algorithms also avoid projections. However, they are only designed to handle smooth objective functions. The proposed algorithm treats both smooth and non-smooth problems and achieves an $O(1/\\sqrt{T})$ convergence rate (which matches existing lower bounds). The algorithm yields similar performance in expectation when the deterministic sub-gradients are replaced by stochastic sub-gradients. Thus, the proposed","authors_text":"Kamiar Asgari, Michael J. Neely","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-08-10T03:47:35Z","title":"Projection-Free Non-Smooth Convex Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.05127","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:e16beb45e8d4d33b029f8ae5c0debe67ac813e1935839cb078f99b203e42932a","target":"record","created_at":"2026-07-05T06:21:03Z","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":"004f01bea060b3a2697fb8f5a29105515999d884c6cd4afadb3eb373a59e43c8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-08-10T03:47:35Z","title_canon_sha256":"f6dc4e58e04288b1424af6f887c86fb3c12cb5d6a44aef29e150679589cc95f7"},"schema_version":"1.0","source":{"id":"2208.05127","kind":"arxiv","version":3}},"canonical_sha256":"676656b93134ad18e3602579a1a93d3584d2f996b1584595492cda9880982ac3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"676656b93134ad18e3602579a1a93d3584d2f996b1584595492cda9880982ac3","first_computed_at":"2026-07-05T06:21:03.883746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:21:03.883746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+w1Q1zUWiW4y8MVNiZrE96x94JIndOlDlfd/zlPOgk0aPUn8Z1QK6cwo++x2ulkcquzNB0kTHaO9BueJ+wyPDw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:21:03.884117Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.05127","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e16beb45e8d4d33b029f8ae5c0debe67ac813e1935839cb078f99b203e42932a","sha256:9489fa3d284d387707523b8b3572ca2d2ab79a93658c24344cdcdc27114e388b"],"state_sha256":"8fed8f101810ab64327d789463a82d82eae69540f23386b6c41a9afe08fdb000"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h/90mbKRU7cgyXTH7agxnLqeZmioBtJpGX4RFK5GuYQcolGfQIjEdiSZiH229+wh1Z3KDJG1h3ARv86GT09PCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T01:33:12.877988Z","bundle_sha256":"8d26c3e0963b2ca254cca22e09655d4ca2aa360ada026707a55880b0991696c6"}}