{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N62AIMJKPZNCFSHUHTITCXR6IP","short_pith_number":"pith:N62AIMJK","schema_version":"1.0","canonical_sha256":"6fb404312a7e5a22c8f43cd1315e3e43fc92cb7deeb922f4ed2c7ef7043cd260","source":{"kind":"arxiv","id":"1804.00180","version":1},"attestation_state":"computed","paper":{"title":"Efficient Sparse Code Multiple Access Decoder Based on Deterministic Message Passing Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"2, (2) Quantum Information Center, 3), (3) National Mobile Communications Research Laboratory, (4) Shanghai Institute for Advanced Communications, Chao Yang (1, China, China), Chuan Zhang (1, Data Science, Shanghai, Shanghai University, Shunqing Zhang (4), Signal-processing (LEADS), Southeast University, Wei Xu (3), Xiaohu You (3) ((1) Lab of Efficient Architectures for Digital-communication, Zaichen Zhang (2","submitted_at":"2018-03-31T14:51:08Z","abstract_excerpt":"Being an effective non-orthogonal multiple access (NOMA) technique, sparse code multiple access (SCMA) is promising for future wireless communication. Compared with orthogonal techniques, SCMA enjoys higher overloading tolerance and lower complexity because of its sparsity. In this paper, based on deterministic message passing algorithm (DMPA), algorithmic simplifications such as domain changing and probability approximation are applied for SCMA decoding. Early termination, adaptive decoding, and initial noise reduction are also employed for faster convergence and better performance. Numerical"},"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":"1804.00180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-31T14:51:08Z","cross_cats_sorted":["cs.AR","eess.SP","math.IT"],"title_canon_sha256":"ad2d12ff4514e1574ea04cfe400aa2b88c8404cbe3d989b2ec01194c1fbeebef","abstract_canon_sha256":"368fdfedb78a85208b6d968686b4a9fa626d1d306198a53af1ce04f1d7b588a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:38.108101Z","signature_b64":"hZX/2aH9vC01QZ1UKiTL6SMG0LdcafY+sEdzMEDgas4277do3XHuez7YAZzkPJ+zc5xEXOoec4Qn5bPCEO2GAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fb404312a7e5a22c8f43cd1315e3e43fc92cb7deeb922f4ed2c7ef7043cd260","last_reissued_at":"2026-05-18T00:19:38.107357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:38.107357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Sparse Code Multiple Access Decoder Based on Deterministic Message Passing Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"2, (2) Quantum Information Center, 3), (3) National Mobile Communications Research Laboratory, (4) Shanghai Institute for Advanced Communications, Chao Yang (1, China, China), Chuan Zhang (1, Data Science, Shanghai, Shanghai University, Shunqing Zhang (4), Signal-processing (LEADS), Southeast University, Wei Xu (3), Xiaohu You (3) ((1) Lab of Efficient Architectures for Digital-communication, Zaichen Zhang (2","submitted_at":"2018-03-31T14:51:08Z","abstract_excerpt":"Being an effective non-orthogonal multiple access (NOMA) technique, sparse code multiple access (SCMA) is promising for future wireless communication. Compared with orthogonal techniques, SCMA enjoys higher overloading tolerance and lower complexity because of its sparsity. In this paper, based on deterministic message passing algorithm (DMPA), algorithmic simplifications such as domain changing and probability approximation are applied for SCMA decoding. Early termination, adaptive decoding, and initial noise reduction are also employed for faster convergence and better performance. Numerical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00180","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":"1804.00180","created_at":"2026-05-18T00:19:38.107480+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00180v1","created_at":"2026-05-18T00:19:38.107480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00180","created_at":"2026-05-18T00:19:38.107480+00:00"},{"alias_kind":"pith_short_12","alias_value":"N62AIMJKPZNC","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N62AIMJKPZNCFSHU","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N62AIMJK","created_at":"2026-05-18T12:32:40.477152+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/N62AIMJKPZNCFSHUHTITCXR6IP","json":"https://pith.science/pith/N62AIMJKPZNCFSHUHTITCXR6IP.json","graph_json":"https://pith.science/api/pith-number/N62AIMJKPZNCFSHUHTITCXR6IP/graph.json","events_json":"https://pith.science/api/pith-number/N62AIMJKPZNCFSHUHTITCXR6IP/events.json","paper":"https://pith.science/paper/N62AIMJK"},"agent_actions":{"view_html":"https://pith.science/pith/N62AIMJKPZNCFSHUHTITCXR6IP","download_json":"https://pith.science/pith/N62AIMJKPZNCFSHUHTITCXR6IP.json","view_paper":"https://pith.science/paper/N62AIMJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00180&json=true","fetch_graph":"https://pith.science/api/pith-number/N62AIMJKPZNCFSHUHTITCXR6IP/graph.json","fetch_events":"https://pith.science/api/pith-number/N62AIMJKPZNCFSHUHTITCXR6IP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N62AIMJKPZNCFSHUHTITCXR6IP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N62AIMJKPZNCFSHUHTITCXR6IP/action/storage_attestation","attest_author":"https://pith.science/pith/N62AIMJKPZNCFSHUHTITCXR6IP/action/author_attestation","sign_citation":"https://pith.science/pith/N62AIMJKPZNCFSHUHTITCXR6IP/action/citation_signature","submit_replication":"https://pith.science/pith/N62AIMJKPZNCFSHUHTITCXR6IP/action/replication_record"}},"created_at":"2026-05-18T00:19:38.107480+00:00","updated_at":"2026-05-18T00:19:38.107480+00:00"}