{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:ROGUTXRQEEHXIYT5JFKSZUOEOQ","short_pith_number":"pith:ROGUTXRQ","canonical_record":{"source":{"id":"0906.2819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-15T23:09:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"228a23caa87de8b8cf0b467faa88998ea99c7ed82014b904019fd77cd98e240d","abstract_canon_sha256":"abf9e2d6790a70886850a4fcc3bb46a9073f9d3dfbc2ec540961d51332363bac"},"schema_version":"1.0"},"canonical_sha256":"8b8d49de30210f74627d49552cd1c4740389b57f96a0f64517a20b3b55f8cdc1","source":{"kind":"arxiv","id":"0906.2819","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.2819","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0906.2819v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.2819","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"ROGUTXRQEEHX","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"ROGUTXRQEEHXIYT5","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"ROGUTXRQ","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:ROGUTXRQEEHXIYT5JFKSZUOEOQ","target":"record","payload":{"canonical_record":{"source":{"id":"0906.2819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-15T23:09:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"228a23caa87de8b8cf0b467faa88998ea99c7ed82014b904019fd77cd98e240d","abstract_canon_sha256":"abf9e2d6790a70886850a4fcc3bb46a9073f9d3dfbc2ec540961d51332363bac"},"schema_version":"1.0"},"canonical_sha256":"8b8d49de30210f74627d49552cd1c4740389b57f96a0f64517a20b3b55f8cdc1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.149212Z","signature_b64":"MHcGkRN7/2uFtAZFJciN6cD/ZK/e4dkK/eZBNC5cfrtM9FIklP48IodMmiakMxkAOTuMRj27zDmLVBwnKIGbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b8d49de30210f74627d49552cd1c4740389b57f96a0f64517a20b3b55f8cdc1","last_reissued_at":"2026-05-18T00:57:58.148630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.148630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0906.2819","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":"OqsjXXsmgVKdvIH2fdBrVY5iSHgCEIkKqeeJ/HECbGk4NuX/NRMjM2vOUjhEanLkNkj01bfaPWQLCTI9BrHzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:15:00.617304Z"},"content_sha256":"0189351fc85fbedc61931bb673e970bc7b3d3d85b4d5884973835a79754bb531","schema_version":"1.0","event_id":"sha256:0189351fc85fbedc61931bb673e970bc7b3d3d85b4d5884973835a79754bb531"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:ROGUTXRQEEHXIYT5JFKSZUOEOQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Disjoint LDPC Coding for Gaussian Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mahdi Ramezani, Masoud Ardakani","submitted_at":"2009-06-15T23:09:04Z","abstract_excerpt":"Low-density parity-check (LDPC) codes have been used for communication over a two-user Gaussian broadcast channel. It has been shown in the literature that the optimal decoding of such system requires joint decoding of both user messages at each user. Also, a joint code design procedure should be performed. We propose a method which uses a novel labeling strategy and is based on the idea behind the bit-interleaved coded modulation. This method does not require joint decoding and/or joint code optimization. Thus, it reduces the overall complexity of near-capacity coding in broadcast channels. F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.2819","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":"/rY525asys05BKsj6/aErpz4ndeIfMz2/Wq+R73CuNudU+AHucVJjhYMIe1LROPi6Ma1nXUURdaSAB06qcbBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:15:00.617943Z"},"content_sha256":"145ec99309aeded776ba6ad955c38c42130335aeaff46f84216164a4b0000722","schema_version":"1.0","event_id":"sha256:145ec99309aeded776ba6ad955c38c42130335aeaff46f84216164a4b0000722"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROGUTXRQEEHXIYT5JFKSZUOEOQ/bundle.json","state_url":"https://pith.science/pith/ROGUTXRQEEHXIYT5JFKSZUOEOQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROGUTXRQEEHXIYT5JFKSZUOEOQ/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-26T01:15:00Z","links":{"resolver":"https://pith.science/pith/ROGUTXRQEEHXIYT5JFKSZUOEOQ","bundle":"https://pith.science/pith/ROGUTXRQEEHXIYT5JFKSZUOEOQ/bundle.json","state":"https://pith.science/pith/ROGUTXRQEEHXIYT5JFKSZUOEOQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROGUTXRQEEHXIYT5JFKSZUOEOQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:ROGUTXRQEEHXIYT5JFKSZUOEOQ","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":"abf9e2d6790a70886850a4fcc3bb46a9073f9d3dfbc2ec540961d51332363bac","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-15T23:09:04Z","title_canon_sha256":"228a23caa87de8b8cf0b467faa88998ea99c7ed82014b904019fd77cd98e240d"},"schema_version":"1.0","source":{"id":"0906.2819","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.2819","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0906.2819v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.2819","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"ROGUTXRQEEHX","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"ROGUTXRQEEHXIYT5","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"ROGUTXRQ","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:145ec99309aeded776ba6ad955c38c42130335aeaff46f84216164a4b0000722","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":"Low-density parity-check (LDPC) codes have been used for communication over a two-user Gaussian broadcast channel. It has been shown in the literature that the optimal decoding of such system requires joint decoding of both user messages at each user. Also, a joint code design procedure should be performed. We propose a method which uses a novel labeling strategy and is based on the idea behind the bit-interleaved coded modulation. This method does not require joint decoding and/or joint code optimization. Thus, it reduces the overall complexity of near-capacity coding in broadcast channels. F","authors_text":"Mahdi Ramezani, Masoud Ardakani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-15T23:09:04Z","title":"Disjoint LDPC Coding for Gaussian Broadcast Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.2819","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:0189351fc85fbedc61931bb673e970bc7b3d3d85b4d5884973835a79754bb531","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":"abf9e2d6790a70886850a4fcc3bb46a9073f9d3dfbc2ec540961d51332363bac","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-15T23:09:04Z","title_canon_sha256":"228a23caa87de8b8cf0b467faa88998ea99c7ed82014b904019fd77cd98e240d"},"schema_version":"1.0","source":{"id":"0906.2819","kind":"arxiv","version":1}},"canonical_sha256":"8b8d49de30210f74627d49552cd1c4740389b57f96a0f64517a20b3b55f8cdc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b8d49de30210f74627d49552cd1c4740389b57f96a0f64517a20b3b55f8cdc1","first_computed_at":"2026-05-18T00:57:58.148630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:58.148630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MHcGkRN7/2uFtAZFJciN6cD/ZK/e4dkK/eZBNC5cfrtM9FIklP48IodMmiakMxkAOTuMRj27zDmLVBwnKIGbDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:58.149212Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.2819","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0189351fc85fbedc61931bb673e970bc7b3d3d85b4d5884973835a79754bb531","sha256:145ec99309aeded776ba6ad955c38c42130335aeaff46f84216164a4b0000722"],"state_sha256":"9b1a011bb7ebb201fdf515c0262be8051bdb738cbd182193355b250099539d1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gcnnas2nZFOkAbhGiKNTvi5CUehwKIlMeu01bWOneWWQLRSCB8krZAm4lXrPp8cQbBSdj5YWkL4ffci/ZX8gAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:15:00.621617Z","bundle_sha256":"121fb05c38af69456b106f06f64482dcde669ac6578397b5a0f7af6d28231bfc"}}