{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KEFDGXHS744PIQAAHOYA5DXC5F","short_pith_number":"pith:KEFDGXHS","canonical_record":{"source":{"id":"1902.07862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-21T04:39:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8bca9f5464fd588aaaf837a93b3d162cb81d435fd314591304120c806c20effc","abstract_canon_sha256":"99f189bfb53a8b00a85f750c6409b865a53dce0f44afa1c1c0a6d46525a6e5fc"},"schema_version":"1.0"},"canonical_sha256":"510a335cf2ff38f440003bb00e8ee2e963d0d8d2963be000f97a2f6ebb58f556","source":{"kind":"arxiv","id":"1902.07862","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07862","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07862v1","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07862","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"KEFDGXHS744P","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KEFDGXHS744PIQAA","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KEFDGXHS","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KEFDGXHS744PIQAAHOYA5DXC5F","target":"record","payload":{"canonical_record":{"source":{"id":"1902.07862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-21T04:39:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8bca9f5464fd588aaaf837a93b3d162cb81d435fd314591304120c806c20effc","abstract_canon_sha256":"99f189bfb53a8b00a85f750c6409b865a53dce0f44afa1c1c0a6d46525a6e5fc"},"schema_version":"1.0"},"canonical_sha256":"510a335cf2ff38f440003bb00e8ee2e963d0d8d2963be000f97a2f6ebb58f556","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:03.653389Z","signature_b64":"RX38Rep2Z0vdF56I/NP4DoS+YXAGeFjNYkIWCBkPd44UVTPxVl4GV9FQl1VKiNQZg1tF+jvNZBf4XN8I0W7+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"510a335cf2ff38f440003bb00e8ee2e963d0d8d2963be000f97a2f6ebb58f556","last_reissued_at":"2026-05-17T23:53:03.652768Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:03.652768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.07862","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:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/kv09B7/Yg6ttk6tSexavG8v2PyBkYGhpl9BYY1yi030u061WcYWHfLWk24GHBdsmdXMGQcErgcOzXJVGkU0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:45:11.688155Z"},"content_sha256":"fa9267e3435901c6d38ae4574133f7599090dd1069ed28b4b542b42b5ed62ac3","schema_version":"1.0","event_id":"sha256:fa9267e3435901c6d38ae4574133f7599090dd1069ed28b4b542b42b5ed62ac3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KEFDGXHS744PIQAAHOYA5DXC5F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cooperative Asynchronous Non-Orthogonal Multiple Access with Power Minimization Under QoS Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamid Jafarkhani, Mehdi Ganji, Xun Zou","submitted_at":"2019-02-21T04:39:51Z","abstract_excerpt":"Recent studies have demonstrated the superiority of non-orthogonal multiple access (NOMA) over orthogonal multiple access (OMA) in cooperative communication networks. In this paper, we propose a novel half-duplex cooperative asynchronous NOMA (C-ANOMA) framework with user relaying, where a timing mismatch is intentionally added in the broadcast signal. We derive the expressions for the individual throughputs of the strong user (acts as relay) which employs the block-wise successive interference cancellation (SIC) and the weak user which combines the symbol-asynchronous signal with the interfer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07862","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:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DeVnBpv5CD+g9V7xkT45k44SLmp4be0NvTudY1Pz0UwE/nRXUhkqIPORDQHPGK+2gAfbdsHm4LYGfzHIshbmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:45:11.688523Z"},"content_sha256":"78ec997281a58560b37bcce66dab1819513ed910206050e0b00e78702725de01","schema_version":"1.0","event_id":"sha256:78ec997281a58560b37bcce66dab1819513ed910206050e0b00e78702725de01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KEFDGXHS744PIQAAHOYA5DXC5F/bundle.json","state_url":"https://pith.science/pith/KEFDGXHS744PIQAAHOYA5DXC5F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KEFDGXHS744PIQAAHOYA5DXC5F/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-28T10:45:11Z","links":{"resolver":"https://pith.science/pith/KEFDGXHS744PIQAAHOYA5DXC5F","bundle":"https://pith.science/pith/KEFDGXHS744PIQAAHOYA5DXC5F/bundle.json","state":"https://pith.science/pith/KEFDGXHS744PIQAAHOYA5DXC5F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KEFDGXHS744PIQAAHOYA5DXC5F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KEFDGXHS744PIQAAHOYA5DXC5F","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":"99f189bfb53a8b00a85f750c6409b865a53dce0f44afa1c1c0a6d46525a6e5fc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-21T04:39:51Z","title_canon_sha256":"8bca9f5464fd588aaaf837a93b3d162cb81d435fd314591304120c806c20effc"},"schema_version":"1.0","source":{"id":"1902.07862","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07862","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07862v1","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07862","created_at":"2026-05-17T23:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"KEFDGXHS744P","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KEFDGXHS744PIQAA","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KEFDGXHS","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:78ec997281a58560b37bcce66dab1819513ed910206050e0b00e78702725de01","target":"graph","created_at":"2026-05-17T23:53:03Z","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":"Recent studies have demonstrated the superiority of non-orthogonal multiple access (NOMA) over orthogonal multiple access (OMA) in cooperative communication networks. In this paper, we propose a novel half-duplex cooperative asynchronous NOMA (C-ANOMA) framework with user relaying, where a timing mismatch is intentionally added in the broadcast signal. We derive the expressions for the individual throughputs of the strong user (acts as relay) which employs the block-wise successive interference cancellation (SIC) and the weak user which combines the symbol-asynchronous signal with the interfer","authors_text":"Hamid Jafarkhani, Mehdi Ganji, Xun Zou","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-21T04:39:51Z","title":"Cooperative Asynchronous Non-Orthogonal Multiple Access with Power Minimization Under QoS Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07862","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:fa9267e3435901c6d38ae4574133f7599090dd1069ed28b4b542b42b5ed62ac3","target":"record","created_at":"2026-05-17T23:53:03Z","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":"99f189bfb53a8b00a85f750c6409b865a53dce0f44afa1c1c0a6d46525a6e5fc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-21T04:39:51Z","title_canon_sha256":"8bca9f5464fd588aaaf837a93b3d162cb81d435fd314591304120c806c20effc"},"schema_version":"1.0","source":{"id":"1902.07862","kind":"arxiv","version":1}},"canonical_sha256":"510a335cf2ff38f440003bb00e8ee2e963d0d8d2963be000f97a2f6ebb58f556","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"510a335cf2ff38f440003bb00e8ee2e963d0d8d2963be000f97a2f6ebb58f556","first_computed_at":"2026-05-17T23:53:03.652768Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:03.652768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RX38Rep2Z0vdF56I/NP4DoS+YXAGeFjNYkIWCBkPd44UVTPxVl4GV9FQl1VKiNQZg1tF+jvNZBf4XN8I0W7+DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:03.653389Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.07862","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa9267e3435901c6d38ae4574133f7599090dd1069ed28b4b542b42b5ed62ac3","sha256:78ec997281a58560b37bcce66dab1819513ed910206050e0b00e78702725de01"],"state_sha256":"91089e18e1615471df51a02a41cacb6773e1271635b71e6fa0b74da1ae1c1c55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Spqzm1RT0LQ9lyjLIRoDyE2a9DzhOLGTxGem+VA35K33IjxcKWDf1ifuTVrjODKZc2nFATdk/2RAirWvx63MBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:45:11.690651Z","bundle_sha256":"c0383e1fb11bf541d1e56097f51ec6933c93d48880e045bcc7117ebe1bc60a84"}}