{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MEONF4XNBFYFUTPRULEGJ2UAVG","short_pith_number":"pith:MEONF4XN","schema_version":"1.0","canonical_sha256":"611cd2f2ed09705a4df1a2c864ea80a9a43b430c69292d448bb0ad3a9f1a3de8","source":{"kind":"arxiv","id":"1701.05814","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.05814","created_at":"2026-05-18T00:52:24.653864+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.05814v1","created_at":"2026-05-18T00:52:24.653864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05814","created_at":"2026-05-18T00:52:24.653864+00:00"},{"alias_kind":"pith_short_12","alias_value":"MEONF4XNBFYF","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MEONF4XNBFYFUTPR","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MEONF4XN","created_at":"2026-05-18T12:31:31.346846+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/MEONF4XNBFYFUTPRULEGJ2UAVG","json":"https://pith.science/pith/MEONF4XNBFYFUTPRULEGJ2UAVG.json","graph_json":"https://pith.science/api/pith-number/MEONF4XNBFYFUTPRULEGJ2UAVG/graph.json","events_json":"https://pith.science/api/pith-number/MEONF4XNBFYFUTPRULEGJ2UAVG/events.json","paper":"https://pith.science/paper/MEONF4XN"},"agent_actions":{"view_html":"https://pith.science/pith/MEONF4XNBFYFUTPRULEGJ2UAVG","download_json":"https://pith.science/pith/MEONF4XNBFYFUTPRULEGJ2UAVG.json","view_paper":"https://pith.science/paper/MEONF4XN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.05814&json=true","fetch_graph":"https://pith.science/api/pith-number/MEONF4XNBFYFUTPRULEGJ2UAVG/graph.json","fetch_events":"https://pith.science/api/pith-number/MEONF4XNBFYFUTPRULEGJ2UAVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MEONF4XNBFYFUTPRULEGJ2UAVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MEONF4XNBFYFUTPRULEGJ2UAVG/action/storage_attestation","attest_author":"https://pith.science/pith/MEONF4XNBFYFUTPRULEGJ2UAVG/action/author_attestation","sign_citation":"https://pith.science/pith/MEONF4XNBFYFUTPRULEGJ2UAVG/action/citation_signature","submit_replication":"https://pith.science/pith/MEONF4XNBFYFUTPRULEGJ2UAVG/action/replication_record"}},"created_at":"2026-05-18T00:52:24.653864+00:00","updated_at":"2026-05-18T00:52:24.653864+00:00"}