{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:GTRCZDLMLITFU4X5CSTAXIRTUT","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":"27ca9ee0d8f6a5758dcb1538e0365cc0088a48a11e06b3f0883545c53c8ed63e","cross_cats_sorted":["cs.IT","cs.MS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2009-09-03T22:26:32Z","title_canon_sha256":"91a367b36727be90a118c9d1df5772c40041b7c4c384e16fb8e32ef040b81ee2"},"schema_version":"1.0","source":{"id":"0909.0777","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.0777","created_at":"2026-05-18T02:12:00Z"},{"alias_kind":"arxiv_version","alias_value":"0909.0777v1","created_at":"2026-05-18T02:12:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.0777","created_at":"2026-05-18T02:12:00Z"},{"alias_kind":"pith_short_12","alias_value":"GTRCZDLMLITF","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"GTRCZDLMLITFU4X5","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"GTRCZDLM","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:47ecaea31b81fc4cddcb729786e4e84305b2a86c286b67cf28326b868f1efa8d","target":"graph","created_at":"2026-05-18T02:12:00Z","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":"We conducted an extensive computational experiment, lasting multiple CPU-years, to optimally select parameters for two important classes of algorithms for finding sparse solutions of underdetermined systems of linear equations. We make the optimally tuned implementations available at {\\tt sparselab.stanford.edu}; they run `out of the box' with no user tuning: it is not necessary to select thresholds or know the likely degree of sparsity. Our class of algorithms includes iterative hard and soft thresholding with or without relaxation, as well as CoSaMP, subspace pursuit and some natural extensi","authors_text":"Arian Maleki, David L. Donoho","cross_cats":["cs.IT","cs.MS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2009-09-03T22:26:32Z","title":"Optimally Tuned Iterative Reconstruction Algorithms for Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.0777","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:ad42fd6098ccbe6ff00434fb1fc8f16e881862c6b45e5e7223e4bd4d47f9d20a","target":"record","created_at":"2026-05-18T02:12:00Z","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":"27ca9ee0d8f6a5758dcb1538e0365cc0088a48a11e06b3f0883545c53c8ed63e","cross_cats_sorted":["cs.IT","cs.MS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2009-09-03T22:26:32Z","title_canon_sha256":"91a367b36727be90a118c9d1df5772c40041b7c4c384e16fb8e32ef040b81ee2"},"schema_version":"1.0","source":{"id":"0909.0777","kind":"arxiv","version":1}},"canonical_sha256":"34e22c8d6c5a265a72fd14a60ba233a4e271ca7be981244192c0a4394747362c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34e22c8d6c5a265a72fd14a60ba233a4e271ca7be981244192c0a4394747362c","first_computed_at":"2026-05-18T02:12:00.057997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:12:00.057997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QUjw8mK5kYiftl6z7QldGSXLEyZpPseKiuz8GpOuXl7S39WaAHZVmu8/9PvKJKKzX1DGU2Qv43Lygghg6GTWDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:12:00.059004Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.0777","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad42fd6098ccbe6ff00434fb1fc8f16e881862c6b45e5e7223e4bd4d47f9d20a","sha256:47ecaea31b81fc4cddcb729786e4e84305b2a86c286b67cf28326b868f1efa8d"],"state_sha256":"4a31b27b3d3818d7e8c8eeca77b0ddf97fdeb6376d669775c5b26c43a6f10ffc"}