{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KAMXT2FU3UBOKT6E47ZJCVM2S3","short_pith_number":"pith:KAMXT2FU","schema_version":"1.0","canonical_sha256":"501979e8b4dd02e54fc4e7f291559a96d26206f7d7cc43fa18fc3bc24cc5a209","source":{"kind":"arxiv","id":"1508.00679","version":1},"attestation_state":"computed","paper":{"title":"Simplified Multiuser Detection for SCMA with Sum-Product Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baicen Xiao, Bin Xia, Kexin Xiao, Shutian Zhang, Zhiyong Chen","submitted_at":"2015-08-04T06:48:00Z","abstract_excerpt":"Sparse code multiple access (SCMA) is a novel non-orthogonal multiple access technique, which fully exploits the shaping gain of multi-dimensional codewords. However, the lack of simplified multiuser detection algorithm prevents further implementation due to the inherently high computation complexity. In this paper, general SCMA detector algorithms based on Sum-product algorithm are elaborated. Then two improved algorithms are proposed, which simplify the detection structure and curtail exponent operations quantitatively in logarithm domain. Furthermore, to analyze these detection algorithms f"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1508.00679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T06:48:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6508ef5438a0a3006d279f9daeeb40bb612f60a417e05a1e52bb7dc1454135aa","abstract_canon_sha256":"4c00fe994a0581af512dae1c79d1e179900616589e28a59afbf183766177c10f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:53.705084Z","signature_b64":"y+5g/kEfhBSMdt/N7fjCqylCI+sQ+MfLQjx+na+DOYyD83kMkGCnd+3ABCQMlbWI9csK8qJFrsEeLspm5SQTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"501979e8b4dd02e54fc4e7f291559a96d26206f7d7cc43fa18fc3bc24cc5a209","last_reissued_at":"2026-05-18T01:35:53.704430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:53.704430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplified Multiuser Detection for SCMA with Sum-Product Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Baicen Xiao, Bin Xia, Kexin Xiao, Shutian Zhang, Zhiyong Chen","submitted_at":"2015-08-04T06:48:00Z","abstract_excerpt":"Sparse code multiple access (SCMA) is a novel non-orthogonal multiple access technique, which fully exploits the shaping gain of multi-dimensional codewords. However, the lack of simplified multiuser detection algorithm prevents further implementation due to the inherently high computation complexity. In this paper, general SCMA detector algorithms based on Sum-product algorithm are elaborated. Then two improved algorithms are proposed, which simplify the detection structure and curtail exponent operations quantitatively in logarithm domain. Furthermore, to analyze these detection algorithms f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00679","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.00679","created_at":"2026-05-18T01:35:53.704526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.00679v1","created_at":"2026-05-18T01:35:53.704526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00679","created_at":"2026-05-18T01:35:53.704526+00:00"},{"alias_kind":"pith_short_12","alias_value":"KAMXT2FU3UBO","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KAMXT2FU3UBOKT6E","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KAMXT2FU","created_at":"2026-05-18T12:29:27.538025+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KAMXT2FU3UBOKT6E47ZJCVM2S3","json":"https://pith.science/pith/KAMXT2FU3UBOKT6E47ZJCVM2S3.json","graph_json":"https://pith.science/api/pith-number/KAMXT2FU3UBOKT6E47ZJCVM2S3/graph.json","events_json":"https://pith.science/api/pith-number/KAMXT2FU3UBOKT6E47ZJCVM2S3/events.json","paper":"https://pith.science/paper/KAMXT2FU"},"agent_actions":{"view_html":"https://pith.science/pith/KAMXT2FU3UBOKT6E47ZJCVM2S3","download_json":"https://pith.science/pith/KAMXT2FU3UBOKT6E47ZJCVM2S3.json","view_paper":"https://pith.science/paper/KAMXT2FU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.00679&json=true","fetch_graph":"https://pith.science/api/pith-number/KAMXT2FU3UBOKT6E47ZJCVM2S3/graph.json","fetch_events":"https://pith.science/api/pith-number/KAMXT2FU3UBOKT6E47ZJCVM2S3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KAMXT2FU3UBOKT6E47ZJCVM2S3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KAMXT2FU3UBOKT6E47ZJCVM2S3/action/storage_attestation","attest_author":"https://pith.science/pith/KAMXT2FU3UBOKT6E47ZJCVM2S3/action/author_attestation","sign_citation":"https://pith.science/pith/KAMXT2FU3UBOKT6E47ZJCVM2S3/action/citation_signature","submit_replication":"https://pith.science/pith/KAMXT2FU3UBOKT6E47ZJCVM2S3/action/replication_record"}},"created_at":"2026-05-18T01:35:53.704526+00:00","updated_at":"2026-05-18T01:35:53.704526+00:00"}