{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KAMXT2FU3UBOKT6E47ZJCVM2S3","short_pith_number":"pith:KAMXT2FU","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"},"canonical_sha256":"501979e8b4dd02e54fc4e7f291559a96d26206f7d7cc43fa18fc3bc24cc5a209","source":{"kind":"arxiv","id":"1508.00679","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00679","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00679v1","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00679","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"pith_short_12","alias_value":"KAMXT2FU3UBO","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KAMXT2FU3UBOKT6E","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KAMXT2FU","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KAMXT2FU3UBOKT6E47ZJCVM2S3","target":"record","payload":{"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"},"canonical_sha256":"501979e8b4dd02e54fc4e7f291559a96d26206f7d7cc43fa18fc3bc24cc5a209","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"},"source_kind":"arxiv","source_id":"1508.00679","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":"jPcTukwxWVXglqbacbgkSzBoYSeQxxJ3Q223bngjLUuloyO8L+bQbbieTHyCFPCdjw07ZyBZLUCDBltCmmkhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:07:30.145410Z"},"content_sha256":"069198585e81089c9959411f5dcc86ec40b874c9ed300b7ff83141d89f24afd4","schema_version":"1.0","event_id":"sha256:069198585e81089c9959411f5dcc86ec40b874c9ed300b7ff83141d89f24afd4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KAMXT2FU3UBOKT6E47ZJCVM2S3","target":"graph","payload":{"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"},"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":"nZvBv72oGQws4/VwMt47yL0wh/967DnrK8rWymz7cy7zuDBXleGPDoBwurPJlkqhBo5H8R+kPYxShGOhIdYqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:07:30.146033Z"},"content_sha256":"46b7479b6d82873d8ec3cf5de48dd0fdbc1c0a7442240c5b76b02cbf667fb569","schema_version":"1.0","event_id":"sha256:46b7479b6d82873d8ec3cf5de48dd0fdbc1c0a7442240c5b76b02cbf667fb569"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KAMXT2FU3UBOKT6E47ZJCVM2S3/bundle.json","state_url":"https://pith.science/pith/KAMXT2FU3UBOKT6E47ZJCVM2S3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KAMXT2FU3UBOKT6E47ZJCVM2S3/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-30T19:07:30Z","links":{"resolver":"https://pith.science/pith/KAMXT2FU3UBOKT6E47ZJCVM2S3","bundle":"https://pith.science/pith/KAMXT2FU3UBOKT6E47ZJCVM2S3/bundle.json","state":"https://pith.science/pith/KAMXT2FU3UBOKT6E47ZJCVM2S3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KAMXT2FU3UBOKT6E47ZJCVM2S3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KAMXT2FU3UBOKT6E47ZJCVM2S3","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":"4c00fe994a0581af512dae1c79d1e179900616589e28a59afbf183766177c10f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T06:48:00Z","title_canon_sha256":"6508ef5438a0a3006d279f9daeeb40bb612f60a417e05a1e52bb7dc1454135aa"},"schema_version":"1.0","source":{"id":"1508.00679","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00679","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00679v1","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00679","created_at":"2026-05-18T01:35:53Z"},{"alias_kind":"pith_short_12","alias_value":"KAMXT2FU3UBO","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KAMXT2FU3UBOKT6E","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KAMXT2FU","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:46b7479b6d82873d8ec3cf5de48dd0fdbc1c0a7442240c5b76b02cbf667fb569","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 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","authors_text":"Baicen Xiao, Bin Xia, 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-04T06:48:00Z","title":"Simplified Multiuser Detection for SCMA with Sum-Product Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00679","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:069198585e81089c9959411f5dcc86ec40b874c9ed300b7ff83141d89f24afd4","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":"4c00fe994a0581af512dae1c79d1e179900616589e28a59afbf183766177c10f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T06:48:00Z","title_canon_sha256":"6508ef5438a0a3006d279f9daeeb40bb612f60a417e05a1e52bb7dc1454135aa"},"schema_version":"1.0","source":{"id":"1508.00679","kind":"arxiv","version":1}},"canonical_sha256":"501979e8b4dd02e54fc4e7f291559a96d26206f7d7cc43fa18fc3bc24cc5a209","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"501979e8b4dd02e54fc4e7f291559a96d26206f7d7cc43fa18fc3bc24cc5a209","first_computed_at":"2026-05-18T01:35:53.704430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:53.704430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y+5g/kEfhBSMdt/N7fjCqylCI+sQ+MfLQjx+na+DOYyD83kMkGCnd+3ABCQMlbWI9csK8qJFrsEeLspm5SQTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:53.705084Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.00679","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:069198585e81089c9959411f5dcc86ec40b874c9ed300b7ff83141d89f24afd4","sha256:46b7479b6d82873d8ec3cf5de48dd0fdbc1c0a7442240c5b76b02cbf667fb569"],"state_sha256":"87b1bed8f9e4bd8017faf45f293fd21c7885df0e3060293f0a2e176b9a30f47c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ik9N7K6WRl3jkd0rvP2YEOFInpE9/g6PBT0ZC+kaY5TsStZbeRJsTRMnu/5jVFknRfgHefEIIRaoZk5WwMxHBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:07:30.149505Z","bundle_sha256":"0400c8c597fa4aab5b9ad118c9467af2f0cdb150b82d68e3ed8038a60a5d117d"}}