{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DAXH3JTQKYKOFMLUZUS2Q22Z7D","short_pith_number":"pith:DAXH3JTQ","schema_version":"1.0","canonical_sha256":"182e7da6705614e2b174cd25a86b59f8ea0c88010c9cb912136d091dc73dd728","source":{"kind":"arxiv","id":"1408.3930","version":3},"attestation_state":"computed","paper":{"title":"Bernoulli-Gaussian Approximate Message-Passing Algorithm for Compressed Sensing with 1D-Finite-Difference Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Heung-No Lee, Hyoyoung Jung, Jaewook Kang, Kiseon Kim","submitted_at":"2014-08-18T08:38:46Z","abstract_excerpt":"This paper proposes a fast approximate message-passing (AMP) algorithm for solving compressed sensing (CS) recovery problems with 1D-finite-difference sparsity in term of MMSE estimation. The proposed algorithm, named ssAMP-BGFD, is low-computational with its fast convergence and cheap per-iteration cost, providing phase transition nearly approaching to the state-of-the-art. The proposed algorithm is originated from a sum-product message-passing rule, applying a Bernoulli-Gaussian (BG) prior, seeking an MMSE solution. The algorithm construction includes not only the conventional AMP technique "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1408.3930","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-18T08:38:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a65fd69ad369567665a4728e81971eec7312dad0d8448fcd0b6b4287d643f210","abstract_canon_sha256":"eca58959befa726bdd4cfba403f2a8b24f0992cc17d4a6306793795f3eb9d3cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:58.693587Z","signature_b64":"5310BWNYcvF3XNwOu1H/Y5+lUDjiVB7K/53DD2iigEV0fMWBDTVo3UE67QUI8lr0VAVE7rAPaDZQz93qlAfpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"182e7da6705614e2b174cd25a86b59f8ea0c88010c9cb912136d091dc73dd728","last_reissued_at":"2026-05-18T01:33:58.693152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:58.693152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bernoulli-Gaussian Approximate Message-Passing Algorithm for Compressed Sensing with 1D-Finite-Difference Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Heung-No Lee, Hyoyoung Jung, Jaewook Kang, Kiseon Kim","submitted_at":"2014-08-18T08:38:46Z","abstract_excerpt":"This paper proposes a fast approximate message-passing (AMP) algorithm for solving compressed sensing (CS) recovery problems with 1D-finite-difference sparsity in term of MMSE estimation. The proposed algorithm, named ssAMP-BGFD, is low-computational with its fast convergence and cheap per-iteration cost, providing phase transition nearly approaching to the state-of-the-art. The proposed algorithm is originated from a sum-product message-passing rule, applying a Bernoulli-Gaussian (BG) prior, seeking an MMSE solution. The algorithm construction includes not only the conventional AMP technique "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3930","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1408.3930","created_at":"2026-05-18T01:33:58.693221+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.3930v3","created_at":"2026-05-18T01:33:58.693221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3930","created_at":"2026-05-18T01:33:58.693221+00:00"},{"alias_kind":"pith_short_12","alias_value":"DAXH3JTQKYKO","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DAXH3JTQKYKOFMLU","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DAXH3JTQ","created_at":"2026-05-18T12:28:25.294606+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DAXH3JTQKYKOFMLUZUS2Q22Z7D","json":"https://pith.science/pith/DAXH3JTQKYKOFMLUZUS2Q22Z7D.json","graph_json":"https://pith.science/api/pith-number/DAXH3JTQKYKOFMLUZUS2Q22Z7D/graph.json","events_json":"https://pith.science/api/pith-number/DAXH3JTQKYKOFMLUZUS2Q22Z7D/events.json","paper":"https://pith.science/paper/DAXH3JTQ"},"agent_actions":{"view_html":"https://pith.science/pith/DAXH3JTQKYKOFMLUZUS2Q22Z7D","download_json":"https://pith.science/pith/DAXH3JTQKYKOFMLUZUS2Q22Z7D.json","view_paper":"https://pith.science/paper/DAXH3JTQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.3930&json=true","fetch_graph":"https://pith.science/api/pith-number/DAXH3JTQKYKOFMLUZUS2Q22Z7D/graph.json","fetch_events":"https://pith.science/api/pith-number/DAXH3JTQKYKOFMLUZUS2Q22Z7D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DAXH3JTQKYKOFMLUZUS2Q22Z7D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DAXH3JTQKYKOFMLUZUS2Q22Z7D/action/storage_attestation","attest_author":"https://pith.science/pith/DAXH3JTQKYKOFMLUZUS2Q22Z7D/action/author_attestation","sign_citation":"https://pith.science/pith/DAXH3JTQKYKOFMLUZUS2Q22Z7D/action/citation_signature","submit_replication":"https://pith.science/pith/DAXH3JTQKYKOFMLUZUS2Q22Z7D/action/replication_record"}},"created_at":"2026-05-18T01:33:58.693221+00:00","updated_at":"2026-05-18T01:33:58.693221+00:00"}