{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:VFGGZ6U76UY7JUBGEV5FBJ6OHN","short_pith_number":"pith:VFGGZ6U7","canonical_record":{"source":{"id":"0903.1502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-09T09:42:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1fdca0c9be2bb687118a04b9e0e301e4d3da91b8ca9aa1574feaebbf06af44f8","abstract_canon_sha256":"17fe9dd7c58353227b91c70eadfc37ee8781c08d2aa7723648074e2dcd7e9270"},"schema_version":"1.0"},"canonical_sha256":"a94c6cfa9ff531f4d026257a50a7ce3b712c6142f3576ea4f113af721e308819","source":{"kind":"arxiv","id":"0903.1502","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.1502","created_at":"2026-05-18T03:44:04Z"},{"alias_kind":"arxiv_version","alias_value":"0903.1502v2","created_at":"2026-05-18T03:44:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.1502","created_at":"2026-05-18T03:44:04Z"},{"alias_kind":"pith_short_12","alias_value":"VFGGZ6U76UY7","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"VFGGZ6U76UY7JUBG","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"VFGGZ6U7","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:VFGGZ6U76UY7JUBGEV5FBJ6OHN","target":"record","payload":{"canonical_record":{"source":{"id":"0903.1502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-09T09:42:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1fdca0c9be2bb687118a04b9e0e301e4d3da91b8ca9aa1574feaebbf06af44f8","abstract_canon_sha256":"17fe9dd7c58353227b91c70eadfc37ee8781c08d2aa7723648074e2dcd7e9270"},"schema_version":"1.0"},"canonical_sha256":"a94c6cfa9ff531f4d026257a50a7ce3b712c6142f3576ea4f113af721e308819","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:04.874787Z","signature_b64":"RbRnYb+HZSQALUsYiD85LuGWIPA/pIIkmvhi7kD/PNEXd+h0YliqgGi8kE+idGE/4PBEg4zovNb7ETEq3tUAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a94c6cfa9ff531f4d026257a50a7ce3b712c6142f3576ea4f113af721e308819","last_reissued_at":"2026-05-18T03:44:04.873915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:04.873915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0903.1502","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-18T03:44:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JD/ovKumNDnQhyUlevngP0HLzL1CfiNyfz3AvHZFwUufwroKKVNuxInMgYcvrhT1Eq4MSAgTXD2TKS3i5t/kDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T05:28:01.637756Z"},"content_sha256":"f37fe1851a0619753ab48e1caa79c953138c8fd0888c83566dc8c8d9cc7702a0","schema_version":"1.0","event_id":"sha256:f37fe1851a0619753ab48e1caa79c953138c8fd0888c83566dc8c8d9cc7702a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:VFGGZ6U76UY7JUBGEV5FBJ6OHN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Density Graph Codes for slow fading Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dieter Duyck, Joseph J. Boutros, Marc Moeneclaey","submitted_at":"2009-03-09T09:42:24Z","abstract_excerpt":"We study Low-Density Parity-Check (LDPC) codes with iterative decoding on block-fading (BF) Relay Channels. We consider two users that employ coded cooperation, a variant of decode-and-forward with a smaller outage probability than the latter. An outage probability analysis for discrete constellations shows that full diversity can be achieved only when the coding rate does not exceed a maximum value that depends on the level of cooperation. We derive a new code structure by extending the previously published full-diversity root-LDPC code, designed for the BF point-to-point channel, to exhibit "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.1502","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-18T03:44:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SlHR/JDDqJYoZyarPIjh7igcYd3GPYe1++CUF+pY+zfE7K9f/yk/Gp8FYKYpqSI+0OXGpcTXtfvh/zaS7aBlDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T05:28:01.638503Z"},"content_sha256":"51339c07126a9e14cca4bb637d2dfcf38d0819d35b52d208db2b5d3f413905af","schema_version":"1.0","event_id":"sha256:51339c07126a9e14cca4bb637d2dfcf38d0819d35b52d208db2b5d3f413905af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VFGGZ6U76UY7JUBGEV5FBJ6OHN/bundle.json","state_url":"https://pith.science/pith/VFGGZ6U76UY7JUBGEV5FBJ6OHN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VFGGZ6U76UY7JUBGEV5FBJ6OHN/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-06T05:28:01Z","links":{"resolver":"https://pith.science/pith/VFGGZ6U76UY7JUBGEV5FBJ6OHN","bundle":"https://pith.science/pith/VFGGZ6U76UY7JUBGEV5FBJ6OHN/bundle.json","state":"https://pith.science/pith/VFGGZ6U76UY7JUBGEV5FBJ6OHN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VFGGZ6U76UY7JUBGEV5FBJ6OHN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:VFGGZ6U76UY7JUBGEV5FBJ6OHN","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":"17fe9dd7c58353227b91c70eadfc37ee8781c08d2aa7723648074e2dcd7e9270","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-09T09:42:24Z","title_canon_sha256":"1fdca0c9be2bb687118a04b9e0e301e4d3da91b8ca9aa1574feaebbf06af44f8"},"schema_version":"1.0","source":{"id":"0903.1502","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.1502","created_at":"2026-05-18T03:44:04Z"},{"alias_kind":"arxiv_version","alias_value":"0903.1502v2","created_at":"2026-05-18T03:44:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.1502","created_at":"2026-05-18T03:44:04Z"},{"alias_kind":"pith_short_12","alias_value":"VFGGZ6U76UY7","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"VFGGZ6U76UY7JUBG","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"VFGGZ6U7","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:51339c07126a9e14cca4bb637d2dfcf38d0819d35b52d208db2b5d3f413905af","target":"graph","created_at":"2026-05-18T03:44:04Z","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 study Low-Density Parity-Check (LDPC) codes with iterative decoding on block-fading (BF) Relay Channels. We consider two users that employ coded cooperation, a variant of decode-and-forward with a smaller outage probability than the latter. An outage probability analysis for discrete constellations shows that full diversity can be achieved only when the coding rate does not exceed a maximum value that depends on the level of cooperation. We derive a new code structure by extending the previously published full-diversity root-LDPC code, designed for the BF point-to-point channel, to exhibit ","authors_text":"Dieter Duyck, Joseph J. Boutros, Marc Moeneclaey","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-09T09:42:24Z","title":"Low-Density Graph Codes for slow fading Relay Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.1502","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:f37fe1851a0619753ab48e1caa79c953138c8fd0888c83566dc8c8d9cc7702a0","target":"record","created_at":"2026-05-18T03:44:04Z","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":"17fe9dd7c58353227b91c70eadfc37ee8781c08d2aa7723648074e2dcd7e9270","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-03-09T09:42:24Z","title_canon_sha256":"1fdca0c9be2bb687118a04b9e0e301e4d3da91b8ca9aa1574feaebbf06af44f8"},"schema_version":"1.0","source":{"id":"0903.1502","kind":"arxiv","version":2}},"canonical_sha256":"a94c6cfa9ff531f4d026257a50a7ce3b712c6142f3576ea4f113af721e308819","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a94c6cfa9ff531f4d026257a50a7ce3b712c6142f3576ea4f113af721e308819","first_computed_at":"2026-05-18T03:44:04.873915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:04.873915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RbRnYb+HZSQALUsYiD85LuGWIPA/pIIkmvhi7kD/PNEXd+h0YliqgGi8kE+idGE/4PBEg4zovNb7ETEq3tUAAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:04.874787Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.1502","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f37fe1851a0619753ab48e1caa79c953138c8fd0888c83566dc8c8d9cc7702a0","sha256:51339c07126a9e14cca4bb637d2dfcf38d0819d35b52d208db2b5d3f413905af"],"state_sha256":"4876ac8cd0d6bd09f3395e6b75ea34ddb9e837fdea2cce0f053f6184d1bb0185"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5gjon65U1zqSr/9NXvNk6/v2EhYxB2n6Xl08CxOT0RrCQi4nNd098v/pXY2VBEUx7tE0LSKveUk/FA+zLCJAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T05:28:01.642476Z","bundle_sha256":"4d90f0f6f378a6e088311c86682b13421bf642ec66081b95275fc44fd27eab22"}}