{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IOI36XFZ2SZPIWIYVUQUNFBGUO","short_pith_number":"pith:IOI36XFZ","canonical_record":{"source":{"id":"1701.03840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-13T22:15:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d64eb4a5ea3e8f8be3bb232cfef6c95ebb3bfca51c83e2d0c4f273821ac70c57","abstract_canon_sha256":"99e1aa195ad1bf52b1541a0b8556a1dec1c677dba077fbfa0db885ad9a375787"},"schema_version":"1.0"},"canonical_sha256":"4391bf5cb9d4b2f45918ad21469426a3aa8da720c2f1dccd22a4d9322aad1e3e","source":{"kind":"arxiv","id":"1701.03840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03840","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03840v1","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03840","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"pith_short_12","alias_value":"IOI36XFZ2SZP","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IOI36XFZ2SZPIWIY","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IOI36XFZ","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IOI36XFZ2SZPIWIYVUQUNFBGUO","target":"record","payload":{"canonical_record":{"source":{"id":"1701.03840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-13T22:15:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d64eb4a5ea3e8f8be3bb232cfef6c95ebb3bfca51c83e2d0c4f273821ac70c57","abstract_canon_sha256":"99e1aa195ad1bf52b1541a0b8556a1dec1c677dba077fbfa0db885ad9a375787"},"schema_version":"1.0"},"canonical_sha256":"4391bf5cb9d4b2f45918ad21469426a3aa8da720c2f1dccd22a4d9322aad1e3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:48.797357Z","signature_b64":"YUiHg78KGC82g+6B/Kp4StVlz0ASBNOz9r0MI4pcMqfQ2KGotCHE6jd21rbt3pP1r8VPv3Tr0S7rTXPi8JtfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4391bf5cb9d4b2f45918ad21469426a3aa8da720c2f1dccd22a4d9322aad1e3e","last_reissued_at":"2026-05-18T00:52:48.796678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:48.796678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.03840","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:52:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4by+/nf3w7bRL1SWcD4CnwoLd6YtbOSQECXTG2gYxFcvihggp2rnFpmdGb8xMdbIdJWr379VMd2QKbW3/OqrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T10:46:58.878535Z"},"content_sha256":"6e26d6abd06098f164baf9104342036879cdaf9afda0da42d719a0baba3fb6ec","schema_version":"1.0","event_id":"sha256:6e26d6abd06098f164baf9104342036879cdaf9afda0da42d719a0baba3fb6ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IOI36XFZ2SZPIWIYVUQUNFBGUO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance Analysis of Low-Density Parity-Check Codes over 2D Interference Channels via Density Evolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Yao, Kah Chan Teh, Kwok Hung Li","submitted_at":"2017-01-13T22:15:42Z","abstract_excerpt":"The theoretical analysis of detection and decoding of low-density parity-check (LDPC) codes transmitted over channels with two-dimensional (2D) interference and additive white Gaussian noise (AWGN) is provided in this paper. The detection and decoding system adopts the joint iterative detection and decoding scheme (JIDDS) in which the log-domain sum-product algorithm is adopted to decode the LDPC codes. The graph representations of the JIDDS are explained. Using the graph representations, we prove that the message-flow neighborhood of the detection and decoding system will be tree-like for a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03840","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:52:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ND0RXqTKtT7XZfb5U+OODlzvoaNXGG+rep+CuD9jh3Mx34mqPytNzGc9TazX0KWmJotLt4qDVhrkM51wCz/QAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T10:46:58.878887Z"},"content_sha256":"efc966489283d35edb5a2f544d97f6b71d35e7634cf513a5cfe2daf27fb18fce","schema_version":"1.0","event_id":"sha256:efc966489283d35edb5a2f544d97f6b71d35e7634cf513a5cfe2daf27fb18fce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IOI36XFZ2SZPIWIYVUQUNFBGUO/bundle.json","state_url":"https://pith.science/pith/IOI36XFZ2SZPIWIYVUQUNFBGUO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IOI36XFZ2SZPIWIYVUQUNFBGUO/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-29T10:46:58Z","links":{"resolver":"https://pith.science/pith/IOI36XFZ2SZPIWIYVUQUNFBGUO","bundle":"https://pith.science/pith/IOI36XFZ2SZPIWIYVUQUNFBGUO/bundle.json","state":"https://pith.science/pith/IOI36XFZ2SZPIWIYVUQUNFBGUO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IOI36XFZ2SZPIWIYVUQUNFBGUO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IOI36XFZ2SZPIWIYVUQUNFBGUO","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":"99e1aa195ad1bf52b1541a0b8556a1dec1c677dba077fbfa0db885ad9a375787","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-13T22:15:42Z","title_canon_sha256":"d64eb4a5ea3e8f8be3bb232cfef6c95ebb3bfca51c83e2d0c4f273821ac70c57"},"schema_version":"1.0","source":{"id":"1701.03840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03840","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03840v1","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03840","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"pith_short_12","alias_value":"IOI36XFZ2SZP","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IOI36XFZ2SZPIWIY","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IOI36XFZ","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:efc966489283d35edb5a2f544d97f6b71d35e7634cf513a5cfe2daf27fb18fce","target":"graph","created_at":"2026-05-18T00:52:48Z","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":"The theoretical analysis of detection and decoding of low-density parity-check (LDPC) codes transmitted over channels with two-dimensional (2D) interference and additive white Gaussian noise (AWGN) is provided in this paper. The detection and decoding system adopts the joint iterative detection and decoding scheme (JIDDS) in which the log-domain sum-product algorithm is adopted to decode the LDPC codes. The graph representations of the JIDDS are explained. Using the graph representations, we prove that the message-flow neighborhood of the detection and decoding system will be tree-like for a s","authors_text":"Jun Yao, Kah Chan Teh, Kwok Hung Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-13T22:15:42Z","title":"Performance Analysis of Low-Density Parity-Check Codes over 2D Interference Channels via Density Evolution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03840","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:6e26d6abd06098f164baf9104342036879cdaf9afda0da42d719a0baba3fb6ec","target":"record","created_at":"2026-05-18T00:52:48Z","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":"99e1aa195ad1bf52b1541a0b8556a1dec1c677dba077fbfa0db885ad9a375787","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-13T22:15:42Z","title_canon_sha256":"d64eb4a5ea3e8f8be3bb232cfef6c95ebb3bfca51c83e2d0c4f273821ac70c57"},"schema_version":"1.0","source":{"id":"1701.03840","kind":"arxiv","version":1}},"canonical_sha256":"4391bf5cb9d4b2f45918ad21469426a3aa8da720c2f1dccd22a4d9322aad1e3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4391bf5cb9d4b2f45918ad21469426a3aa8da720c2f1dccd22a4d9322aad1e3e","first_computed_at":"2026-05-18T00:52:48.796678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:48.796678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YUiHg78KGC82g+6B/Kp4StVlz0ASBNOz9r0MI4pcMqfQ2KGotCHE6jd21rbt3pP1r8VPv3Tr0S7rTXPi8JtfAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:48.797357Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e26d6abd06098f164baf9104342036879cdaf9afda0da42d719a0baba3fb6ec","sha256:efc966489283d35edb5a2f544d97f6b71d35e7634cf513a5cfe2daf27fb18fce"],"state_sha256":"00c9137a8d066e9087bc0d224cbaa6ca3129d06657935419c036d51f87711700"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pGzGniWgB7vFlJ4JmT2dgIPdpz+kAqJEKZoQbXH3Tu07zgSTD7SQs03C65cddJL9rYUW0Bf4sGCBpKD8bS2bCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T10:46:58.881082Z","bundle_sha256":"e47e0299364187cac9effd52897e2064d1589f0d9b865c255c1eb63be6bfbb69"}}