{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:RC5B3TZU3QAILNU5PNZDRTGXTY","short_pith_number":"pith:RC5B3TZU","schema_version":"1.0","canonical_sha256":"88ba1dcf34dc0085b69d7b7238ccd79e1d428db48229ffdda285f7db84152007","source":{"kind":"arxiv","id":"0901.4467","version":2},"attestation_state":"computed","paper":{"title":"Efficient LDPC Codes over GF(q) for Lossy Data Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alfredo Braunstein, Farbod Kayhan, Riccardo Zecchina","submitted_at":"2009-01-28T14:13:24Z","abstract_excerpt":"In this paper we consider the lossy compression of a binary symmetric source. We present a scheme that provides a low complexity lossy compressor with near optimal empirical performance. The proposed scheme is based on b-reduced ultra-sparse LDPC codes over GF(q). Encoding is performed by the Reinforced Belief Propagation algorithm, a variant of Belief Propagation. The computational complexity at the encoder is O(<d>.n.q.log q), where <d> is the average degree of the check nodes. For our code ensemble, decoding can be performed iteratively following the inverse steps of the leaf removal algori"},"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":"0901.4467","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-28T14:13:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bebe62d54f2418647b6bf966c19c3d0787ab1d8a0073384f5b09d9d8a45c1f13","abstract_canon_sha256":"cc976f23a4dfcefff50cd8ec1675e4d2b4abc8082220ba1b0652c3f9d15469e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.304413Z","signature_b64":"4Bo6qoxAEgc0vskY00Tnv+t+7G2THFTnlxenknrpVqN/7emMfovHgLNXEXSYr0PhvxkyJ4C5yVQhQO16qj0IAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88ba1dcf34dc0085b69d7b7238ccd79e1d428db48229ffdda285f7db84152007","last_reissued_at":"2026-05-18T00:57:58.303843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.303843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient LDPC Codes over GF(q) for Lossy Data Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alfredo Braunstein, Farbod Kayhan, Riccardo Zecchina","submitted_at":"2009-01-28T14:13:24Z","abstract_excerpt":"In this paper we consider the lossy compression of a binary symmetric source. We present a scheme that provides a low complexity lossy compressor with near optimal empirical performance. The proposed scheme is based on b-reduced ultra-sparse LDPC codes over GF(q). Encoding is performed by the Reinforced Belief Propagation algorithm, a variant of Belief Propagation. The computational complexity at the encoder is O(<d>.n.q.log q), where <d> is the average degree of the check nodes. For our code ensemble, decoding can be performed iteratively following the inverse steps of the leaf removal algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.4467","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":"0901.4467","created_at":"2026-05-18T00:57:58.303945+00:00"},{"alias_kind":"arxiv_version","alias_value":"0901.4467v2","created_at":"2026-05-18T00:57:58.303945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.4467","created_at":"2026-05-18T00:57:58.303945+00:00"},{"alias_kind":"pith_short_12","alias_value":"RC5B3TZU3QAI","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"RC5B3TZU3QAILNU5","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"RC5B3TZU","created_at":"2026-05-18T12:26:01.383474+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/RC5B3TZU3QAILNU5PNZDRTGXTY","json":"https://pith.science/pith/RC5B3TZU3QAILNU5PNZDRTGXTY.json","graph_json":"https://pith.science/api/pith-number/RC5B3TZU3QAILNU5PNZDRTGXTY/graph.json","events_json":"https://pith.science/api/pith-number/RC5B3TZU3QAILNU5PNZDRTGXTY/events.json","paper":"https://pith.science/paper/RC5B3TZU"},"agent_actions":{"view_html":"https://pith.science/pith/RC5B3TZU3QAILNU5PNZDRTGXTY","download_json":"https://pith.science/pith/RC5B3TZU3QAILNU5PNZDRTGXTY.json","view_paper":"https://pith.science/paper/RC5B3TZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0901.4467&json=true","fetch_graph":"https://pith.science/api/pith-number/RC5B3TZU3QAILNU5PNZDRTGXTY/graph.json","fetch_events":"https://pith.science/api/pith-number/RC5B3TZU3QAILNU5PNZDRTGXTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RC5B3TZU3QAILNU5PNZDRTGXTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RC5B3TZU3QAILNU5PNZDRTGXTY/action/storage_attestation","attest_author":"https://pith.science/pith/RC5B3TZU3QAILNU5PNZDRTGXTY/action/author_attestation","sign_citation":"https://pith.science/pith/RC5B3TZU3QAILNU5PNZDRTGXTY/action/citation_signature","submit_replication":"https://pith.science/pith/RC5B3TZU3QAILNU5PNZDRTGXTY/action/replication_record"}},"created_at":"2026-05-18T00:57:58.303945+00:00","updated_at":"2026-05-18T00:57:58.303945+00:00"}