{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4TBC7N37UN6QZ6HEQ4BSGWUGD3","short_pith_number":"pith:4TBC7N37","canonical_record":{"source":{"id":"1512.00433","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-01T20:43:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2c255f75ee3698d150eeb56ee840b43aab90c29f2e0ac28c5037e4408aebf134","abstract_canon_sha256":"b7d2c5001faa7df7dcb06f9e0058814151fc43ef69dfbb81d07785fdd840ce51"},"schema_version":"1.0"},"canonical_sha256":"e4c22fb77fa37d0cf8e48703235a861efb8ea79883714733af64385035189127","source":{"kind":"arxiv","id":"1512.00433","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00433","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00433v2","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00433","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"pith_short_12","alias_value":"4TBC7N37UN6Q","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4TBC7N37UN6QZ6HE","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4TBC7N37","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4TBC7N37UN6QZ6HEQ4BSGWUGD3","target":"record","payload":{"canonical_record":{"source":{"id":"1512.00433","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-01T20:43:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2c255f75ee3698d150eeb56ee840b43aab90c29f2e0ac28c5037e4408aebf134","abstract_canon_sha256":"b7d2c5001faa7df7dcb06f9e0058814151fc43ef69dfbb81d07785fdd840ce51"},"schema_version":"1.0"},"canonical_sha256":"e4c22fb77fa37d0cf8e48703235a861efb8ea79883714733af64385035189127","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:01.765479Z","signature_b64":"eyKHU9UQjdTHCRTZp5QigoPa7lBCdlHX1tERmLkwsiVTGUbYL2XqGe3WBwWWj9pPQDr8SLk58peSeeSwHbaXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4c22fb77fa37d0cf8e48703235a861efb8ea79883714733af64385035189127","last_reissued_at":"2026-05-18T00:50:01.764787Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:01.764787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.00433","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-18T00:50:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/njR/7SQkMwf5lHVbOCc1z8zBaNimlpCtssq0NMngxMBdoK3UXz5RvpqHs05WTyVz7VYEt6OJ4/DiK4NYiwGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:16:35.750000Z"},"content_sha256":"b0d6613217a240c007a7d45dc812c520c166c2a48d5f1cea4e9137f032f6abf3","schema_version":"1.0","event_id":"sha256:b0d6613217a240c007a7d45dc812c520c166c2a48d5f1cea4e9137f032f6abf3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4TBC7N37UN6QZ6HEQ4BSGWUGD3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Density Evolution for Deterministic Generalized Product Codes on the Binary Erasure Channel at High Rates","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":"2015-12-01T20:43:18Z","abstract_excerpt":"Generalized product codes (GPCs) are extensions of product codes (PCs) where code symbols are protected by two component codes but not necessarily arranged in a rectangular array. We consider a deterministic construction of GPCs (as opposed to randomized code ensembles) and analyze the asymptotic performance over the binary erasure channel under iterative decoding. Our code construction encompasses several classes of GPCs previously proposed in the literature, such as irregular PCs, block-wise braided codes, and staircase codes. It is assumed that the component codes can correct a fixed number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00433","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-18T00:50:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"abMklIrX4ItYoysp/LXOVh5dkt5XCyC/ePOTv3s88iQp2DN/4ntN1OIalcq8xmKH/Fn94VUqrZZf9LrVnrfFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:16:35.750377Z"},"content_sha256":"fe29c094d96f446143c429d93f3cc0deba2e47ae45d728a151edd72b62d82216","schema_version":"1.0","event_id":"sha256:fe29c094d96f446143c429d93f3cc0deba2e47ae45d728a151edd72b62d82216"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TBC7N37UN6QZ6HEQ4BSGWUGD3/bundle.json","state_url":"https://pith.science/pith/4TBC7N37UN6QZ6HEQ4BSGWUGD3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TBC7N37UN6QZ6HEQ4BSGWUGD3/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-27T14:16:35Z","links":{"resolver":"https://pith.science/pith/4TBC7N37UN6QZ6HEQ4BSGWUGD3","bundle":"https://pith.science/pith/4TBC7N37UN6QZ6HEQ4BSGWUGD3/bundle.json","state":"https://pith.science/pith/4TBC7N37UN6QZ6HEQ4BSGWUGD3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TBC7N37UN6QZ6HEQ4BSGWUGD3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4TBC7N37UN6QZ6HEQ4BSGWUGD3","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":"b7d2c5001faa7df7dcb06f9e0058814151fc43ef69dfbb81d07785fdd840ce51","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-01T20:43:18Z","title_canon_sha256":"2c255f75ee3698d150eeb56ee840b43aab90c29f2e0ac28c5037e4408aebf134"},"schema_version":"1.0","source":{"id":"1512.00433","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00433","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00433v2","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00433","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"pith_short_12","alias_value":"4TBC7N37UN6Q","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4TBC7N37UN6QZ6HE","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4TBC7N37","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:fe29c094d96f446143c429d93f3cc0deba2e47ae45d728a151edd72b62d82216","target":"graph","created_at":"2026-05-18T00:50:01Z","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 code symbols are protected by two component codes but not necessarily arranged in a rectangular array. We consider a deterministic construction of GPCs (as opposed to randomized code ensembles) and analyze the asymptotic performance over the binary erasure channel under iterative decoding. Our code construction encompasses several classes of GPCs previously proposed in the literature, such as irregular PCs, block-wise braided codes, and staircase codes. It is assumed that the component codes can correct a fixed number","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":"2015-12-01T20:43:18Z","title":"Density Evolution for Deterministic Generalized Product Codes on the Binary Erasure Channel at High Rates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00433","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:b0d6613217a240c007a7d45dc812c520c166c2a48d5f1cea4e9137f032f6abf3","target":"record","created_at":"2026-05-18T00:50:01Z","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":"b7d2c5001faa7df7dcb06f9e0058814151fc43ef69dfbb81d07785fdd840ce51","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-01T20:43:18Z","title_canon_sha256":"2c255f75ee3698d150eeb56ee840b43aab90c29f2e0ac28c5037e4408aebf134"},"schema_version":"1.0","source":{"id":"1512.00433","kind":"arxiv","version":2}},"canonical_sha256":"e4c22fb77fa37d0cf8e48703235a861efb8ea79883714733af64385035189127","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4c22fb77fa37d0cf8e48703235a861efb8ea79883714733af64385035189127","first_computed_at":"2026-05-18T00:50:01.764787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:01.764787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eyKHU9UQjdTHCRTZp5QigoPa7lBCdlHX1tERmLkwsiVTGUbYL2XqGe3WBwWWj9pPQDr8SLk58peSeeSwHbaXCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:01.765479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.00433","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0d6613217a240c007a7d45dc812c520c166c2a48d5f1cea4e9137f032f6abf3","sha256:fe29c094d96f446143c429d93f3cc0deba2e47ae45d728a151edd72b62d82216"],"state_sha256":"0b68e5f856fced3efe96fc4840fefae5743b1c6cfafe90495c090ca1ec727a5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ndPE65Jp5WVKAFfkCYFNwNBHCiJiybSlBM7a67VZWcvFEytPPAROHZse+FAdEbz69hGTtF/5MZ1+BaD1FCb6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:16:35.752864Z","bundle_sha256":"c2348f4422f252c26d1d4944609d930b5a99eed01bf9c1cb2fbaba5e5e82759b"}}