{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UM7R2IBPTK6O4Z53IWHSBL6RQT","short_pith_number":"pith:UM7R2IBP","canonical_record":{"source":{"id":"1305.6216","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-27T13:38:22Z","cross_cats_sorted":["cs.MM","math.IT"],"title_canon_sha256":"0af77ef8cd214c3775dce180c5b1344280fe80f9d196f0773eac265ac3defee5","abstract_canon_sha256":"4944818145164f059b04f80369dadc8f11ecc771564625de40c34e4ae2fbad52"},"schema_version":"1.0"},"canonical_sha256":"a33f1d202f9abcee67bb458f20afd184cb2c545f44ea7d5482ea2ccf0d540ea5","source":{"kind":"arxiv","id":"1305.6216","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6216","created_at":"2026-05-18T03:17:00Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6216v2","created_at":"2026-05-18T03:17:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6216","created_at":"2026-05-18T03:17:00Z"},{"alias_kind":"pith_short_12","alias_value":"UM7R2IBPTK6O","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UM7R2IBPTK6O4Z53","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UM7R2IBP","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UM7R2IBPTK6O4Z53IWHSBL6RQT","target":"record","payload":{"canonical_record":{"source":{"id":"1305.6216","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-27T13:38:22Z","cross_cats_sorted":["cs.MM","math.IT"],"title_canon_sha256":"0af77ef8cd214c3775dce180c5b1344280fe80f9d196f0773eac265ac3defee5","abstract_canon_sha256":"4944818145164f059b04f80369dadc8f11ecc771564625de40c34e4ae2fbad52"},"schema_version":"1.0"},"canonical_sha256":"a33f1d202f9abcee67bb458f20afd184cb2c545f44ea7d5482ea2ccf0d540ea5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:00.036241Z","signature_b64":"7J3Sd51RBAMRS6PYVtFGQ1zfRAcyR6mTnWWFLYYoJZaihbGMiibHOa048gSyntqkjwDcEltLT9NW95tAjEXIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a33f1d202f9abcee67bb458f20afd184cb2c545f44ea7d5482ea2ccf0d540ea5","last_reissued_at":"2026-05-18T03:17:00.035481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:00.035481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.6216","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-18T03:17:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jv7RIY0Lc3uwMsSWSiiL5AoOwIv6l1fy5qtF3iCgX6oLd6ADk4qPe0vaTQYmlHvtb08xUo5wZDsN6nstSUunAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:50:59.645178Z"},"content_sha256":"92c6c3ccef9006f423c1d9c8cccc1da94468ba3cf1c26cb3c1d12d4b4007e1db","schema_version":"1.0","event_id":"sha256:92c6c3ccef9006f423c1d9c8cccc1da94468ba3cf1c26cb3c1d12d4b4007e1db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UM7R2IBPTK6O4Z53IWHSBL6RQT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource Efficient LDPC Decoders for Multimedia Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM","math.IT"],"primary_cat":"cs.IT","authors_text":"Syed Mahfuzul Aziz, Vikram Arkalgud Chandrasetty","submitted_at":"2013-05-27T13:38:22Z","abstract_excerpt":"Achieving high image quality is an important aspect in an increasing number of wireless multimedia applications. These applications require resource efficient error correction hardware to detect and correct errors introduced by the communication channel. This paper presents an innovative flexible architecture for error correction using Low-Density Parity-Check (LDPC) codes. The proposed partially-parallel decoder architecture utilizes a novel code construction technique based on multi-level Hierarchical Quasi-Cyclic (HQC) matrix with innovative layering of random sub-matrices. Simulation of a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6216","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-18T03:17:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yl6pbSdl6nzrb3zxTK7xqse3l167C17cjvqYbuvtoM/GxZEuADlWjelSw6D0aDe5EEMWNsHWfkGl91QoDavcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:50:59.645558Z"},"content_sha256":"701fa5dd40544dd023c12d202bef81fe6e45afea7ebd4f45e035e11acc511908","schema_version":"1.0","event_id":"sha256:701fa5dd40544dd023c12d202bef81fe6e45afea7ebd4f45e035e11acc511908"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UM7R2IBPTK6O4Z53IWHSBL6RQT/bundle.json","state_url":"https://pith.science/pith/UM7R2IBPTK6O4Z53IWHSBL6RQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UM7R2IBPTK6O4Z53IWHSBL6RQT/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-01T12:50:59Z","links":{"resolver":"https://pith.science/pith/UM7R2IBPTK6O4Z53IWHSBL6RQT","bundle":"https://pith.science/pith/UM7R2IBPTK6O4Z53IWHSBL6RQT/bundle.json","state":"https://pith.science/pith/UM7R2IBPTK6O4Z53IWHSBL6RQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UM7R2IBPTK6O4Z53IWHSBL6RQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UM7R2IBPTK6O4Z53IWHSBL6RQT","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":"4944818145164f059b04f80369dadc8f11ecc771564625de40c34e4ae2fbad52","cross_cats_sorted":["cs.MM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-27T13:38:22Z","title_canon_sha256":"0af77ef8cd214c3775dce180c5b1344280fe80f9d196f0773eac265ac3defee5"},"schema_version":"1.0","source":{"id":"1305.6216","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6216","created_at":"2026-05-18T03:17:00Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6216v2","created_at":"2026-05-18T03:17:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6216","created_at":"2026-05-18T03:17:00Z"},{"alias_kind":"pith_short_12","alias_value":"UM7R2IBPTK6O","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UM7R2IBPTK6O4Z53","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UM7R2IBP","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:701fa5dd40544dd023c12d202bef81fe6e45afea7ebd4f45e035e11acc511908","target":"graph","created_at":"2026-05-18T03:17:00Z","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":"Achieving high image quality is an important aspect in an increasing number of wireless multimedia applications. These applications require resource efficient error correction hardware to detect and correct errors introduced by the communication channel. This paper presents an innovative flexible architecture for error correction using Low-Density Parity-Check (LDPC) codes. The proposed partially-parallel decoder architecture utilizes a novel code construction technique based on multi-level Hierarchical Quasi-Cyclic (HQC) matrix with innovative layering of random sub-matrices. Simulation of a ","authors_text":"Syed Mahfuzul Aziz, Vikram Arkalgud Chandrasetty","cross_cats":["cs.MM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-27T13:38:22Z","title":"Resource Efficient LDPC Decoders for Multimedia Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6216","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:92c6c3ccef9006f423c1d9c8cccc1da94468ba3cf1c26cb3c1d12d4b4007e1db","target":"record","created_at":"2026-05-18T03:17:00Z","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":"4944818145164f059b04f80369dadc8f11ecc771564625de40c34e4ae2fbad52","cross_cats_sorted":["cs.MM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-27T13:38:22Z","title_canon_sha256":"0af77ef8cd214c3775dce180c5b1344280fe80f9d196f0773eac265ac3defee5"},"schema_version":"1.0","source":{"id":"1305.6216","kind":"arxiv","version":2}},"canonical_sha256":"a33f1d202f9abcee67bb458f20afd184cb2c545f44ea7d5482ea2ccf0d540ea5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a33f1d202f9abcee67bb458f20afd184cb2c545f44ea7d5482ea2ccf0d540ea5","first_computed_at":"2026-05-18T03:17:00.035481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:00.035481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7J3Sd51RBAMRS6PYVtFGQ1zfRAcyR6mTnWWFLYYoJZaihbGMiibHOa048gSyntqkjwDcEltLT9NW95tAjEXIBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:00.036241Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.6216","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92c6c3ccef9006f423c1d9c8cccc1da94468ba3cf1c26cb3c1d12d4b4007e1db","sha256:701fa5dd40544dd023c12d202bef81fe6e45afea7ebd4f45e035e11acc511908"],"state_sha256":"e481a4933611c96018e34a00777d086e4e94d9c0936cdbeb55a12c808eb76c81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o5451ba6An71xfsJNawDvS6WTXMn9JF7eHuR7R1fOCYS/757mh+k1g2x8wRbNDqYDTOtpKQtl+V6e6nmc5agAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:50:59.647557Z","bundle_sha256":"767e1c7a3698adc9b00e6eb41c583b821ebaf84723075170fc26f3c4792b6b28"}}