{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:54VTJKMO62ZKEANZFFN53EQA7W","short_pith_number":"pith:54VTJKMO","canonical_record":{"source":{"id":"1503.02986","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-03-10T16:54:39Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e861797633d9fb86f2eea47d67e053a8203d912bc9d3420c666567afbc970f9a","abstract_canon_sha256":"c230da3997aec3bcb1afc7a07a1eecfd77ecf435bbe607242f7da509493a4905"},"schema_version":"1.0"},"canonical_sha256":"ef2b34a98ef6b2a201b9295bdd9200fd86e7b09410ce6b052fd0691e5aa32ed0","source":{"kind":"arxiv","id":"1503.02986","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02986","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02986v3","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02986","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"pith_short_12","alias_value":"54VTJKMO62ZK","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"54VTJKMO62ZKEANZ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"54VTJKMO","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:54VTJKMO62ZKEANZFFN53EQA7W","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02986","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-03-10T16:54:39Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e861797633d9fb86f2eea47d67e053a8203d912bc9d3420c666567afbc970f9a","abstract_canon_sha256":"c230da3997aec3bcb1afc7a07a1eecfd77ecf435bbe607242f7da509493a4905"},"schema_version":"1.0"},"canonical_sha256":"ef2b34a98ef6b2a201b9295bdd9200fd86e7b09410ce6b052fd0691e5aa32ed0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:20.090565Z","signature_b64":"Zxw82QghyLpbo1AiDWBOVfUiAtCCmqK40zcBDm1lWZrVLZgFkelm/EcpV7dF3423TF+Z7buXuJzw9rjEGMs5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef2b34a98ef6b2a201b9295bdd9200fd86e7b09410ce6b052fd0691e5aa32ed0","last_reissued_at":"2026-05-18T02:16:20.089911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:20.089911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02986","source_version":3,"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-18T02:16:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hEgZEXzoPuSY7uR17BrxkD9ne0zmKRrAeZmUqfx3g3mgbX5wMGK+p+HMXMF5WR73ynbuNjXewQoh0iFf4ZZWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T13:03:14.513603Z"},"content_sha256":"b5d79f0466e9bf1db8d1e5ea0b68334c9e71728c5f1184a07063cac6b6c42308","schema_version":"1.0","event_id":"sha256:b5d79f0466e9bf1db8d1e5ea0b68334c9e71728c5f1184a07063cac6b6c42308"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:54VTJKMO62ZKEANZFFN53EQA7W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strategies for High-Throughput FPGA-based QC-LDPC Decoder Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.AR","authors_text":"Ahsan Aziz, Hojin Kee, Predrag Spasojevic, Swapnil Mhaske, Tai Ly","submitted_at":"2015-03-10T16:54:39Z","abstract_excerpt":"We propose without loss of generality strategies to achieve a high-throughput FPGA-based architecture for a QC-LDPC code based on a circulant-1 identity matrix construction. We present a novel representation of the parity-check matrix (PCM) providing a multi-fold throughput gain. Splitting of the node processing algorithm enables us to achieve pipelining of blocks and hence layers. By partitioning the PCM into not only layers but superlayers we derive an upper bound on the pipelining depth for the compact representation. To validate the architecture, a decoder for the IEEE 802.11n (2012) QC-LD"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02986","kind":"arxiv","version":3},"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-18T02:16:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2BSZ6u41CHMyd/LMC6ZOS0DBFyYpiK0M9UvFRFexHGiVcfVHFjfGQYqDzgZRFOT3yCcPV31SMlfqzcFencO/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T13:03:14.513939Z"},"content_sha256":"69663eead92e7b0568901c4d36fad0e60ab482e453ddd5001d93a24ef6aea692","schema_version":"1.0","event_id":"sha256:69663eead92e7b0568901c4d36fad0e60ab482e453ddd5001d93a24ef6aea692"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/54VTJKMO62ZKEANZFFN53EQA7W/bundle.json","state_url":"https://pith.science/pith/54VTJKMO62ZKEANZFFN53EQA7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/54VTJKMO62ZKEANZFFN53EQA7W/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-30T13:03:14Z","links":{"resolver":"https://pith.science/pith/54VTJKMO62ZKEANZFFN53EQA7W","bundle":"https://pith.science/pith/54VTJKMO62ZKEANZFFN53EQA7W/bundle.json","state":"https://pith.science/pith/54VTJKMO62ZKEANZFFN53EQA7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/54VTJKMO62ZKEANZFFN53EQA7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:54VTJKMO62ZKEANZFFN53EQA7W","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":"c230da3997aec3bcb1afc7a07a1eecfd77ecf435bbe607242f7da509493a4905","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-03-10T16:54:39Z","title_canon_sha256":"e861797633d9fb86f2eea47d67e053a8203d912bc9d3420c666567afbc970f9a"},"schema_version":"1.0","source":{"id":"1503.02986","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02986","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02986v3","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02986","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"pith_short_12","alias_value":"54VTJKMO62ZK","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"54VTJKMO62ZKEANZ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"54VTJKMO","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:69663eead92e7b0568901c4d36fad0e60ab482e453ddd5001d93a24ef6aea692","target":"graph","created_at":"2026-05-18T02:16:20Z","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 propose without loss of generality strategies to achieve a high-throughput FPGA-based architecture for a QC-LDPC code based on a circulant-1 identity matrix construction. We present a novel representation of the parity-check matrix (PCM) providing a multi-fold throughput gain. Splitting of the node processing algorithm enables us to achieve pipelining of blocks and hence layers. By partitioning the PCM into not only layers but superlayers we derive an upper bound on the pipelining depth for the compact representation. To validate the architecture, a decoder for the IEEE 802.11n (2012) QC-LD","authors_text":"Ahsan Aziz, Hojin Kee, Predrag Spasojevic, Swapnil Mhaske, Tai Ly","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-03-10T16:54:39Z","title":"Strategies for High-Throughput FPGA-based QC-LDPC Decoder Architecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02986","kind":"arxiv","version":3},"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:b5d79f0466e9bf1db8d1e5ea0b68334c9e71728c5f1184a07063cac6b6c42308","target":"record","created_at":"2026-05-18T02:16:20Z","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":"c230da3997aec3bcb1afc7a07a1eecfd77ecf435bbe607242f7da509493a4905","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2015-03-10T16:54:39Z","title_canon_sha256":"e861797633d9fb86f2eea47d67e053a8203d912bc9d3420c666567afbc970f9a"},"schema_version":"1.0","source":{"id":"1503.02986","kind":"arxiv","version":3}},"canonical_sha256":"ef2b34a98ef6b2a201b9295bdd9200fd86e7b09410ce6b052fd0691e5aa32ed0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef2b34a98ef6b2a201b9295bdd9200fd86e7b09410ce6b052fd0691e5aa32ed0","first_computed_at":"2026-05-18T02:16:20.089911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:20.089911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zxw82QghyLpbo1AiDWBOVfUiAtCCmqK40zcBDm1lWZrVLZgFkelm/EcpV7dF3423TF+Z7buXuJzw9rjEGMs5DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:20.090565Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02986","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5d79f0466e9bf1db8d1e5ea0b68334c9e71728c5f1184a07063cac6b6c42308","sha256:69663eead92e7b0568901c4d36fad0e60ab482e453ddd5001d93a24ef6aea692"],"state_sha256":"ab2b254137f84f715ac1114c37821b8f13dc099b16fd7777188b64aaf6348b98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lB9Zfb3XMW1/GF4ZheUL4owm04/NAkM7cDuFf+hshAUnG5Rs9JON7+YnI1s6gzARIpd7vJMYPae+W+luhVeMDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T13:03:14.515748Z","bundle_sha256":"8602057053b61131c805b05ad0ca5d067d59a4857ab64fdb16a61981af508a63"}}