{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4VC26TMHVG5RUCUVB6ER333LAK","short_pith_number":"pith:4VC26TMH","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"},"canonical_sha256":"e545af4d87a9bb1a0a950f891def6b0297ab15baf3855cd5ea815d0d244b3aee","source":{"kind":"arxiv","id":"2608.04321","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.04321","created_at":"2026-08-06T01:32:39Z"},{"alias_kind":"arxiv_version","alias_value":"2608.04321v1","created_at":"2026-08-06T01:32:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04321","created_at":"2026-08-06T01:32:39Z"},{"alias_kind":"pith_short_12","alias_value":"4VC26TMHVG5R","created_at":"2026-08-06T01:32:39Z"},{"alias_kind":"pith_short_16","alias_value":"4VC26TMHVG5RUCUV","created_at":"2026-08-06T01:32:39Z"},{"alias_kind":"pith_short_8","alias_value":"4VC26TMH","created_at":"2026-08-06T01:32:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4VC26TMHVG5RUCUVB6ER333LAK","target":"record","payload":{"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"},"canonical_sha256":"e545af4d87a9bb1a0a950f891def6b0297ab15baf3855cd5ea815d0d244b3aee","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"},"source_kind":"arxiv","source_id":"2608.04321","source_version":1,"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-08-06T01:32:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eT8EgwMeRTpATcY/zbLC6d3ahzhXSbWi4cmkwErGxRWrroS3s+JhCXEFhxbe+e4wTdLznJ+au1DgbpWg189DDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T17:44:21.823499Z"},"content_sha256":"db930d6a8dce8b7db76f6bd75e23938d0799a0a2ef5572295e12e8dc1d03375a","schema_version":"1.0","event_id":"sha256:db930d6a8dce8b7db76f6bd75e23938d0799a0a2ef5572295e12e8dc1d03375a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4VC26TMHVG5RUCUVB6ER333LAK","target":"graph","payload":{"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"},"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-08-06T01:32:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7hWSLxWw0a0SkNzTeWjGg0PVZNtP7tbgsdXYJxUY6bc37btxJ+NHBCd3hODfxTGt/SnWXq/43nU0OnJw8KxAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T17:44:21.824042Z"},"content_sha256":"3336556a3dc3aa82b59dd87de9fb64cf260d52f231eacd950ad12c5584cec5ea","schema_version":"1.0","event_id":"sha256:3336556a3dc3aa82b59dd87de9fb64cf260d52f231eacd950ad12c5584cec5ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4VC26TMHVG5RUCUVB6ER333LAK/bundle.json","state_url":"https://pith.science/pith/4VC26TMHVG5RUCUVB6ER333LAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4VC26TMHVG5RUCUVB6ER333LAK/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-09T17:44:21Z","links":{"resolver":"https://pith.science/pith/4VC26TMHVG5RUCUVB6ER333LAK","bundle":"https://pith.science/pith/4VC26TMHVG5RUCUVB6ER333LAK/bundle.json","state":"https://pith.science/pith/4VC26TMHVG5RUCUVB6ER333LAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4VC26TMHVG5RUCUVB6ER333LAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4VC26TMHVG5RUCUVB6ER333LAK","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":"26a1a350f3ad6413b627e10082de26927b9bb69f69e84fb28832733747a140bb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-08-05T01:04:00Z","title_canon_sha256":"6e72fdb77d8cb93b2e347877f31894182fd7e80c21ab4430888188233720a293"},"schema_version":"1.0","source":{"id":"2608.04321","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.04321","created_at":"2026-08-06T01:32:39Z"},{"alias_kind":"arxiv_version","alias_value":"2608.04321v1","created_at":"2026-08-06T01:32:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04321","created_at":"2026-08-06T01:32:39Z"},{"alias_kind":"pith_short_12","alias_value":"4VC26TMHVG5R","created_at":"2026-08-06T01:32:39Z"},{"alias_kind":"pith_short_16","alias_value":"4VC26TMHVG5RUCUV","created_at":"2026-08-06T01:32:39Z"},{"alias_kind":"pith_short_8","alias_value":"4VC26TMH","created_at":"2026-08-06T01:32:39Z"}],"graph_snapshots":[{"event_id":"sha256:3336556a3dc3aa82b59dd87de9fb64cf260d52f231eacd950ad12c5584cec5ea","target":"graph","created_at":"2026-08-06T01:32:39Z","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/2608.04321/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Elad Hazan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-08-05T01:04:00Z","title":"A Linearly Convergent Projection-Free Algorithm for Smooth Convex Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04321","kind":"arxiv","version":1},"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:db930d6a8dce8b7db76f6bd75e23938d0799a0a2ef5572295e12e8dc1d03375a","target":"record","created_at":"2026-08-06T01:32:39Z","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":"26a1a350f3ad6413b627e10082de26927b9bb69f69e84fb28832733747a140bb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-08-05T01:04:00Z","title_canon_sha256":"6e72fdb77d8cb93b2e347877f31894182fd7e80c21ab4430888188233720a293"},"schema_version":"1.0","source":{"id":"2608.04321","kind":"arxiv","version":1}},"canonical_sha256":"e545af4d87a9bb1a0a950f891def6b0297ab15baf3855cd5ea815d0d244b3aee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e545af4d87a9bb1a0a950f891def6b0297ab15baf3855cd5ea815d0d244b3aee","first_computed_at":"2026-08-06T01:32:39.416964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-06T01:32:39.416964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GQ42T4mVMdooCRdFykX2oJ8y5SXiLhMWE9ESuNOxK8SOkIS9psZa+2mcUi2DagXv4GYtnOhZxmi8QQkiPkHwCw==","signature_status":"signed_v1","signed_at":"2026-08-06T01:32:39.418453Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.04321","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db930d6a8dce8b7db76f6bd75e23938d0799a0a2ef5572295e12e8dc1d03375a","sha256:3336556a3dc3aa82b59dd87de9fb64cf260d52f231eacd950ad12c5584cec5ea"],"state_sha256":"b4a7712e5eddb34eeeb139f5bd368716ee0526a72f881d15d19298a0b96757be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V/t9YMFaaIEELf+EyhiazDDX0Na9ah+y0aPjLCrtH9lIJWSKgeQefHar29HIx6zazatPdDVzZ+pRgIQEGjahAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T17:44:21.830652Z","bundle_sha256":"8d5cb16bd31588ab8e93cd9bc1ceeab82994fb71c22faf56e9ab4a39a2521ca0"}}