{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S5LRQA2R2UWI7YLY77PEK2YBL4","short_pith_number":"pith:S5LRQA2R","canonical_record":{"source":{"id":"1701.01195","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-05T02:10:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"31ee5c32793cc1b09419dd6e199dc5e96fffd220ef2ab645d993678563983883","abstract_canon_sha256":"42ff918f17c15bdaa1f2d97fad7d41ebf7d36887367cfb3d0343ca0a679fecd8"},"schema_version":"1.0"},"canonical_sha256":"9757180351d52c8fe178ffde456b015f1d00ac2e7b5d571f35158982aba88995","source":{"kind":"arxiv","id":"1701.01195","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01195","created_at":"2026-05-18T00:28:56Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01195v2","created_at":"2026-05-18T00:28:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01195","created_at":"2026-05-18T00:28:56Z"},{"alias_kind":"pith_short_12","alias_value":"S5LRQA2R2UWI","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S5LRQA2R2UWI7YLY","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S5LRQA2R","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S5LRQA2R2UWI7YLY77PEK2YBL4","target":"record","payload":{"canonical_record":{"source":{"id":"1701.01195","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-05T02:10:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"31ee5c32793cc1b09419dd6e199dc5e96fffd220ef2ab645d993678563983883","abstract_canon_sha256":"42ff918f17c15bdaa1f2d97fad7d41ebf7d36887367cfb3d0343ca0a679fecd8"},"schema_version":"1.0"},"canonical_sha256":"9757180351d52c8fe178ffde456b015f1d00ac2e7b5d571f35158982aba88995","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:56.533783Z","signature_b64":"YW4jlsv8kJL7uc7PgTxo+EJ6h2A+qznwd+egKei5wgIT/k/S4gxmwP9y8q/FT1IO3dorJxPCm1wgiDeE6h2XBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9757180351d52c8fe178ffde456b015f1d00ac2e7b5d571f35158982aba88995","last_reissued_at":"2026-05-18T00:28:56.533195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:56.533195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.01195","source_version":2,"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:28:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x+LJTo9D8uwdImD+iIsCWYt75c0i096b8UMarrwn8SLMJVhmXgKcvqAxGi0DvYifUzZg+FksDRnxNy5JJj8gAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:09:32.128500Z"},"content_sha256":"c4a8b548751eb080968764f7271554e087ed98f729d6076a6acfc8921e968b7d","schema_version":"1.0","event_id":"sha256:c4a8b548751eb080968764f7271554e087ed98f729d6076a6acfc8921e968b7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S5LRQA2R2UWI7YLY77PEK2YBL4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low Complexity Receiver for Uplink SCMA System via Expectation Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Meng Cheng, Xiangming Meng, Yan Chen, Yiqun Wu","submitted_at":"2017-01-05T02:10:23Z","abstract_excerpt":"Sparse code multiple access (SCMA) scheme is considered to be one promising non-orthogonal multiple access technology for the future fifth generation (5G) communications. Due to the sparse nature, message passing algorithm (MPA) has been used as the receiver to achieve close to maximum likelihood (ML) detection performance with much lower complexity. However, the complexity order of MPA is still exponential with the size of codebook and the degree of signal superposition on a given resource element. In this paper, we propose a novel low complexity iterative receiver based on expectation propag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01195","kind":"arxiv","version":2},"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:28:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hKeYzefwBeXok/X/IqRV8LEIn4YKUrRJOpflkPBWALfEZ1Aix2xtmQ5791zQtozupp2Es6+KF5ZfCRg2JY9UAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:09:32.128846Z"},"content_sha256":"73c54c28af4fa907c2d974ec2410055776970a0ec605f785318d88380455796f","schema_version":"1.0","event_id":"sha256:73c54c28af4fa907c2d974ec2410055776970a0ec605f785318d88380455796f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5LRQA2R2UWI7YLY77PEK2YBL4/bundle.json","state_url":"https://pith.science/pith/S5LRQA2R2UWI7YLY77PEK2YBL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5LRQA2R2UWI7YLY77PEK2YBL4/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-02T12:09:32Z","links":{"resolver":"https://pith.science/pith/S5LRQA2R2UWI7YLY77PEK2YBL4","bundle":"https://pith.science/pith/S5LRQA2R2UWI7YLY77PEK2YBL4/bundle.json","state":"https://pith.science/pith/S5LRQA2R2UWI7YLY77PEK2YBL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5LRQA2R2UWI7YLY77PEK2YBL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S5LRQA2R2UWI7YLY77PEK2YBL4","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":"42ff918f17c15bdaa1f2d97fad7d41ebf7d36887367cfb3d0343ca0a679fecd8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-05T02:10:23Z","title_canon_sha256":"31ee5c32793cc1b09419dd6e199dc5e96fffd220ef2ab645d993678563983883"},"schema_version":"1.0","source":{"id":"1701.01195","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01195","created_at":"2026-05-18T00:28:56Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01195v2","created_at":"2026-05-18T00:28:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01195","created_at":"2026-05-18T00:28:56Z"},{"alias_kind":"pith_short_12","alias_value":"S5LRQA2R2UWI","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S5LRQA2R2UWI7YLY","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S5LRQA2R","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:73c54c28af4fa907c2d974ec2410055776970a0ec605f785318d88380455796f","target":"graph","created_at":"2026-05-18T00:28:56Z","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) scheme is considered to be one promising non-orthogonal multiple access technology for the future fifth generation (5G) communications. Due to the sparse nature, message passing algorithm (MPA) has been used as the receiver to achieve close to maximum likelihood (ML) detection performance with much lower complexity. However, the complexity order of MPA is still exponential with the size of codebook and the degree of signal superposition on a given resource element. In this paper, we propose a novel low complexity iterative receiver based on expectation propag","authors_text":"Meng Cheng, Xiangming Meng, Yan Chen, Yiqun Wu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-05T02:10:23Z","title":"Low Complexity Receiver for Uplink SCMA System via Expectation Propagation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01195","kind":"arxiv","version":2},"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:c4a8b548751eb080968764f7271554e087ed98f729d6076a6acfc8921e968b7d","target":"record","created_at":"2026-05-18T00:28:56Z","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":"42ff918f17c15bdaa1f2d97fad7d41ebf7d36887367cfb3d0343ca0a679fecd8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-05T02:10:23Z","title_canon_sha256":"31ee5c32793cc1b09419dd6e199dc5e96fffd220ef2ab645d993678563983883"},"schema_version":"1.0","source":{"id":"1701.01195","kind":"arxiv","version":2}},"canonical_sha256":"9757180351d52c8fe178ffde456b015f1d00ac2e7b5d571f35158982aba88995","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9757180351d52c8fe178ffde456b015f1d00ac2e7b5d571f35158982aba88995","first_computed_at":"2026-05-18T00:28:56.533195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:56.533195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YW4jlsv8kJL7uc7PgTxo+EJ6h2A+qznwd+egKei5wgIT/k/S4gxmwP9y8q/FT1IO3dorJxPCm1wgiDeE6h2XBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:56.533783Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.01195","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4a8b548751eb080968764f7271554e087ed98f729d6076a6acfc8921e968b7d","sha256:73c54c28af4fa907c2d974ec2410055776970a0ec605f785318d88380455796f"],"state_sha256":"f48d3404c5988b37eb0d334b795b738a7bc37ad9d290f2f82d9f653708b0a7bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IR9+Yhj/XHwS+ERKT9hFYKpqhzlgmQIMSbxvhVcBohkGJUxt2MCVJayHSX8huFzCcWomyIrXp33K5qcX6hBNAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:09:32.130922Z","bundle_sha256":"eb1415badb1573bfa265502c23c87e055c9599ef465021fc6f423dc72e33659b"}}