{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VKWO2QSARTY2FJDJNQ3BORBCE3","short_pith_number":"pith:VKWO2QSA","canonical_record":{"source":{"id":"1508.00680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T07:03:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4525ee48aaf93a61885e47bc5be76f688a9fcac54a02c29771b55b3896cf0daf","abstract_canon_sha256":"7fb1175c9ccdea2f24a21c02f3d6181bc15936392d3f99b5d9aed51ace494ef4"},"schema_version":"1.0"},"canonical_sha256":"aaaced42408cf1a2a4696c3617442226c31b5ee635ad4aec7840ea0a39ae392f","source":{"kind":"arxiv","id":"1508.00680","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00680","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00680v1","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00680","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"pith_short_12","alias_value":"VKWO2QSARTY2","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VKWO2QSARTY2FJDJ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VKWO2QSA","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VKWO2QSARTY2FJDJNQ3BORBCE3","target":"record","payload":{"canonical_record":{"source":{"id":"1508.00680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T07:03:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4525ee48aaf93a61885e47bc5be76f688a9fcac54a02c29771b55b3896cf0daf","abstract_canon_sha256":"7fb1175c9ccdea2f24a21c02f3d6181bc15936392d3f99b5d9aed51ace494ef4"},"schema_version":"1.0"},"canonical_sha256":"aaaced42408cf1a2a4696c3617442226c31b5ee635ad4aec7840ea0a39ae392f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:53.697149Z","signature_b64":"Zr5popdh4oL9Ycmoz1liSbF+lv190kqLlwtAEDlsyvN+3myX2uAKFrvg4hXSx5urJdkeB4EHFmuL8si40EwaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aaaced42408cf1a2a4696c3617442226c31b5ee635ad4aec7840ea0a39ae392f","last_reissued_at":"2026-05-18T01:35:53.696641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:53.696641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.00680","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-18T01:35:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+p+MANcHJc0nWYR1TuVqOBZ1tzRhoktEQcYssX6dJLSjuU856fGoeRugELNtslMJp+Vhl+c9qZFMSXmMctSkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:50:38.240615Z"},"content_sha256":"4055821e233d061721ea06bb2c7f11633d04b61d4e110c64d869a6c8fceab4e0","schema_version":"1.0","event_id":"sha256:4055821e233d061721ea06bb2c7f11633d04b61d4e110c64d869a6c8fceab4e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VKWO2QSARTY2FJDJNQ3BORBCE3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative detection and decoding for SCMA systems with LDPC codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baicen Xiao, Bin Xia, Hui Liu, Kexin Xiao, Shutian Zhang, Zhiyong Chen","submitted_at":"2015-08-04T07:03:05Z","abstract_excerpt":"Sparse code multiple access (SCMA) is a promising multiplexing approach to achieve high system capacity. In this paper, we develop a novel iterative detection and decoding scheme for SCMA systems combined with Low-density Parity-check (LDPC) decoding. In particular, we decompose the output of the message passing algorithm (MPA) based SCMA multiuser detection into intrinsic part and prior part. Then we design a joint detection and decoding scheme which iteratively exchanges the intrinsic information between the detector and the decoder, yielding a satisfied performance gain. Moreover, the propo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00680","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-18T01:35:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UVeyBZChxlRFj22D60J9Nz0PwPn3oFVGxShS+AIQR73ezOvYyW8YPasR6iJ/cdQK8xlcHLAP/AyRyDQ8CUPyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:50:38.241308Z"},"content_sha256":"830897ca041d0597066f7089889c3f9780d88957b5202d38bfb9501aa41f8053","schema_version":"1.0","event_id":"sha256:830897ca041d0597066f7089889c3f9780d88957b5202d38bfb9501aa41f8053"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VKWO2QSARTY2FJDJNQ3BORBCE3/bundle.json","state_url":"https://pith.science/pith/VKWO2QSARTY2FJDJNQ3BORBCE3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VKWO2QSARTY2FJDJNQ3BORBCE3/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-30T23:50:38Z","links":{"resolver":"https://pith.science/pith/VKWO2QSARTY2FJDJNQ3BORBCE3","bundle":"https://pith.science/pith/VKWO2QSARTY2FJDJNQ3BORBCE3/bundle.json","state":"https://pith.science/pith/VKWO2QSARTY2FJDJNQ3BORBCE3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VKWO2QSARTY2FJDJNQ3BORBCE3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VKWO2QSARTY2FJDJNQ3BORBCE3","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":"7fb1175c9ccdea2f24a21c02f3d6181bc15936392d3f99b5d9aed51ace494ef4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T07:03:05Z","title_canon_sha256":"4525ee48aaf93a61885e47bc5be76f688a9fcac54a02c29771b55b3896cf0daf"},"schema_version":"1.0","source":{"id":"1508.00680","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00680","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00680v1","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00680","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"pith_short_12","alias_value":"VKWO2QSARTY2","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VKWO2QSARTY2FJDJ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VKWO2QSA","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:830897ca041d0597066f7089889c3f9780d88957b5202d38bfb9501aa41f8053","target":"graph","created_at":"2026-05-18T01:35:53Z","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":"Sparse code multiple access (SCMA) is a promising multiplexing approach to achieve high system capacity. In this paper, we develop a novel iterative detection and decoding scheme for SCMA systems combined with Low-density Parity-check (LDPC) decoding. In particular, we decompose the output of the message passing algorithm (MPA) based SCMA multiuser detection into intrinsic part and prior part. Then we design a joint detection and decoding scheme which iteratively exchanges the intrinsic information between the detector and the decoder, yielding a satisfied performance gain. Moreover, the propo","authors_text":"Baicen Xiao, Bin Xia, Hui Liu, Kexin Xiao, Shutian Zhang, Zhiyong Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T07:03:05Z","title":"Iterative detection and decoding for SCMA systems with LDPC codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00680","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:4055821e233d061721ea06bb2c7f11633d04b61d4e110c64d869a6c8fceab4e0","target":"record","created_at":"2026-05-18T01:35:53Z","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":"7fb1175c9ccdea2f24a21c02f3d6181bc15936392d3f99b5d9aed51ace494ef4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T07:03:05Z","title_canon_sha256":"4525ee48aaf93a61885e47bc5be76f688a9fcac54a02c29771b55b3896cf0daf"},"schema_version":"1.0","source":{"id":"1508.00680","kind":"arxiv","version":1}},"canonical_sha256":"aaaced42408cf1a2a4696c3617442226c31b5ee635ad4aec7840ea0a39ae392f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aaaced42408cf1a2a4696c3617442226c31b5ee635ad4aec7840ea0a39ae392f","first_computed_at":"2026-05-18T01:35:53.696641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:53.696641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zr5popdh4oL9Ycmoz1liSbF+lv190kqLlwtAEDlsyvN+3myX2uAKFrvg4hXSx5urJdkeB4EHFmuL8si40EwaAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:53.697149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.00680","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4055821e233d061721ea06bb2c7f11633d04b61d4e110c64d869a6c8fceab4e0","sha256:830897ca041d0597066f7089889c3f9780d88957b5202d38bfb9501aa41f8053"],"state_sha256":"835b9c762aa530eef304e35816297157b280a37113febfd155d5c298b595f1a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+wDnY1wn5Z6fUcAavRVUUXZCqYmZUSwCgLO4wwJ+sC6LPmdYnhpBagGrfknXfMkw3KF9XiN0aYW86+Z2r11Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:50:38.245195Z","bundle_sha256":"7b47f7f0c0cebbdb58f5f4ea6e52eb37efd022c21d0ea1c4180ef7d39e0cb666"}}