{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NO5H5CIASKNRIAC5KYSGNLG3OC","short_pith_number":"pith:NO5H5CIA","schema_version":"1.0","canonical_sha256":"6bba7e8900929b14005d562466acdb70a8f5e18da916723e8ec7c1154a997ada","source":{"kind":"arxiv","id":"1804.00602","version":2},"attestation_state":"computed","paper":{"title":"A Compressed Sensing Approach for Distribution Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Laurent Schmalen, Mohamad Dia, Vahid Aref","submitted_at":"2018-04-02T15:57:01Z","abstract_excerpt":"In this work, we formulate the fixed-length distribution matching as a Bayesian inference problem. Our proposed solution is inspired from the compressed sensing paradigm and the sparse superposition (SS) codes. First, we introduce sparsity in the binary source via position modulation (PM). We then present a simple and exact matcher based on Gaussian signal quantization. At the receiver, the dematcher exploits the sparsity in the source and performs low-complexity dematching based on generalized approximate message-passing (GAMP). We show that GAMP dematcher and spatial coupling lead to asympto"},"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":"1804.00602","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-02T15:57:01Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"817b73f61f5eaf5473c609010d7f5e977045ba6b8ca36031cc25365c8abfb6e6","abstract_canon_sha256":"ae9967f6be3b8514e58355c0d4330fd90315b3268158d4bbcd729812196f2b24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:02.193350Z","signature_b64":"ik2+YG13QnDXUogOLRq5PV6mkJ+uhfaBrIQedvNjPDZ9pqgLwA0b9sc0IVqNb03LMOmjHwzoX1rVj2yTC6d3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bba7e8900929b14005d562466acdb70a8f5e18da916723e8ec7c1154a997ada","last_reissued_at":"2026-05-18T00:00:02.192851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:02.192851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Compressed Sensing Approach for Distribution Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Laurent Schmalen, Mohamad Dia, Vahid Aref","submitted_at":"2018-04-02T15:57:01Z","abstract_excerpt":"In this work, we formulate the fixed-length distribution matching as a Bayesian inference problem. Our proposed solution is inspired from the compressed sensing paradigm and the sparse superposition (SS) codes. First, we introduce sparsity in the binary source via position modulation (PM). We then present a simple and exact matcher based on Gaussian signal quantization. At the receiver, the dematcher exploits the sparsity in the source and performs low-complexity dematching based on generalized approximate message-passing (GAMP). We show that GAMP dematcher and spatial coupling lead to asympto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00602","kind":"arxiv","version":2},"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":"1804.00602","created_at":"2026-05-18T00:00:02.192930+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00602v2","created_at":"2026-05-18T00:00:02.192930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00602","created_at":"2026-05-18T00:00:02.192930+00:00"},{"alias_kind":"pith_short_12","alias_value":"NO5H5CIASKNR","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NO5H5CIASKNRIAC5","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NO5H5CIA","created_at":"2026-05-18T12:32:40.477152+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/NO5H5CIASKNRIAC5KYSGNLG3OC","json":"https://pith.science/pith/NO5H5CIASKNRIAC5KYSGNLG3OC.json","graph_json":"https://pith.science/api/pith-number/NO5H5CIASKNRIAC5KYSGNLG3OC/graph.json","events_json":"https://pith.science/api/pith-number/NO5H5CIASKNRIAC5KYSGNLG3OC/events.json","paper":"https://pith.science/paper/NO5H5CIA"},"agent_actions":{"view_html":"https://pith.science/pith/NO5H5CIASKNRIAC5KYSGNLG3OC","download_json":"https://pith.science/pith/NO5H5CIASKNRIAC5KYSGNLG3OC.json","view_paper":"https://pith.science/paper/NO5H5CIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00602&json=true","fetch_graph":"https://pith.science/api/pith-number/NO5H5CIASKNRIAC5KYSGNLG3OC/graph.json","fetch_events":"https://pith.science/api/pith-number/NO5H5CIASKNRIAC5KYSGNLG3OC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NO5H5CIASKNRIAC5KYSGNLG3OC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NO5H5CIASKNRIAC5KYSGNLG3OC/action/storage_attestation","attest_author":"https://pith.science/pith/NO5H5CIASKNRIAC5KYSGNLG3OC/action/author_attestation","sign_citation":"https://pith.science/pith/NO5H5CIASKNRIAC5KYSGNLG3OC/action/citation_signature","submit_replication":"https://pith.science/pith/NO5H5CIASKNRIAC5KYSGNLG3OC/action/replication_record"}},"created_at":"2026-05-18T00:00:02.192930+00:00","updated_at":"2026-05-18T00:00:02.192930+00:00"}