{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:C7ZNQ6ZQV5ZNPA6QBUISOTOYBE","short_pith_number":"pith:C7ZNQ6ZQ","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"},"canonical_sha256":"17f2d87b30af72d783d00d11274dd8092dd6fc0316c023546c4ed2dfc24a51ac","source":{"kind":"arxiv","id":"1604.06553","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06553","created_at":"2026-05-18T01:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06553v2","created_at":"2026-05-18T01:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06553","created_at":"2026-05-18T01:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"C7ZNQ6ZQV5ZN","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C7ZNQ6ZQV5ZNPA6Q","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C7ZNQ6ZQ","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:C7ZNQ6ZQV5ZNPA6QBUISOTOYBE","target":"record","payload":{"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"},"canonical_sha256":"17f2d87b30af72d783d00d11274dd8092dd6fc0316c023546c4ed2dfc24a51ac","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"},"source_kind":"arxiv","source_id":"1604.06553","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-18T01:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QDzf17sE5EGEuPzlCzPZRvZNIxecxtv7XPwqfSIwUakeX8lHgLaKoe5esw18RIyh5zpOZ4HffhNtcBn/43haAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:06:16.211894Z"},"content_sha256":"503a51724b287eea84834c6690ec71a55cd5f8d4356fdeaea184ceef7264633a","schema_version":"1.0","event_id":"sha256:503a51724b287eea84834c6690ec71a55cd5f8d4356fdeaea184ceef7264633a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:C7ZNQ6ZQV5ZNPA6QBUISOTOYBE","target":"graph","payload":{"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"},"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-18T01:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GCIRULCSNDDJ7GQgBIYD0ahsgNo+PJWrOG3zI85+sRtCRcmXAcFsDvBRoMFjpj5MdVIzLgees2DnjZY61+ztBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:06:16.212267Z"},"content_sha256":"73464fd173c78880b959caa5e96b5602677cae7a1ac80fa1c2b83eed8379a3e6","schema_version":"1.0","event_id":"sha256:73464fd173c78880b959caa5e96b5602677cae7a1ac80fa1c2b83eed8379a3e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE/bundle.json","state_url":"https://pith.science/pith/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE/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-28T16:06:16Z","links":{"resolver":"https://pith.science/pith/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE","bundle":"https://pith.science/pith/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE/bundle.json","state":"https://pith.science/pith/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7ZNQ6ZQV5ZNPA6QBUISOTOYBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C7ZNQ6ZQV5ZNPA6QBUISOTOYBE","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":"6a179e902f8b5cde1892953ede9016ac38339b4bca80ee30dbb77a17bb4f8bbe","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-22T07:04:29Z","title_canon_sha256":"eacade8dfc7d480dfc55792a83bee3c8c1723a9de6eb79f43fa2bc06fac95f52"},"schema_version":"1.0","source":{"id":"1604.06553","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06553","created_at":"2026-05-18T01:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06553v2","created_at":"2026-05-18T01:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06553","created_at":"2026-05-18T01:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"C7ZNQ6ZQV5ZN","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C7ZNQ6ZQV5ZNPA6Q","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C7ZNQ6ZQ","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:73464fd173c78880b959caa5e96b5602677cae7a1ac80fa1c2b83eed8379a3e6","target":"graph","created_at":"2026-05-18T01:12: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":"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","authors_text":"Alexandre Graell i Amat, Christian H\\\"ager, Fredrik Br\\\"annstr\\\"om, Henry D. Pfister","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-22T07:04:29Z","title":"Density Evolution for Deterministic Generalized Product Codes with Higher-Order Modulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06553","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:503a51724b287eea84834c6690ec71a55cd5f8d4356fdeaea184ceef7264633a","target":"record","created_at":"2026-05-18T01:12: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":"6a179e902f8b5cde1892953ede9016ac38339b4bca80ee30dbb77a17bb4f8bbe","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-22T07:04:29Z","title_canon_sha256":"eacade8dfc7d480dfc55792a83bee3c8c1723a9de6eb79f43fa2bc06fac95f52"},"schema_version":"1.0","source":{"id":"1604.06553","kind":"arxiv","version":2}},"canonical_sha256":"17f2d87b30af72d783d00d11274dd8092dd6fc0316c023546c4ed2dfc24a51ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17f2d87b30af72d783d00d11274dd8092dd6fc0316c023546c4ed2dfc24a51ac","first_computed_at":"2026-05-18T01:12:11.740852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:11.740852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J2vQusoSFukCQEN788R3odG/ZMnvLCcm0N/LA4o8WED5Tn1nD230mLAKZwbRLSeoiEFfD4nAYh07lam867XHCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:11.741266Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06553","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:503a51724b287eea84834c6690ec71a55cd5f8d4356fdeaea184ceef7264633a","sha256:73464fd173c78880b959caa5e96b5602677cae7a1ac80fa1c2b83eed8379a3e6"],"state_sha256":"81d31d830acc19b0a659e332fd47039a4990be55ed042b886447a5c15513c00e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S4kpZ6RmFzh+PXdB5/MOyWxq+Z8H9Cmti7ybA3+rvA0yV5MGtQDaUaFaJVbFpcho05wxbkcVdCcmjkQuvtgACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:06:16.214733Z","bundle_sha256":"7d381f1bc96d68367b6d1dd1152da24b42e595754a7edc0e11c1bd2286bdfeff"}}