{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MEONF4XNBFYFUTPRULEGJ2UAVG","short_pith_number":"pith:MEONF4XN","canonical_record":{"source":{"id":"1701.05814","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-20T14:48:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3cde73a587eeb5436b3bbcfc53c59b3ec678159b9be7698b1d15bdec952968d2","abstract_canon_sha256":"9282d0ab35dd86db428e485cf0f2e829eb95404ed2b81a83b899c3178d31d0eb"},"schema_version":"1.0"},"canonical_sha256":"611cd2f2ed09705a4df1a2c864ea80a9a43b430c69292d448bb0ad3a9f1a3de8","source":{"kind":"arxiv","id":"1701.05814","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05814","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05814v1","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05814","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"pith_short_12","alias_value":"MEONF4XNBFYF","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MEONF4XNBFYFUTPR","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MEONF4XN","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MEONF4XNBFYFUTPRULEGJ2UAVG","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05814","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-20T14:48:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3cde73a587eeb5436b3bbcfc53c59b3ec678159b9be7698b1d15bdec952968d2","abstract_canon_sha256":"9282d0ab35dd86db428e485cf0f2e829eb95404ed2b81a83b899c3178d31d0eb"},"schema_version":"1.0"},"canonical_sha256":"611cd2f2ed09705a4df1a2c864ea80a9a43b430c69292d448bb0ad3a9f1a3de8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:24.654311Z","signature_b64":"76OIIfYiaaDqDshzQ+umP9hxeZ+3r0GwAj8sM+F8LjhirhLbwYn8qdFXFWb3tVy7M7PSuJ7hxVTDutsriHs5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"611cd2f2ed09705a4df1a2c864ea80a9a43b430c69292d448bb0ad3a9f1a3de8","last_reissued_at":"2026-05-18T00:52:24.653768Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:24.653768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05814","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-18T00:52:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lgOa6FFYR6nF2hn8VT6vYgNUwsuV0of+RburyU4+Lp866Xoy17PEv9qyho2oWLqLUG7Z397K0th6BSj0YycXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:11:21.671562Z"},"content_sha256":"18c0ee16948c6ebc07fa8632a984153eb5921f54bf7c59a18665172736e04559","schema_version":"1.0","event_id":"sha256:18c0ee16948c6ebc07fa8632a984153eb5921f54bf7c59a18665172736e04559"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MEONF4XNBFYFUTPRULEGJ2UAVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-complexity Receiver for Multi-Level Polar Coded Modulation in Non-Orthogonal Multiple Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Beatrice Tomasi, Fr\\'ed\\'eric Gabry, Ingmar Land, Jean-Claude Belfiore, Valerio Bioglio","submitted_at":"2017-01-20T14:48:27Z","abstract_excerpt":"Non-orthogonal multiple access (NOMA) schemes have been proved to increase the multiple-access achievable rate with respect to orthogonal multiple access (OMA). In this paper we propose a novel communication system that combines multi-level coded modulation and polar codes in a NOMA scenario. Computational complexity decreases with the proposed scheme with respect to state-of-the-art solutions. We also highlight the trade-off between error rate performance and computational complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05814","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-18T00:52:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OLIJ/1kcVMlUW5w0g6S9Rq1VGPdlMqZJFDCKZESvL/pOCFg3ZJB6cBt+QstBIe6lhjzAqkmrL961CNn62hX3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:11:21.671905Z"},"content_sha256":"b0f0c62f643bd17756be95bd61318c4abcd601572a0f42afaebc392a3980332a","schema_version":"1.0","event_id":"sha256:b0f0c62f643bd17756be95bd61318c4abcd601572a0f42afaebc392a3980332a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MEONF4XNBFYFUTPRULEGJ2UAVG/bundle.json","state_url":"https://pith.science/pith/MEONF4XNBFYFUTPRULEGJ2UAVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MEONF4XNBFYFUTPRULEGJ2UAVG/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-27T22:11:21Z","links":{"resolver":"https://pith.science/pith/MEONF4XNBFYFUTPRULEGJ2UAVG","bundle":"https://pith.science/pith/MEONF4XNBFYFUTPRULEGJ2UAVG/bundle.json","state":"https://pith.science/pith/MEONF4XNBFYFUTPRULEGJ2UAVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MEONF4XNBFYFUTPRULEGJ2UAVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MEONF4XNBFYFUTPRULEGJ2UAVG","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":"9282d0ab35dd86db428e485cf0f2e829eb95404ed2b81a83b899c3178d31d0eb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-20T14:48:27Z","title_canon_sha256":"3cde73a587eeb5436b3bbcfc53c59b3ec678159b9be7698b1d15bdec952968d2"},"schema_version":"1.0","source":{"id":"1701.05814","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05814","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05814v1","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05814","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"pith_short_12","alias_value":"MEONF4XNBFYF","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MEONF4XNBFYFUTPR","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MEONF4XN","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:b0f0c62f643bd17756be95bd61318c4abcd601572a0f42afaebc392a3980332a","target":"graph","created_at":"2026-05-18T00:52:24Z","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":"Non-orthogonal multiple access (NOMA) schemes have been proved to increase the multiple-access achievable rate with respect to orthogonal multiple access (OMA). In this paper we propose a novel communication system that combines multi-level coded modulation and polar codes in a NOMA scenario. Computational complexity decreases with the proposed scheme with respect to state-of-the-art solutions. We also highlight the trade-off between error rate performance and computational complexity.","authors_text":"Beatrice Tomasi, Fr\\'ed\\'eric Gabry, Ingmar Land, Jean-Claude Belfiore, Valerio Bioglio","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-20T14:48:27Z","title":"Low-complexity Receiver for Multi-Level Polar Coded Modulation in Non-Orthogonal Multiple Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05814","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:18c0ee16948c6ebc07fa8632a984153eb5921f54bf7c59a18665172736e04559","target":"record","created_at":"2026-05-18T00:52:24Z","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":"9282d0ab35dd86db428e485cf0f2e829eb95404ed2b81a83b899c3178d31d0eb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-20T14:48:27Z","title_canon_sha256":"3cde73a587eeb5436b3bbcfc53c59b3ec678159b9be7698b1d15bdec952968d2"},"schema_version":"1.0","source":{"id":"1701.05814","kind":"arxiv","version":1}},"canonical_sha256":"611cd2f2ed09705a4df1a2c864ea80a9a43b430c69292d448bb0ad3a9f1a3de8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"611cd2f2ed09705a4df1a2c864ea80a9a43b430c69292d448bb0ad3a9f1a3de8","first_computed_at":"2026-05-18T00:52:24.653768Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:24.653768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"76OIIfYiaaDqDshzQ+umP9hxeZ+3r0GwAj8sM+F8LjhirhLbwYn8qdFXFWb3tVy7M7PSuJ7hxVTDutsriHs5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:24.654311Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05814","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18c0ee16948c6ebc07fa8632a984153eb5921f54bf7c59a18665172736e04559","sha256:b0f0c62f643bd17756be95bd61318c4abcd601572a0f42afaebc392a3980332a"],"state_sha256":"3b59e3d1e1e323c48d4401a9c0731a105835a68d29aadfcd0c0e272d2d8b06a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UFsG6fvBw83YHqizQVTFvUpHtlvlcQd3KhK0oh+ooGocT6Nflyt951z9Cx7hEI7WqzB2SM68Y+I94S4SBFqnDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:11:21.674130Z","bundle_sha256":"463b5fcaa42f3794c591031458a8e0d3a8a58e09c089fa82072fcec2a7003ee2"}}