{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:42GBNEZHNQ456EROKZJ3RUD55H","short_pith_number":"pith:42GBNEZH","canonical_record":{"source":{"id":"1302.4516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-19T04:54:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b7e782e1c4db6ab37369f272f521605f45af0f995d10b86b3a3d119ea11b548f","abstract_canon_sha256":"10d1f963d06fcf988c6a9f2436a76cf0386ea1af72b47806cd8fd5f841117b42"},"schema_version":"1.0"},"canonical_sha256":"e68c1693276c39df122e5653b8d07de9e98204c9c420de534996c7e49e9037b5","source":{"kind":"arxiv","id":"1302.4516","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4516","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4516v1","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4516","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"42GBNEZHNQ45","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"42GBNEZHNQ456ERO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"42GBNEZH","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:42GBNEZHNQ456EROKZJ3RUD55H","target":"record","payload":{"canonical_record":{"source":{"id":"1302.4516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-19T04:54:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b7e782e1c4db6ab37369f272f521605f45af0f995d10b86b3a3d119ea11b548f","abstract_canon_sha256":"10d1f963d06fcf988c6a9f2436a76cf0386ea1af72b47806cd8fd5f841117b42"},"schema_version":"1.0"},"canonical_sha256":"e68c1693276c39df122e5653b8d07de9e98204c9c420de534996c7e49e9037b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:56.569583Z","signature_b64":"eVT7BNfkpIOesO7ISs4gafKZx8GCPE/oWYHJjm0ZILOCnSfREvbnk062qEJfCZnij0hT3ymnkEqUGLq1ygVWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e68c1693276c39df122e5653b8d07de9e98204c9c420de534996c7e49e9037b5","last_reissued_at":"2026-05-18T00:57:56.569195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:56.569195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.4516","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:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tQRgqQzGuyFaC2pJ8zAcasD/F4ChPEZkqAtrXd9/m/gwxOOTb67l/OXPii3DD9JYIPAODiuFVCxKfVjX7uKpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T10:30:03.224984Z"},"content_sha256":"a051c7a4c7aa61089e8caf0a121a424d57923ec0d73a948345f288d6ce444edb","schema_version":"1.0","event_id":"sha256:a051c7a4c7aa61089e8caf0a121a424d57923ec0d73a948345f288d6ce444edb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:42GBNEZHNQ456EROKZJ3RUD55H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bilayer Protograph Codes for Half-Duplex Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aria Nosratinia, Dariush Divsalar, Thuy Van Nguyen","submitted_at":"2013-02-19T04:54:35Z","abstract_excerpt":"Despite encouraging advances in the design of relay codes, several important challenges remain. Many of the existing LDPC relay codes are tightly optimized for fixed channel conditions and not easily adapted without extensive re-optimization of the code. Some have high encoding complexity and some need long block lengths to approach capacity. This paper presents a high-performance protograph-based LDPC coding scheme for the half-duplex relay channel that addresses simultaneously several important issues: structured coding that permits easy design, low encoding complexity, embedded structure fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4516","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:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2DGZgh14loVl1BHIJlSK+walxjjcZhP6xNSXXB9sLNvHJ/eb3WJYBGJ49gc1hcL+pJycL6y2TAO7iIeWukcUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T10:30:03.225667Z"},"content_sha256":"06341042bfef19824f792b413cfb90b37233a8193d882b660fd4b69ed531998f","schema_version":"1.0","event_id":"sha256:06341042bfef19824f792b413cfb90b37233a8193d882b660fd4b69ed531998f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42GBNEZHNQ456EROKZJ3RUD55H/bundle.json","state_url":"https://pith.science/pith/42GBNEZHNQ456EROKZJ3RUD55H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42GBNEZHNQ456EROKZJ3RUD55H/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-06T10:30:03Z","links":{"resolver":"https://pith.science/pith/42GBNEZHNQ456EROKZJ3RUD55H","bundle":"https://pith.science/pith/42GBNEZHNQ456EROKZJ3RUD55H/bundle.json","state":"https://pith.science/pith/42GBNEZHNQ456EROKZJ3RUD55H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42GBNEZHNQ456EROKZJ3RUD55H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:42GBNEZHNQ456EROKZJ3RUD55H","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":"10d1f963d06fcf988c6a9f2436a76cf0386ea1af72b47806cd8fd5f841117b42","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-19T04:54:35Z","title_canon_sha256":"b7e782e1c4db6ab37369f272f521605f45af0f995d10b86b3a3d119ea11b548f"},"schema_version":"1.0","source":{"id":"1302.4516","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4516","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4516v1","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4516","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"42GBNEZHNQ45","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"42GBNEZHNQ456ERO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"42GBNEZH","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:06341042bfef19824f792b413cfb90b37233a8193d882b660fd4b69ed531998f","target":"graph","created_at":"2026-05-18T00:57:56Z","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":"Despite encouraging advances in the design of relay codes, several important challenges remain. Many of the existing LDPC relay codes are tightly optimized for fixed channel conditions and not easily adapted without extensive re-optimization of the code. Some have high encoding complexity and some need long block lengths to approach capacity. This paper presents a high-performance protograph-based LDPC coding scheme for the half-duplex relay channel that addresses simultaneously several important issues: structured coding that permits easy design, low encoding complexity, embedded structure fo","authors_text":"Aria Nosratinia, Dariush Divsalar, Thuy Van Nguyen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-19T04:54:35Z","title":"Bilayer Protograph Codes for Half-Duplex Relay Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4516","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:a051c7a4c7aa61089e8caf0a121a424d57923ec0d73a948345f288d6ce444edb","target":"record","created_at":"2026-05-18T00:57:56Z","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":"10d1f963d06fcf988c6a9f2436a76cf0386ea1af72b47806cd8fd5f841117b42","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-19T04:54:35Z","title_canon_sha256":"b7e782e1c4db6ab37369f272f521605f45af0f995d10b86b3a3d119ea11b548f"},"schema_version":"1.0","source":{"id":"1302.4516","kind":"arxiv","version":1}},"canonical_sha256":"e68c1693276c39df122e5653b8d07de9e98204c9c420de534996c7e49e9037b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e68c1693276c39df122e5653b8d07de9e98204c9c420de534996c7e49e9037b5","first_computed_at":"2026-05-18T00:57:56.569195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:56.569195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eVT7BNfkpIOesO7ISs4gafKZx8GCPE/oWYHJjm0ZILOCnSfREvbnk062qEJfCZnij0hT3ymnkEqUGLq1ygVWDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:56.569583Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4516","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a051c7a4c7aa61089e8caf0a121a424d57923ec0d73a948345f288d6ce444edb","sha256:06341042bfef19824f792b413cfb90b37233a8193d882b660fd4b69ed531998f"],"state_sha256":"57f24142a65fa28b25023b411365f8d0cb6150f43d5ffbc0e41e21e3712f116d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bgxthvn8P6UwaJ3/r9aHBVu+tyHMCjfO5iMz8CGagl5jUddaPROi2XzfWRtUkaCJ6+NzW9dPZI8d24oXQRIrBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T10:30:03.230086Z","bundle_sha256":"b5257fd77f8ad3732bf84f208145e7785f34f4e2579ac174b5056cb3ea6fe2b2"}}