{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UL6PJ7XSUWP5YT644AJF47QO5U","short_pith_number":"pith:UL6PJ7XS","canonical_record":{"source":{"id":"1905.09514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-23T07:45:07Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"2403631d96edb143fe58a2304eb0907134320a70690074a9a9c4127d2dd1175f","abstract_canon_sha256":"c326073eedd8e6ef7917da146dbf370cd3b77e6dfb48459e1b270ec58ce952e0"},"schema_version":"1.0"},"canonical_sha256":"a2fcf4fef2a59fdc4fdce0125e7e0eed02b9ae34aacd43014420a31d19e1d92d","source":{"kind":"arxiv","id":"1905.09514","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09514","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09514v1","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09514","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"pith_short_12","alias_value":"UL6PJ7XSUWP5","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UL6PJ7XSUWP5YT64","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UL6PJ7XS","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UL6PJ7XSUWP5YT644AJF47QO5U","target":"record","payload":{"canonical_record":{"source":{"id":"1905.09514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-23T07:45:07Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"2403631d96edb143fe58a2304eb0907134320a70690074a9a9c4127d2dd1175f","abstract_canon_sha256":"c326073eedd8e6ef7917da146dbf370cd3b77e6dfb48459e1b270ec58ce952e0"},"schema_version":"1.0"},"canonical_sha256":"a2fcf4fef2a59fdc4fdce0125e7e0eed02b9ae34aacd43014420a31d19e1d92d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:14.282230Z","signature_b64":"4vOkjrP+IAhVjKBR9d9KTrSzS33xLe5NgfIfCx05z7IxMiTObbaMkRPXoilUfreIbWwCvOEO/KnNgLng6IIoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2fcf4fef2a59fdc4fdce0125e7e0eed02b9ae34aacd43014420a31d19e1d92d","last_reissued_at":"2026-05-17T23:43:14.281621Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:14.281621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.09514","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-17T23:43:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KBPnMLHPObiPmTwMWdiCGyFbRt1tSIq5271Wwfep9FyzucHtaoYHg4LswukioFXcFgweHRGS36H2N8csHRZfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:44:29.376945Z"},"content_sha256":"dc0aec6af54d01cf2cc41cfaccbd86c5b0f6d2441238e5468eca02799b38404f","schema_version":"1.0","event_id":"sha256:dc0aec6af54d01cf2cc41cfaccbd86c5b0f6d2441238e5468eca02799b38404f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UL6PJ7XSUWP5YT644AJF47QO5U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Downlink Non-Orthogonal Multiple Access without SIC for Block Fading Channels: An Algebraic Rotation Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Jinhong Yuan, Min Qiu, Yu-Chih Huang","submitted_at":"2019-05-23T07:45:07Z","abstract_excerpt":"In this paper, we investigate the problem of downlink non-orthogonal multiple access (NOMA) over block fading channels. For the single antenna case, we propose a class of NOMA schemes where all the users' signals are mapped into $n$-dimensional constellations corresponding to the same algebraic lattices from a number field, allowing every user attains full diversity gain with single-user decoding, i.e., no successive interference cancellation (SIC). The minimum product distances of the proposed scheme with arbitrary power allocation factor are analyzed and their upper bounds are derived. Withi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09514","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-17T23:43:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YPEOQHDGXagyjj2K5f0QK57nR2aXO48JlE9Auu2SjrBq8wk0ntUOkbcAJtG8d0KpOefVt7ENcV4Joy5VqxDqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:44:29.377670Z"},"content_sha256":"6fe123ec4f9e6d56c4b36cb4a55fd7a20e3179d55975d17a447e3262155dcb78","schema_version":"1.0","event_id":"sha256:6fe123ec4f9e6d56c4b36cb4a55fd7a20e3179d55975d17a447e3262155dcb78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UL6PJ7XSUWP5YT644AJF47QO5U/bundle.json","state_url":"https://pith.science/pith/UL6PJ7XSUWP5YT644AJF47QO5U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UL6PJ7XSUWP5YT644AJF47QO5U/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-09T08:44:29Z","links":{"resolver":"https://pith.science/pith/UL6PJ7XSUWP5YT644AJF47QO5U","bundle":"https://pith.science/pith/UL6PJ7XSUWP5YT644AJF47QO5U/bundle.json","state":"https://pith.science/pith/UL6PJ7XSUWP5YT644AJF47QO5U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UL6PJ7XSUWP5YT644AJF47QO5U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UL6PJ7XSUWP5YT644AJF47QO5U","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":"c326073eedd8e6ef7917da146dbf370cd3b77e6dfb48459e1b270ec58ce952e0","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-23T07:45:07Z","title_canon_sha256":"2403631d96edb143fe58a2304eb0907134320a70690074a9a9c4127d2dd1175f"},"schema_version":"1.0","source":{"id":"1905.09514","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09514","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09514v1","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09514","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"pith_short_12","alias_value":"UL6PJ7XSUWP5","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UL6PJ7XSUWP5YT64","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UL6PJ7XS","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:6fe123ec4f9e6d56c4b36cb4a55fd7a20e3179d55975d17a447e3262155dcb78","target":"graph","created_at":"2026-05-17T23:43:14Z","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":"In this paper, we investigate the problem of downlink non-orthogonal multiple access (NOMA) over block fading channels. For the single antenna case, we propose a class of NOMA schemes where all the users' signals are mapped into $n$-dimensional constellations corresponding to the same algebraic lattices from a number field, allowing every user attains full diversity gain with single-user decoding, i.e., no successive interference cancellation (SIC). The minimum product distances of the proposed scheme with arbitrary power allocation factor are analyzed and their upper bounds are derived. Withi","authors_text":"Jinhong Yuan, Min Qiu, Yu-Chih Huang","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-23T07:45:07Z","title":"Downlink Non-Orthogonal Multiple Access without SIC for Block Fading Channels: An Algebraic Rotation Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09514","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:dc0aec6af54d01cf2cc41cfaccbd86c5b0f6d2441238e5468eca02799b38404f","target":"record","created_at":"2026-05-17T23:43:14Z","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":"c326073eedd8e6ef7917da146dbf370cd3b77e6dfb48459e1b270ec58ce952e0","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-23T07:45:07Z","title_canon_sha256":"2403631d96edb143fe58a2304eb0907134320a70690074a9a9c4127d2dd1175f"},"schema_version":"1.0","source":{"id":"1905.09514","kind":"arxiv","version":1}},"canonical_sha256":"a2fcf4fef2a59fdc4fdce0125e7e0eed02b9ae34aacd43014420a31d19e1d92d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2fcf4fef2a59fdc4fdce0125e7e0eed02b9ae34aacd43014420a31d19e1d92d","first_computed_at":"2026-05-17T23:43:14.281621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:14.281621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4vOkjrP+IAhVjKBR9d9KTrSzS33xLe5NgfIfCx05z7IxMiTObbaMkRPXoilUfreIbWwCvOEO/KnNgLng6IIoDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:14.282230Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.09514","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc0aec6af54d01cf2cc41cfaccbd86c5b0f6d2441238e5468eca02799b38404f","sha256:6fe123ec4f9e6d56c4b36cb4a55fd7a20e3179d55975d17a447e3262155dcb78"],"state_sha256":"52769f3ae8133b577b7db19700d0753dc73c36c87fe15f19f67f80e7ae08e08e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r1Hcl7b3supnuBb5nGjT7qMqII6MazEZ2HtAvGJlzEMuwbVXC8zQx24xj+RWKF6QZ6UOiK+8kKvzOV/MdSw+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:44:29.380989Z","bundle_sha256":"b3298f2ffebd43f245859de826f9a27d4e718b7986fcfd101cc5dec3e23780fd"}}