{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:MUBIO2367Y7FOH2AYMJSBPZH32","short_pith_number":"pith:MUBIO236","canonical_record":{"source":{"id":"0905.0079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-01T11:15:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ef6df21f52a53c958460aadbf5580ee9067b3643333518f4c7f5f79a707324db","abstract_canon_sha256":"2aa4e4a92d0f63fbcc7f7eae8b0f57a790643a9ac114ddd081371f3ec325a7a8"},"schema_version":"1.0"},"canonical_sha256":"6502876b7efe3e571f40c31320bf27de8d045a656057f55614bd391af618d190","source":{"kind":"arxiv","id":"0905.0079","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.0079","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0905.0079v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.0079","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"MUBIO2367Y7F","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"MUBIO2367Y7FOH2A","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"MUBIO236","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:MUBIO2367Y7FOH2AYMJSBPZH32","target":"record","payload":{"canonical_record":{"source":{"id":"0905.0079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-01T11:15:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ef6df21f52a53c958460aadbf5580ee9067b3643333518f4c7f5f79a707324db","abstract_canon_sha256":"2aa4e4a92d0f63fbcc7f7eae8b0f57a790643a9ac114ddd081371f3ec325a7a8"},"schema_version":"1.0"},"canonical_sha256":"6502876b7efe3e571f40c31320bf27de8d045a656057f55614bd391af618d190","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.390744Z","signature_b64":"4scHbJaeJ/F8G5YUFLltf4kimRY3c2O9Ecc5xLz///x4uujE+5bM6H9TLLxG8PQXLdeMGQSp/hZEG73C251zBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6502876b7efe3e571f40c31320bf27de8d045a656057f55614bd391af618d190","last_reissued_at":"2026-05-18T00:59:11.390081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.390081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0905.0079","source_version":1,"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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xBqlVVgu/cOu24qclVPl6AgmD9h6mrdLNXnumz86Ua2cSCUO8sXvlEeRLpJk6gvPpBtZkEutTia6WsAC+hSwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:12:46.667750Z"},"content_sha256":"1292cdbce0d3520f3c58f80c815a95a22f924efa918061db7b333fc8607adc57","schema_version":"1.0","event_id":"sha256:1292cdbce0d3520f3c58f80c815a95a22f924efa918061db7b333fc8607adc57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:MUBIO2367Y7FOH2AYMJSBPZH32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple-Bases Belief-Propagation Decoding of High-Density Cyclic Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Johannes B. Huber, Olgica Milenkovic, Stefan Laendner, Thorsten Hehn","submitted_at":"2009-05-01T11:15:25Z","abstract_excerpt":"We introduce a new method for decoding short and moderate length linear block codes with dense parity-check matrix representations of cyclic form, termed multiple-bases belief-propagation (MBBP). The proposed iterative scheme makes use of the fact that a code has many structurally diverse parity-check matrices, capable of detecting different error patterns. We show that this inherent code property leads to decoding algorithms with significantly better performance when compared to standard BP decoding. Furthermore, we describe how to choose sets of parity-check matrices of cyclic form amenable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.0079","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"},"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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ruv2gzsmtfeaqVWM5tZ7NZPCat+Q703UcZeAVAeeGHK/J20WTiD5d+sW+lMXn5M4WrMedqOKSHfu+Mv7tOpEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:12:46.668097Z"},"content_sha256":"5cf1915e3a72222f3a325b8e742f8db22380cc99b7f6dc90ba755f7b8d1e5863","schema_version":"1.0","event_id":"sha256:5cf1915e3a72222f3a325b8e742f8db22380cc99b7f6dc90ba755f7b8d1e5863"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MUBIO2367Y7FOH2AYMJSBPZH32/bundle.json","state_url":"https://pith.science/pith/MUBIO2367Y7FOH2AYMJSBPZH32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MUBIO2367Y7FOH2AYMJSBPZH32/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-06-25T05:12:46Z","links":{"resolver":"https://pith.science/pith/MUBIO2367Y7FOH2AYMJSBPZH32","bundle":"https://pith.science/pith/MUBIO2367Y7FOH2AYMJSBPZH32/bundle.json","state":"https://pith.science/pith/MUBIO2367Y7FOH2AYMJSBPZH32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MUBIO2367Y7FOH2AYMJSBPZH32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:MUBIO2367Y7FOH2AYMJSBPZH32","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":"2aa4e4a92d0f63fbcc7f7eae8b0f57a790643a9ac114ddd081371f3ec325a7a8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-01T11:15:25Z","title_canon_sha256":"ef6df21f52a53c958460aadbf5580ee9067b3643333518f4c7f5f79a707324db"},"schema_version":"1.0","source":{"id":"0905.0079","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.0079","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0905.0079v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.0079","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"MUBIO2367Y7F","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"MUBIO2367Y7FOH2A","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"MUBIO236","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:5cf1915e3a72222f3a325b8e742f8db22380cc99b7f6dc90ba755f7b8d1e5863","target":"graph","created_at":"2026-05-18T00:59:11Z","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":"We introduce a new method for decoding short and moderate length linear block codes with dense parity-check matrix representations of cyclic form, termed multiple-bases belief-propagation (MBBP). The proposed iterative scheme makes use of the fact that a code has many structurally diverse parity-check matrices, capable of detecting different error patterns. We show that this inherent code property leads to decoding algorithms with significantly better performance when compared to standard BP decoding. Furthermore, we describe how to choose sets of parity-check matrices of cyclic form amenable ","authors_text":"Johannes B. Huber, Olgica Milenkovic, Stefan Laendner, Thorsten Hehn","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-01T11:15:25Z","title":"Multiple-Bases Belief-Propagation Decoding of High-Density Cyclic Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.0079","kind":"arxiv","version":1},"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:1292cdbce0d3520f3c58f80c815a95a22f924efa918061db7b333fc8607adc57","target":"record","created_at":"2026-05-18T00:59:11Z","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":"2aa4e4a92d0f63fbcc7f7eae8b0f57a790643a9ac114ddd081371f3ec325a7a8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-05-01T11:15:25Z","title_canon_sha256":"ef6df21f52a53c958460aadbf5580ee9067b3643333518f4c7f5f79a707324db"},"schema_version":"1.0","source":{"id":"0905.0079","kind":"arxiv","version":1}},"canonical_sha256":"6502876b7efe3e571f40c31320bf27de8d045a656057f55614bd391af618d190","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6502876b7efe3e571f40c31320bf27de8d045a656057f55614bd391af618d190","first_computed_at":"2026-05-18T00:59:11.390081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:11.390081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4scHbJaeJ/F8G5YUFLltf4kimRY3c2O9Ecc5xLz///x4uujE+5bM6H9TLLxG8PQXLdeMGQSp/hZEG73C251zBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:11.390744Z","signed_message":"canonical_sha256_bytes"},"source_id":"0905.0079","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1292cdbce0d3520f3c58f80c815a95a22f924efa918061db7b333fc8607adc57","sha256:5cf1915e3a72222f3a325b8e742f8db22380cc99b7f6dc90ba755f7b8d1e5863"],"state_sha256":"a89a27d6aee9379e800847f0145cb3e104c40487f2265d03cfc97e9f75fe190a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C2CTCyT/TgtaWjZ84EM3+ann9XQRuTbsPK3chOJTEQi1SZ6QTjfZGjMeKw8aR+VOxx94Q9b82PdtMONrrEMhDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T05:12:46.670055Z","bundle_sha256":"91dbf58002f1ca60ce220008007967777127309ff5293666cc702efb4e5fee41"}}