{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:RC5B3TZU3QAILNU5PNZDRTGXTY","short_pith_number":"pith:RC5B3TZU","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"},"canonical_sha256":"88ba1dcf34dc0085b69d7b7238ccd79e1d428db48229ffdda285f7db84152007","source":{"kind":"arxiv","id":"0901.4467","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.4467","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0901.4467v2","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.4467","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"RC5B3TZU3QAI","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"RC5B3TZU3QAILNU5","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"RC5B3TZU","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:RC5B3TZU3QAILNU5PNZDRTGXTY","target":"record","payload":{"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"},"canonical_sha256":"88ba1dcf34dc0085b69d7b7238ccd79e1d428db48229ffdda285f7db84152007","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"},"source_kind":"arxiv","source_id":"0901.4467","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EGRBkkGaxY96ZKxIIQrQY9fogVJxEKhfo07YySsoTDG9EOiDs+ThGVI1IOVjRWx7BjXi332JoxXZPP+ctRBSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:25:18.564984Z"},"content_sha256":"530f64e45db73cca614d292753222edcf957bac28889808ff475d39970894722","schema_version":"1.0","event_id":"sha256:530f64e45db73cca614d292753222edcf957bac28889808ff475d39970894722"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:RC5B3TZU3QAILNU5PNZDRTGXTY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w8Fcn+nTRiDBOnHX2/vnUP+aGZkfDSX94OpskR5g39knOOkX0IBNS47kdYh4remwPQeO9h6YSmkEH/Yk6cQHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:25:18.565344Z"},"content_sha256":"d0115f6efc8ceeab4d0ccd874c0803b2810f35e4eb2a05c934d356c11e99d5e1","schema_version":"1.0","event_id":"sha256:d0115f6efc8ceeab4d0ccd874c0803b2810f35e4eb2a05c934d356c11e99d5e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RC5B3TZU3QAILNU5PNZDRTGXTY/bundle.json","state_url":"https://pith.science/pith/RC5B3TZU3QAILNU5PNZDRTGXTY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RC5B3TZU3QAILNU5PNZDRTGXTY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-21T13:25:18Z","links":{"resolver":"https://pith.science/pith/RC5B3TZU3QAILNU5PNZDRTGXTY","bundle":"https://pith.science/pith/RC5B3TZU3QAILNU5PNZDRTGXTY/bundle.json","state":"https://pith.science/pith/RC5B3TZU3QAILNU5PNZDRTGXTY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RC5B3TZU3QAILNU5PNZDRTGXTY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:RC5B3TZU3QAILNU5PNZDRTGXTY","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":"cc976f23a4dfcefff50cd8ec1675e4d2b4abc8082220ba1b0652c3f9d15469e5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-28T14:13:24Z","title_canon_sha256":"bebe62d54f2418647b6bf966c19c3d0787ab1d8a0073384f5b09d9d8a45c1f13"},"schema_version":"1.0","source":{"id":"0901.4467","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.4467","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0901.4467v2","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.4467","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"RC5B3TZU3QAI","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"RC5B3TZU3QAILNU5","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"RC5B3TZU","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:d0115f6efc8ceeab4d0ccd874c0803b2810f35e4eb2a05c934d356c11e99d5e1","target":"graph","created_at":"2026-05-18T00:57:58Z","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":"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","authors_text":"Alfredo Braunstein, Farbod Kayhan, Riccardo Zecchina","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-28T14:13:24Z","title":"Efficient LDPC Codes over GF(q) for Lossy Data Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.4467","kind":"arxiv","version":2},"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:530f64e45db73cca614d292753222edcf957bac28889808ff475d39970894722","target":"record","created_at":"2026-05-18T00:57:58Z","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":"cc976f23a4dfcefff50cd8ec1675e4d2b4abc8082220ba1b0652c3f9d15469e5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-28T14:13:24Z","title_canon_sha256":"bebe62d54f2418647b6bf966c19c3d0787ab1d8a0073384f5b09d9d8a45c1f13"},"schema_version":"1.0","source":{"id":"0901.4467","kind":"arxiv","version":2}},"canonical_sha256":"88ba1dcf34dc0085b69d7b7238ccd79e1d428db48229ffdda285f7db84152007","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88ba1dcf34dc0085b69d7b7238ccd79e1d428db48229ffdda285f7db84152007","first_computed_at":"2026-05-18T00:57:58.303843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:58.303843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Bo6qoxAEgc0vskY00Tnv+t+7G2THFTnlxenknrpVqN/7emMfovHgLNXEXSYr0PhvxkyJ4C5yVQhQO16qj0IAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:58.304413Z","signed_message":"canonical_sha256_bytes"},"source_id":"0901.4467","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:530f64e45db73cca614d292753222edcf957bac28889808ff475d39970894722","sha256:d0115f6efc8ceeab4d0ccd874c0803b2810f35e4eb2a05c934d356c11e99d5e1"],"state_sha256":"4d6b32dcdf238762bbe34fa75466448f98cb36734e2b5f8584461af9b6cfebdf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hLidpkIQTVIQsm0BZShUjl95TwZ3TBK2N6OdG650hCfNh0myPdXvhlgIRGrcbUcUJaWlIF4HFLkglNPZU63FBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T13:25:18.568703Z","bundle_sha256":"124298085b76ba70638ad4836750d6793850133c25276899e07e13e05d3f5aff"}}