{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:EF7VOGQVJLOA4DG4372WVHOG4Z","short_pith_number":"pith:EF7VOGQV","canonical_record":{"source":{"id":"1107.4623","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-07-22T20:42:47Z","cross_cats_sorted":["cs.IT","math.IT","math.OC","stat.ML"],"title_canon_sha256":"48eb619bcb159c486a9b959b26ffb4654bb065a24b337119765c22e2e63c6f82","abstract_canon_sha256":"9418a60f16a5cdfb66b09a72cd1a0a63b30920c5a2dddb7f0504a48ddda08ac4"},"schema_version":"1.0"},"canonical_sha256":"217f571a154adc0e0cdcdff56a9dc6e64591f239f7cbb2dd243c970b90505168","source":{"kind":"arxiv","id":"1107.4623","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4623","created_at":"2026-05-18T03:32:05Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4623v5","created_at":"2026-05-18T03:32:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4623","created_at":"2026-05-18T03:32:05Z"},{"alias_kind":"pith_short_12","alias_value":"EF7VOGQVJLOA","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EF7VOGQVJLOA4DG4","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EF7VOGQV","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:EF7VOGQVJLOA4DG4372WVHOG4Z","target":"record","payload":{"canonical_record":{"source":{"id":"1107.4623","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-07-22T20:42:47Z","cross_cats_sorted":["cs.IT","math.IT","math.OC","stat.ML"],"title_canon_sha256":"48eb619bcb159c486a9b959b26ffb4654bb065a24b337119765c22e2e63c6f82","abstract_canon_sha256":"9418a60f16a5cdfb66b09a72cd1a0a63b30920c5a2dddb7f0504a48ddda08ac4"},"schema_version":"1.0"},"canonical_sha256":"217f571a154adc0e0cdcdff56a9dc6e64591f239f7cbb2dd243c970b90505168","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:05.929976Z","signature_b64":"fnpCo/tIhoZSdZVsuTIZWq6nup6u4cKgZsuBERL0rO+Xjz9EmLimOKUUFdh9vxsJEZypSwl0szo2IDmTEZrxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"217f571a154adc0e0cdcdff56a9dc6e64591f239f7cbb2dd243c970b90505168","last_reissued_at":"2026-05-18T03:32:05.929528Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:05.929528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.4623","source_version":5,"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-18T03:32:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KZdfQz9/7M5t7q7Fpy79Z6MbFIKCf3TrrBRg5PnDXpd/jAJeyFglm3Ha9WId108OFvNXTcaLcFY1ylnT2TCgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:29:48.528928Z"},"content_sha256":"1cea87e5e6ddafddc55955bab80d6652f07e2a56dcef928a5ec43bd9df060144","schema_version":"1.0","event_id":"sha256:1cea87e5e6ddafddc55955bab80d6652f07e2a56dcef928a5ec43bd9df060144"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:EF7VOGQVJLOA4DG4372WVHOG4Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Unifying Analysis of Projected Gradient Descent for $\\ell_p$-constrained Least Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC","stat.ML"],"primary_cat":"math.NA","authors_text":"Bhiksha Raj, Sohail Bahmani","submitted_at":"2011-07-22T20:42:47Z","abstract_excerpt":"In this paper we study the performance of the Projected Gradient Descent(PGD) algorithm for $\\ell_{p}$-constrained least squares problems that arise in the framework of Compressed Sensing. Relying on the Restricted Isometry Property, we provide convergence guarantees for this algorithm for the entire range of $0\\leq p\\leq1$, that include and generalize the existing results for the Iterative Hard Thresholding algorithm and provide a new accuracy guarantee for the Iterative Soft Thresholding algorithm as special cases. Our results suggest that in this group of algorithms, as $p$ increases from z"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4623","kind":"arxiv","version":5},"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-18T03:32:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x79jw2CHfXQlh5wQ17B9QHf6Au/47WqAbPGJKLDFyz9bb6eGY0Z5fFimuVrvKQO29XTmF4+rtwbN2iiOhsxNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:29:48.529695Z"},"content_sha256":"5013aa941d4062101a5a8443f0a6d5a88f834f65510f834488ac2b1b4d15def3","schema_version":"1.0","event_id":"sha256:5013aa941d4062101a5a8443f0a6d5a88f834f65510f834488ac2b1b4d15def3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EF7VOGQVJLOA4DG4372WVHOG4Z/bundle.json","state_url":"https://pith.science/pith/EF7VOGQVJLOA4DG4372WVHOG4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EF7VOGQVJLOA4DG4372WVHOG4Z/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-05-31T02:29:48Z","links":{"resolver":"https://pith.science/pith/EF7VOGQVJLOA4DG4372WVHOG4Z","bundle":"https://pith.science/pith/EF7VOGQVJLOA4DG4372WVHOG4Z/bundle.json","state":"https://pith.science/pith/EF7VOGQVJLOA4DG4372WVHOG4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EF7VOGQVJLOA4DG4372WVHOG4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:EF7VOGQVJLOA4DG4372WVHOG4Z","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":"9418a60f16a5cdfb66b09a72cd1a0a63b30920c5a2dddb7f0504a48ddda08ac4","cross_cats_sorted":["cs.IT","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-07-22T20:42:47Z","title_canon_sha256":"48eb619bcb159c486a9b959b26ffb4654bb065a24b337119765c22e2e63c6f82"},"schema_version":"1.0","source":{"id":"1107.4623","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4623","created_at":"2026-05-18T03:32:05Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4623v5","created_at":"2026-05-18T03:32:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4623","created_at":"2026-05-18T03:32:05Z"},{"alias_kind":"pith_short_12","alias_value":"EF7VOGQVJLOA","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EF7VOGQVJLOA4DG4","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EF7VOGQV","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:5013aa941d4062101a5a8443f0a6d5a88f834f65510f834488ac2b1b4d15def3","target":"graph","created_at":"2026-05-18T03:32:05Z","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":"In this paper we study the performance of the Projected Gradient Descent(PGD) algorithm for $\\ell_{p}$-constrained least squares problems that arise in the framework of Compressed Sensing. Relying on the Restricted Isometry Property, we provide convergence guarantees for this algorithm for the entire range of $0\\leq p\\leq1$, that include and generalize the existing results for the Iterative Hard Thresholding algorithm and provide a new accuracy guarantee for the Iterative Soft Thresholding algorithm as special cases. Our results suggest that in this group of algorithms, as $p$ increases from z","authors_text":"Bhiksha Raj, Sohail Bahmani","cross_cats":["cs.IT","math.IT","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-07-22T20:42:47Z","title":"A Unifying Analysis of Projected Gradient Descent for $\\ell_p$-constrained Least Squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4623","kind":"arxiv","version":5},"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:1cea87e5e6ddafddc55955bab80d6652f07e2a56dcef928a5ec43bd9df060144","target":"record","created_at":"2026-05-18T03:32:05Z","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":"9418a60f16a5cdfb66b09a72cd1a0a63b30920c5a2dddb7f0504a48ddda08ac4","cross_cats_sorted":["cs.IT","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-07-22T20:42:47Z","title_canon_sha256":"48eb619bcb159c486a9b959b26ffb4654bb065a24b337119765c22e2e63c6f82"},"schema_version":"1.0","source":{"id":"1107.4623","kind":"arxiv","version":5}},"canonical_sha256":"217f571a154adc0e0cdcdff56a9dc6e64591f239f7cbb2dd243c970b90505168","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"217f571a154adc0e0cdcdff56a9dc6e64591f239f7cbb2dd243c970b90505168","first_computed_at":"2026-05-18T03:32:05.929528Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:05.929528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fnpCo/tIhoZSdZVsuTIZWq6nup6u4cKgZsuBERL0rO+Xjz9EmLimOKUUFdh9vxsJEZypSwl0szo2IDmTEZrxCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:05.929976Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.4623","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cea87e5e6ddafddc55955bab80d6652f07e2a56dcef928a5ec43bd9df060144","sha256:5013aa941d4062101a5a8443f0a6d5a88f834f65510f834488ac2b1b4d15def3"],"state_sha256":"0da4406933abf8fc71fda966c358e2d69eb867067d58b620abffadbaa4fd39bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IeK+XWpSP8PeLU+MSqDd2ShMuhjj8CWilEDBnR3qsHClyflBCigdvH7/JY4j7Mfwp/ebOPmh4CTWt8FkWGbtBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:29:48.533841Z","bundle_sha256":"622439100b45a10c0fc7d637a8fb7250cae9be004621e0fc34f21cf0d9940805"}}