{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:C7ZNQ6ZQV5ZNPA6QBUISOTOYBE","short_pith_number":"pith:C7ZNQ6ZQ","schema_version":"1.0","canonical_sha256":"17f2d87b30af72d783d00d11274dd8092dd6fc0316c023546c4ed2dfc24a51ac","source":{"kind":"arxiv","id":"1604.06553","version":2},"attestation_state":"computed","paper":{"title":"Density Evolution for Deterministic Generalized Product Codes with Higher-Order Modulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Christian H\\\"ager, Fredrik Br\\\"annstr\\\"om, Henry D. Pfister","submitted_at":"2016-04-22T07:04:29Z","abstract_excerpt":"Generalized product codes (GPCs) are extensions of product codes (PCs) where coded bits are protected by two component codes but not necessarily arranged in a rectangular array. It has recently been shown that there exists a large class of deterministic GPCs (including, e.g., irregular PCs, half-product codes, staircase codes, and certain braided codes) for which the asymptotic performance under iterative bounded-distance decoding over the binary erasure channel (BEC) can be rigorously characterized in terms of a density evolution analysis. In this paper, the analysis is extended to the case w"},"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":"1604.06553","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-22T07:04:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"eacade8dfc7d480dfc55792a83bee3c8c1723a9de6eb79f43fa2bc06fac95f52","abstract_canon_sha256":"6a179e902f8b5cde1892953ede9016ac38339b4bca80ee30dbb77a17bb4f8bbe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:11.741266Z","signature_b64":"J2vQusoSFukCQEN788R3odG/ZMnvLCcm0N/LA4o8WED5Tn1nD230mLAKZwbRLSeoiEFfD4nAYh07lam867XHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17f2d87b30af72d783d00d11274dd8092dd6fc0316c023546c4ed2dfc24a51ac","last_reissued_at":"2026-05-18T01:12:11.740852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:11.740852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Density Evolution for Deterministic Generalized Product Codes with Higher-Order Modulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Christian H\\\"ager, Fredrik Br\\\"annstr\\\"om, Henry D. Pfister","submitted_at":"2016-04-22T07:04:29Z","abstract_excerpt":"Generalized product codes (GPCs) are extensions of product codes (PCs) where coded bits are protected by two component codes but not necessarily arranged in a rectangular array. It has recently been shown that there exists a large class of deterministic GPCs (including, e.g., irregular PCs, half-product codes, staircase codes, and certain braided codes) for which the asymptotic performance under iterative bounded-distance decoding over the binary erasure channel (BEC) can be rigorously characterized in terms of a density evolution analysis. In this paper, the analysis is extended to the case w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06553","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":"1604.06553","created_at":"2026-05-18T01:12:11.740926+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06553v2","created_at":"2026-05-18T01:12:11.740926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06553","created_at":"2026-05-18T01:12:11.740926+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7ZNQ6ZQV5ZN","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7ZNQ6ZQV5ZNPA6Q","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7ZNQ6ZQ","created_at":"2026-05-18T12:30:09.641336+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/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE","json":"https://pith.science/pith/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE.json","graph_json":"https://pith.science/api/pith-number/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE/graph.json","events_json":"https://pith.science/api/pith-number/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE/events.json","paper":"https://pith.science/paper/C7ZNQ6ZQ"},"agent_actions":{"view_html":"https://pith.science/pith/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE","download_json":"https://pith.science/pith/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE.json","view_paper":"https://pith.science/paper/C7ZNQ6ZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06553&json=true","fetch_graph":"https://pith.science/api/pith-number/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE/graph.json","fetch_events":"https://pith.science/api/pith-number/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE/action/storage_attestation","attest_author":"https://pith.science/pith/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE/action/author_attestation","sign_citation":"https://pith.science/pith/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE/action/citation_signature","submit_replication":"https://pith.science/pith/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE/action/replication_record"}},"created_at":"2026-05-18T01:12:11.740926+00:00","updated_at":"2026-05-18T01:12:11.740926+00:00"}