{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4VC26TMHVG5RUCUVB6ER333LAK","short_pith_number":"pith:4VC26TMH","schema_version":"1.0","canonical_sha256":"e545af4d87a9bb1a0a950f891def6b0297ab15baf3855cd5ea815d0d244b3aee","source":{"kind":"arxiv","id":"2608.04321","version":1},"attestation_state":"computed","paper":{"title":"A Linearly Convergent Projection-Free Algorithm for Smooth Convex Sets","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Elad Hazan","submitted_at":"2026-08-05T01:04:00Z","abstract_excerpt":"We consider minimizing a smooth, strongly convex function over a convex set. Projected gradient descent is known to converge linearly in this setting, but each iteration requires a projection onto the feasible set, which may be computationally expensive.\n  We show that when the feasible set is smooth, projection can be replaced by one gradient computation and a single supporting-tangent computation per iteration, while preserving linear convergence. Moreover, the required tangent can be approximated to sufficient accuracy using $\\widetilde O(d)$ membership-oracle queries, where $d$ is the ambi"},"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":"2608.04321","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-08-05T01:04:00Z","cross_cats_sorted":[],"title_canon_sha256":"6e72fdb77d8cb93b2e347877f31894182fd7e80c21ab4430888188233720a293","abstract_canon_sha256":"26a1a350f3ad6413b627e10082de26927b9bb69f69e84fb28832733747a140bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-06T01:32:39.418453Z","signature_b64":"GQ42T4mVMdooCRdFykX2oJ8y5SXiLhMWE9ESuNOxK8SOkIS9psZa+2mcUi2DagXv4GYtnOhZxmi8QQkiPkHwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e545af4d87a9bb1a0a950f891def6b0297ab15baf3855cd5ea815d0d244b3aee","last_reissued_at":"2026-08-06T01:32:39.416964Z","signature_status":"signed_v1","first_computed_at":"2026-08-06T01:32:39.416964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Linearly Convergent Projection-Free Algorithm for Smooth Convex Sets","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Elad Hazan","submitted_at":"2026-08-05T01:04:00Z","abstract_excerpt":"We consider minimizing a smooth, strongly convex function over a convex set. Projected gradient descent is known to converge linearly in this setting, but each iteration requires a projection onto the feasible set, which may be computationally expensive.\n  We show that when the feasible set is smooth, projection can be replaced by one gradient computation and a single supporting-tangent computation per iteration, while preserving linear convergence. Moreover, the required tangent can be approximated to sufficient accuracy using $\\widetilde O(d)$ membership-oracle queries, where $d$ is the ambi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04321","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.04321/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.04321","created_at":"2026-08-06T01:32:39.418764+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.04321v1","created_at":"2026-08-06T01:32:39.418764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04321","created_at":"2026-08-06T01:32:39.418764+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VC26TMHVG5R","created_at":"2026-08-06T01:32:39.418764+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VC26TMHVG5RUCUV","created_at":"2026-08-06T01:32:39.418764+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VC26TMH","created_at":"2026-08-06T01:32:39.418764+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/4VC26TMHVG5RUCUVB6ER333LAK","json":"https://pith.science/pith/4VC26TMHVG5RUCUVB6ER333LAK.json","graph_json":"https://pith.science/api/pith-number/4VC26TMHVG5RUCUVB6ER333LAK/graph.json","events_json":"https://pith.science/api/pith-number/4VC26TMHVG5RUCUVB6ER333LAK/events.json","paper":"https://pith.science/paper/4VC26TMH"},"agent_actions":{"view_html":"https://pith.science/pith/4VC26TMHVG5RUCUVB6ER333LAK","download_json":"https://pith.science/pith/4VC26TMHVG5RUCUVB6ER333LAK.json","view_paper":"https://pith.science/paper/4VC26TMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.04321&json=true","fetch_graph":"https://pith.science/api/pith-number/4VC26TMHVG5RUCUVB6ER333LAK/graph.json","fetch_events":"https://pith.science/api/pith-number/4VC26TMHVG5RUCUVB6ER333LAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VC26TMHVG5RUCUVB6ER333LAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VC26TMHVG5RUCUVB6ER333LAK/action/storage_attestation","attest_author":"https://pith.science/pith/4VC26TMHVG5RUCUVB6ER333LAK/action/author_attestation","sign_citation":"https://pith.science/pith/4VC26TMHVG5RUCUVB6ER333LAK/action/citation_signature","submit_replication":"https://pith.science/pith/4VC26TMHVG5RUCUVB6ER333LAK/action/replication_record"}},"created_at":"2026-08-06T01:32:39.418764+00:00","updated_at":"2026-08-06T01:32:39.418764+00:00"}