{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:XSUQ4SSZWT6UYEVM22UYYBCZZ4","short_pith_number":"pith:XSUQ4SSZ","canonical_record":{"source":{"id":"0710.1182","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-10-05T10:47:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"453b1713a58f054822f8c26bf5b3c45cefb9849eade7ee2c5beb17f8ac40a504","abstract_canon_sha256":"616746aaa76c8c68bb365c2134f4d7ba1fe06fe12f080b052a3740ef1b0c3fe6"},"schema_version":"1.0"},"canonical_sha256":"bca90e4a59b4fd4c12acd6a98c0459cf3cd55c8be726ed119cbe6f0085ddf04b","source":{"kind":"arxiv","id":"0710.1182","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0710.1182","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0710.1182v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.1182","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"XSUQ4SSZWT6U","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"XSUQ4SSZWT6UYEVM","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"XSUQ4SSZ","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:XSUQ4SSZWT6UYEVM22UYYBCZZ4","target":"record","payload":{"canonical_record":{"source":{"id":"0710.1182","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-10-05T10:47:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"453b1713a58f054822f8c26bf5b3c45cefb9849eade7ee2c5beb17f8ac40a504","abstract_canon_sha256":"616746aaa76c8c68bb365c2134f4d7ba1fe06fe12f080b052a3740ef1b0c3fe6"},"schema_version":"1.0"},"canonical_sha256":"bca90e4a59b4fd4c12acd6a98c0459cf3cd55c8be726ed119cbe6f0085ddf04b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.841680Z","signature_b64":"6Hx96rJKP6axgZc5+Shax3twNyI1Cox7C98zW5EDdWqh9MeFfYngGZzn6pD567JPBlFqrb6rmDfVOMzP27BiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bca90e4a59b4fd4c12acd6a98c0459cf3cd55c8be726ed119cbe6f0085ddf04b","last_reissued_at":"2026-05-18T00:57:58.841259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.841259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0710.1182","source_version":1,"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:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nIvILYR98wj6ukGg+JSIBOn2X3FFMgTT8Y3HjV9ZYyN34a6vmRTnYOFpQdxL+0jeF6EpgFrxoLTECVvhOFVfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T06:06:35.632377Z"},"content_sha256":"3fb9a9ee49b35af1b56faff56ef075d72e0bec49709359d0f9ce2996fc123b96","schema_version":"1.0","event_id":"sha256:3fb9a9ee49b35af1b56faff56ef075d72e0bec49709359d0f9ce2996fc123b96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:XSUQ4SSZWT6UYEVM22UYYBCZZ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Albert Guillen i Fabregas, Ezio Biglieri, Gilles Zemor, Joseph J. Boutros","submitted_at":"2007-10-05T10:47:52Z","abstract_excerpt":"We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather straightforward. Unfortunately, optimal constructions for maximum-likelihood decoding do not perform well under iterative decoding. To overcome this limitation, we then introduce a new family of full-diversity LDPC codes that exhibit near-outage-limit performance under iterative decoding for all block-lengths. This family competes with multiplexed parallel turbo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.1182","kind":"arxiv","version":1},"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:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jlM1JIULN6UwxDscAi/6I/vxExr4Hu3BWrrYU/HKVprFGRfl/5eRaz7pm1T8z6HkCizFy/lONHh4bUkbqVB3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T06:06:35.632758Z"},"content_sha256":"aed9a1fbd8f7bc4fec09b35691da775421cbe2a2cade0c6344f79789f212b13b","schema_version":"1.0","event_id":"sha256:aed9a1fbd8f7bc4fec09b35691da775421cbe2a2cade0c6344f79789f212b13b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XSUQ4SSZWT6UYEVM22UYYBCZZ4/bundle.json","state_url":"https://pith.science/pith/XSUQ4SSZWT6UYEVM22UYYBCZZ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XSUQ4SSZWT6UYEVM22UYYBCZZ4/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-21T06:06:35Z","links":{"resolver":"https://pith.science/pith/XSUQ4SSZWT6UYEVM22UYYBCZZ4","bundle":"https://pith.science/pith/XSUQ4SSZWT6UYEVM22UYYBCZZ4/bundle.json","state":"https://pith.science/pith/XSUQ4SSZWT6UYEVM22UYYBCZZ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XSUQ4SSZWT6UYEVM22UYYBCZZ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:XSUQ4SSZWT6UYEVM22UYYBCZZ4","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":"616746aaa76c8c68bb365c2134f4d7ba1fe06fe12f080b052a3740ef1b0c3fe6","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-10-05T10:47:52Z","title_canon_sha256":"453b1713a58f054822f8c26bf5b3c45cefb9849eade7ee2c5beb17f8ac40a504"},"schema_version":"1.0","source":{"id":"0710.1182","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0710.1182","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0710.1182v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.1182","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"XSUQ4SSZWT6U","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"XSUQ4SSZWT6UYEVM","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"XSUQ4SSZ","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:aed9a1fbd8f7bc4fec09b35691da775421cbe2a2cade0c6344f79789f212b13b","target":"graph","created_at":"2026-05-18T00:57:58Z","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 solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather straightforward. Unfortunately, optimal constructions for maximum-likelihood decoding do not perform well under iterative decoding. To overcome this limitation, we then introduce a new family of full-diversity LDPC codes that exhibit near-outage-limit performance under iterative decoding for all block-lengths. This family competes with multiplexed parallel turbo","authors_text":"Albert Guillen i Fabregas, Ezio Biglieri, Gilles Zemor, Joseph J. Boutros","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2007-10-05T10:47:52Z","title":"Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.1182","kind":"arxiv","version":1},"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:3fb9a9ee49b35af1b56faff56ef075d72e0bec49709359d0f9ce2996fc123b96","target":"record","created_at":"2026-05-18T00:57:58Z","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":"616746aaa76c8c68bb365c2134f4d7ba1fe06fe12f080b052a3740ef1b0c3fe6","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-10-05T10:47:52Z","title_canon_sha256":"453b1713a58f054822f8c26bf5b3c45cefb9849eade7ee2c5beb17f8ac40a504"},"schema_version":"1.0","source":{"id":"0710.1182","kind":"arxiv","version":1}},"canonical_sha256":"bca90e4a59b4fd4c12acd6a98c0459cf3cd55c8be726ed119cbe6f0085ddf04b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bca90e4a59b4fd4c12acd6a98c0459cf3cd55c8be726ed119cbe6f0085ddf04b","first_computed_at":"2026-05-18T00:57:58.841259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:58.841259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6Hx96rJKP6axgZc5+Shax3twNyI1Cox7C98zW5EDdWqh9MeFfYngGZzn6pD567JPBlFqrb6rmDfVOMzP27BiCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:58.841680Z","signed_message":"canonical_sha256_bytes"},"source_id":"0710.1182","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fb9a9ee49b35af1b56faff56ef075d72e0bec49709359d0f9ce2996fc123b96","sha256:aed9a1fbd8f7bc4fec09b35691da775421cbe2a2cade0c6344f79789f212b13b"],"state_sha256":"74578642e06c2cd5b959d1cf9fbf23da29f34ee447ec2eddf7e560b0f37789ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2xHqZ9gEKODAmWGHlbjce2uB7bUSGeNSQB/3Id95bwukUMHRin791YeQ3BDxvvAyJhesO2IiSPJgpi2joadMCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T06:06:35.634755Z","bundle_sha256":"8439bd1c880693603e3345555876f9181a7b30252aa60db32cb6085a8c92ee29"}}