{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HQG6RWF5ARHSJ3YVVAQU6CQ5MZ","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":"22888dc40f83bc65d8a59e9ac1a4f498c7004a0b8475c3c734509b118d9d29ea","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-31T21:03:00Z","title_canon_sha256":"19cd2638a95d14f8484d8fdb2bbe04b823df430bebbcb7618b6abb589faae064"},"schema_version":"1.0","source":{"id":"1311.0035","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0035","created_at":"2026-05-18T03:08:16Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0035v1","created_at":"2026-05-18T03:08:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0035","created_at":"2026-05-18T03:08:16Z"},{"alias_kind":"pith_short_12","alias_value":"HQG6RWF5ARHS","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HQG6RWF5ARHSJ3YV","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HQG6RWF5","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:bdd974d86bb6367782d7cadb40a3d56586ef10e3da93e4ccc2294162cf0df05f","target":"graph","created_at":"2026-05-18T03:08:16Z","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":"Iterative thresholding algorithms are well-suited for high-dimensional problems in sparse recovery and compressive sensing. The performance of this class of algorithms depends heavily on the tuning of certain threshold parameters. In particular, both the final reconstruction error and the convergence rate of the algorithm crucially rely on how the threshold parameter is set at each step of the algorithm. In this paper, we propose a parameter-free approximate message passing (AMP) algorithm that sets the threshold parameter at each iteration in a fully automatic way without either having an inf","authors_text":"Ali Mousavi, Arian Maleki, Richard G. Baraniuk","cross_cats":["math.IT","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-31T21:03:00Z","title":"Parameterless Optimal Approximate Message Passing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0035","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:1a55cb58ebd39eb2ccdb12d169cdfbf246581baefe002d5fd1217b9bab61c37f","target":"record","created_at":"2026-05-18T03:08:16Z","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":"22888dc40f83bc65d8a59e9ac1a4f498c7004a0b8475c3c734509b118d9d29ea","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-31T21:03:00Z","title_canon_sha256":"19cd2638a95d14f8484d8fdb2bbe04b823df430bebbcb7618b6abb589faae064"},"schema_version":"1.0","source":{"id":"1311.0035","kind":"arxiv","version":1}},"canonical_sha256":"3c0de8d8bd044f24ef15a8214f0a1d6649abc5dd2d294324a3d7a62afdcfe94f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c0de8d8bd044f24ef15a8214f0a1d6649abc5dd2d294324a3d7a62afdcfe94f","first_computed_at":"2026-05-18T03:08:16.212525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:16.212525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qi/7hG7lIB2biw9rFpoeXUEqpveX3IUDoWq1QKysN7IgrG8BYDEXmG9i38XrZRw/w80OQG/1XgUjXmXT7YrpCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:16.213181Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.0035","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a55cb58ebd39eb2ccdb12d169cdfbf246581baefe002d5fd1217b9bab61c37f","sha256:bdd974d86bb6367782d7cadb40a3d56586ef10e3da93e4ccc2294162cf0df05f"],"state_sha256":"ae5c302a26b05afa08d74a62ca7f2da896c99977d04dae2d28e32804fc3c3b6f"}