{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PP3UM5S6EMBE226YGH7RTKQWVT","short_pith_number":"pith:PP3UM5S6","schema_version":"1.0","canonical_sha256":"7bf746765e23024d6bd831ff19aa16acdfd8672d62541d779203ac7ef7197da7","source":{"kind":"arxiv","id":"1201.4949","version":1},"attestation_state":"computed","paper":{"title":"Approximate Message Passing under Finite Alphabet Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andreas Muller, Dino Sejdinovic, Robert Piechocki","submitted_at":"2012-01-24T11:16:15Z","abstract_excerpt":"In this paper we consider Basis Pursuit De-Noising (BPDN) problems in which the sparse original signal is drawn from a finite alphabet. To solve this problem we propose an iterative message passing algorithm, which capitalises not only on the sparsity but by means of a prior distribution also on the discrete nature of the original signal. In our numerical experiments we test this algorithm in combination with a Rademacher measurement matrix and a measurement matrix derived from the random demodulator, which enables compressive sampling of analogue signals. Our results show in both cases signif"},"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":"1201.4949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-01-24T11:16:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"cca05707b91aced6f83b7b3dd4db7fd804b6c2a86a0b921932ea251ecc10f5ff","abstract_canon_sha256":"d5e4f329296f1681594b244cebba3428af3698bb788d4a0a9ebdd32de183158b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:43.177277Z","signature_b64":"broNY5zAIYBFf0/OsP7YfJdeQiVrD+VH4DOHZwrCxYTNxFCY6QwVEojHC+9x7H5rnDKniR3blOYIGCwtkozYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bf746765e23024d6bd831ff19aa16acdfd8672d62541d779203ac7ef7197da7","last_reissued_at":"2026-05-18T00:58:43.176806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:43.176806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Message Passing under Finite Alphabet Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andreas Muller, Dino Sejdinovic, Robert Piechocki","submitted_at":"2012-01-24T11:16:15Z","abstract_excerpt":"In this paper we consider Basis Pursuit De-Noising (BPDN) problems in which the sparse original signal is drawn from a finite alphabet. To solve this problem we propose an iterative message passing algorithm, which capitalises not only on the sparsity but by means of a prior distribution also on the discrete nature of the original signal. In our numerical experiments we test this algorithm in combination with a Rademacher measurement matrix and a measurement matrix derived from the random demodulator, which enables compressive sampling of analogue signals. Our results show in both cases signif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.4949","kind":"arxiv","version":1},"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":"1201.4949","created_at":"2026-05-18T00:58:43.176883+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.4949v1","created_at":"2026-05-18T00:58:43.176883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.4949","created_at":"2026-05-18T00:58:43.176883+00:00"},{"alias_kind":"pith_short_12","alias_value":"PP3UM5S6EMBE","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PP3UM5S6EMBE226Y","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PP3UM5S6","created_at":"2026-05-18T12:27:18.751474+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/PP3UM5S6EMBE226YGH7RTKQWVT","json":"https://pith.science/pith/PP3UM5S6EMBE226YGH7RTKQWVT.json","graph_json":"https://pith.science/api/pith-number/PP3UM5S6EMBE226YGH7RTKQWVT/graph.json","events_json":"https://pith.science/api/pith-number/PP3UM5S6EMBE226YGH7RTKQWVT/events.json","paper":"https://pith.science/paper/PP3UM5S6"},"agent_actions":{"view_html":"https://pith.science/pith/PP3UM5S6EMBE226YGH7RTKQWVT","download_json":"https://pith.science/pith/PP3UM5S6EMBE226YGH7RTKQWVT.json","view_paper":"https://pith.science/paper/PP3UM5S6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.4949&json=true","fetch_graph":"https://pith.science/api/pith-number/PP3UM5S6EMBE226YGH7RTKQWVT/graph.json","fetch_events":"https://pith.science/api/pith-number/PP3UM5S6EMBE226YGH7RTKQWVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PP3UM5S6EMBE226YGH7RTKQWVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PP3UM5S6EMBE226YGH7RTKQWVT/action/storage_attestation","attest_author":"https://pith.science/pith/PP3UM5S6EMBE226YGH7RTKQWVT/action/author_attestation","sign_citation":"https://pith.science/pith/PP3UM5S6EMBE226YGH7RTKQWVT/action/citation_signature","submit_replication":"https://pith.science/pith/PP3UM5S6EMBE226YGH7RTKQWVT/action/replication_record"}},"created_at":"2026-05-18T00:58:43.176883+00:00","updated_at":"2026-05-18T00:58:43.176883+00:00"}