{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:3FO27XZTMKEHTSMMIWPSQBWHOP","short_pith_number":"pith:3FO27XZT","canonical_record":{"source":{"id":"0911.0492","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-11-03T04:44:00Z","cross_cats_sorted":["cs.SY","math.NA"],"title_canon_sha256":"465dcb57d713300613e5e759d187fa251e70e34ae0391033de2e99275fde95bf","abstract_canon_sha256":"5948590c475199156e39d8587166c8f21b2c687a6f2a9dffac69f29e0c58ff2d"},"schema_version":"1.0"},"canonical_sha256":"d95dafdf33628879c98c459f2806c773d093f3c2a9717fd4fb188dff0238eb3c","source":{"kind":"arxiv","id":"0911.0492","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.0492","created_at":"2026-05-18T03:58:51Z"},{"alias_kind":"arxiv_version","alias_value":"0911.0492v4","created_at":"2026-05-18T03:58:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.0492","created_at":"2026-05-18T03:58:51Z"},{"alias_kind":"pith_short_12","alias_value":"3FO27XZTMKEH","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"3FO27XZTMKEHTSMM","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"3FO27XZT","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:3FO27XZTMKEHTSMMIWPSQBWHOP","target":"record","payload":{"canonical_record":{"source":{"id":"0911.0492","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-11-03T04:44:00Z","cross_cats_sorted":["cs.SY","math.NA"],"title_canon_sha256":"465dcb57d713300613e5e759d187fa251e70e34ae0391033de2e99275fde95bf","abstract_canon_sha256":"5948590c475199156e39d8587166c8f21b2c687a6f2a9dffac69f29e0c58ff2d"},"schema_version":"1.0"},"canonical_sha256":"d95dafdf33628879c98c459f2806c773d093f3c2a9717fd4fb188dff0238eb3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:51.888021Z","signature_b64":"OE0t/GWZLPwEJNstP+9YZNPxyDQH9k2yDl2+bCbdntZE8ZPTLMF/enRNfoKUDMpO8gIMyD2wEsvpDPHIHkVPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d95dafdf33628879c98c459f2806c773d093f3c2a9717fd4fb188dff0238eb3c","last_reissued_at":"2026-05-18T03:58:51.887571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:51.887571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0911.0492","source_version":4,"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:58:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+hdDDUlDk6HXSJvSH+JbQe6C/ap1p+vH8fEtlaePmtuEOE0RaeFDeEDXuQ3XY7G9PpDjhISbVWIWmHmCZ4jBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:26:43.431930Z"},"content_sha256":"7110a86f4820784320da4e1dbc1bc8239c7a4237d494056475ba79a1637a2985","schema_version":"1.0","event_id":"sha256:7110a86f4820784320da4e1dbc1bc8239c7a4237d494056475ba79a1637a2985"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:3FO27XZTMKEHTSMMIWPSQBWHOP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PARNES: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.NA"],"primary_cat":"math.OC","authors_text":"Cinna Julie Wu, Lek-Heng Lim, Ming Gu","submitted_at":"2009-11-03T04:44:00Z","abstract_excerpt":"In this article, we propose an algorithm, NESTA-LASSO, for the LASSO problem, i.e., an underdetermined linear least-squares problem with a 1-norm constraint on the solution. We prove under the assumption of the restricted isometry property (RIP) and a sparsity condition on the solution, that NESTA-LASSO is guaranteed to be almost always locally linearly convergent. As in the case of the algorithm NESTA proposed by Becker, Bobin, and Candes, we rely on Nesterov's accelerated proximal gradient method, which takes O(e^{-1/2}) iterations to come within e > 0 of the optimal value. We introduce a mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.0492","kind":"arxiv","version":4},"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:58:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YRaXkOQNonbVEvbSXPM3hOCWboTDsi41aDBHaRJYUtOeCGOfdNluP/T4DXC07f4QAWbEsuoKnQYYU0slT7PjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:26:43.432550Z"},"content_sha256":"66dba227dafdf309cfe3441e053651c0eaea6166ccffcbde992027a0479d4858","schema_version":"1.0","event_id":"sha256:66dba227dafdf309cfe3441e053651c0eaea6166ccffcbde992027a0479d4858"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FO27XZTMKEHTSMMIWPSQBWHOP/bundle.json","state_url":"https://pith.science/pith/3FO27XZTMKEHTSMMIWPSQBWHOP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FO27XZTMKEHTSMMIWPSQBWHOP/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-25T23:26:43Z","links":{"resolver":"https://pith.science/pith/3FO27XZTMKEHTSMMIWPSQBWHOP","bundle":"https://pith.science/pith/3FO27XZTMKEHTSMMIWPSQBWHOP/bundle.json","state":"https://pith.science/pith/3FO27XZTMKEHTSMMIWPSQBWHOP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FO27XZTMKEHTSMMIWPSQBWHOP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:3FO27XZTMKEHTSMMIWPSQBWHOP","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":"5948590c475199156e39d8587166c8f21b2c687a6f2a9dffac69f29e0c58ff2d","cross_cats_sorted":["cs.SY","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-11-03T04:44:00Z","title_canon_sha256":"465dcb57d713300613e5e759d187fa251e70e34ae0391033de2e99275fde95bf"},"schema_version":"1.0","source":{"id":"0911.0492","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.0492","created_at":"2026-05-18T03:58:51Z"},{"alias_kind":"arxiv_version","alias_value":"0911.0492v4","created_at":"2026-05-18T03:58:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.0492","created_at":"2026-05-18T03:58:51Z"},{"alias_kind":"pith_short_12","alias_value":"3FO27XZTMKEH","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"3FO27XZTMKEHTSMM","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"3FO27XZT","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:66dba227dafdf309cfe3441e053651c0eaea6166ccffcbde992027a0479d4858","target":"graph","created_at":"2026-05-18T03:58:51Z","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 article, we propose an algorithm, NESTA-LASSO, for the LASSO problem, i.e., an underdetermined linear least-squares problem with a 1-norm constraint on the solution. We prove under the assumption of the restricted isometry property (RIP) and a sparsity condition on the solution, that NESTA-LASSO is guaranteed to be almost always locally linearly convergent. As in the case of the algorithm NESTA proposed by Becker, Bobin, and Candes, we rely on Nesterov's accelerated proximal gradient method, which takes O(e^{-1/2}) iterations to come within e > 0 of the optimal value. We introduce a mo","authors_text":"Cinna Julie Wu, Lek-Heng Lim, Ming Gu","cross_cats":["cs.SY","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-11-03T04:44:00Z","title":"PARNES: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.0492","kind":"arxiv","version":4},"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:7110a86f4820784320da4e1dbc1bc8239c7a4237d494056475ba79a1637a2985","target":"record","created_at":"2026-05-18T03:58:51Z","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":"5948590c475199156e39d8587166c8f21b2c687a6f2a9dffac69f29e0c58ff2d","cross_cats_sorted":["cs.SY","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-11-03T04:44:00Z","title_canon_sha256":"465dcb57d713300613e5e759d187fa251e70e34ae0391033de2e99275fde95bf"},"schema_version":"1.0","source":{"id":"0911.0492","kind":"arxiv","version":4}},"canonical_sha256":"d95dafdf33628879c98c459f2806c773d093f3c2a9717fd4fb188dff0238eb3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d95dafdf33628879c98c459f2806c773d093f3c2a9717fd4fb188dff0238eb3c","first_computed_at":"2026-05-18T03:58:51.887571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:51.887571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OE0t/GWZLPwEJNstP+9YZNPxyDQH9k2yDl2+bCbdntZE8ZPTLMF/enRNfoKUDMpO8gIMyD2wEsvpDPHIHkVPDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:51.888021Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.0492","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7110a86f4820784320da4e1dbc1bc8239c7a4237d494056475ba79a1637a2985","sha256:66dba227dafdf309cfe3441e053651c0eaea6166ccffcbde992027a0479d4858"],"state_sha256":"796ff7611aca912aeca88b071af61b7c903d7b656dc85623891f2ea92dcfcd97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ldiAU+CCAJ+BwV+Vljrna63TFbE4fyse3yVHsB0mI5RVZEilFElcenhABgEjdzKOsOpROYw9qqC3TIWbdo8DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:26:43.435949Z","bundle_sha256":"5e69c3925800348972afb4e10ec9bbfd5f617580e40b570358e8e25d4a11f400"}}