{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZTFQZTY37DIZM7TRVAY6DVSLXP","short_pith_number":"pith:ZTFQZTY3","canonical_record":{"source":{"id":"1610.06995","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-22T04:10:15Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"52a0d74c893ceaaf24e0c408e3247ccafc370d1cd0efe469b83636e8ca4a0d00","abstract_canon_sha256":"066b1f143e1cfa5978e7dca677442ac78f97800b25a9dd0b5b7c582972beb34d"},"schema_version":"1.0"},"canonical_sha256":"cccb0ccf1bf8d1967e71a831e1d64bbbda04d0149a199461291022c9589df0e8","source":{"kind":"arxiv","id":"1610.06995","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06995","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06995v2","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06995","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZTFQZTY37DIZ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZTFQZTY37DIZM7TR","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZTFQZTY3","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZTFQZTY37DIZM7TRVAY6DVSLXP","target":"record","payload":{"canonical_record":{"source":{"id":"1610.06995","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-22T04:10:15Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"52a0d74c893ceaaf24e0c408e3247ccafc370d1cd0efe469b83636e8ca4a0d00","abstract_canon_sha256":"066b1f143e1cfa5978e7dca677442ac78f97800b25a9dd0b5b7c582972beb34d"},"schema_version":"1.0"},"canonical_sha256":"cccb0ccf1bf8d1967e71a831e1d64bbbda04d0149a199461291022c9589df0e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:34.152745Z","signature_b64":"9savCc3U3FzoKIMw2ALBn0w/PjbBv7ll2jU7PDMkXJ69ieqVsG66nWEDD5gwsh2cZoZlZI//ra3rXodrNlWXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cccb0ccf1bf8d1967e71a831e1d64bbbda04d0149a199461291022c9589df0e8","last_reissued_at":"2026-05-18T00:59:34.152046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:34.152046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.06995","source_version":2,"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:59:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vF8cJp6MzNtT8djTdl8a4qSNAFwB4DsO3dT6QJYkp5KUP1RVO5+GrimUzLAqXdZrnP8f8dCsHC/1nUhfWZuuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:11:13.110704Z"},"content_sha256":"bc5838edcd4feee3a234ac5f9fdeedc54254f249dfa64fe112731505e84c5a46","schema_version":"1.0","event_id":"sha256:bc5838edcd4feee3a234ac5f9fdeedc54254f249dfa64fe112731505e84c5a46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZTFQZTY37DIZM7TRVAY6DVSLXP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modeling and Analysis of Uplink Non-Orthogonal Multiple Access (NOMA) in Large-Scale Cellular Networks Using Poisson Cluster Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Ekram Hossain, Hina Tabassum, Md. Jahangir Hossain","submitted_at":"2016-10-22T04:10:15Z","abstract_excerpt":"Non-orthogonal multiple access (NOMA) serves multiple users by superposing their distinct message signals. The desired message signal is decoded at the receiver by applying successive interference cancellation (SIC). Using the theory of Poisson cluster process (PCP), we provide a framework to analyze multi-cell uplink NOMA systems. Specifically, we characterize the rate coverage probability of a NOMA user who is at rank $m$ (in terms of the distance from its serving BS) among all users in a cell and the mean rate coverage probability of all users in a cell. Since the signal-to-interference-plu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06995","kind":"arxiv","version":2},"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:59:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cjkj2Nn5cpBQ8NzaT+hfbFOICxpYbQY50luY0JwGS3SxQ9i9z6nLLFKbgc7P0GmnNlWcTrjv3hK2xZq64EbTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:11:13.111065Z"},"content_sha256":"513a33f7768124f1fbdadeb4b3ed1fae909653efe91b7c348d17755458bf9539","schema_version":"1.0","event_id":"sha256:513a33f7768124f1fbdadeb4b3ed1fae909653efe91b7c348d17755458bf9539"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTFQZTY37DIZM7TRVAY6DVSLXP/bundle.json","state_url":"https://pith.science/pith/ZTFQZTY37DIZM7TRVAY6DVSLXP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTFQZTY37DIZM7TRVAY6DVSLXP/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-30T22:11:13Z","links":{"resolver":"https://pith.science/pith/ZTFQZTY37DIZM7TRVAY6DVSLXP","bundle":"https://pith.science/pith/ZTFQZTY37DIZM7TRVAY6DVSLXP/bundle.json","state":"https://pith.science/pith/ZTFQZTY37DIZM7TRVAY6DVSLXP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTFQZTY37DIZM7TRVAY6DVSLXP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZTFQZTY37DIZM7TRVAY6DVSLXP","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":"066b1f143e1cfa5978e7dca677442ac78f97800b25a9dd0b5b7c582972beb34d","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-22T04:10:15Z","title_canon_sha256":"52a0d74c893ceaaf24e0c408e3247ccafc370d1cd0efe469b83636e8ca4a0d00"},"schema_version":"1.0","source":{"id":"1610.06995","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06995","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06995v2","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06995","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZTFQZTY37DIZ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZTFQZTY37DIZM7TR","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZTFQZTY3","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:513a33f7768124f1fbdadeb4b3ed1fae909653efe91b7c348d17755458bf9539","target":"graph","created_at":"2026-05-18T00:59:34Z","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) serves multiple users by superposing their distinct message signals. The desired message signal is decoded at the receiver by applying successive interference cancellation (SIC). Using the theory of Poisson cluster process (PCP), we provide a framework to analyze multi-cell uplink NOMA systems. Specifically, we characterize the rate coverage probability of a NOMA user who is at rank $m$ (in terms of the distance from its serving BS) among all users in a cell and the mean rate coverage probability of all users in a cell. Since the signal-to-interference-plu","authors_text":"Ekram Hossain, Hina Tabassum, Md. Jahangir Hossain","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-22T04:10:15Z","title":"Modeling and Analysis of Uplink Non-Orthogonal Multiple Access (NOMA) in Large-Scale Cellular Networks Using Poisson Cluster Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06995","kind":"arxiv","version":2},"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:bc5838edcd4feee3a234ac5f9fdeedc54254f249dfa64fe112731505e84c5a46","target":"record","created_at":"2026-05-18T00:59:34Z","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":"066b1f143e1cfa5978e7dca677442ac78f97800b25a9dd0b5b7c582972beb34d","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-22T04:10:15Z","title_canon_sha256":"52a0d74c893ceaaf24e0c408e3247ccafc370d1cd0efe469b83636e8ca4a0d00"},"schema_version":"1.0","source":{"id":"1610.06995","kind":"arxiv","version":2}},"canonical_sha256":"cccb0ccf1bf8d1967e71a831e1d64bbbda04d0149a199461291022c9589df0e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cccb0ccf1bf8d1967e71a831e1d64bbbda04d0149a199461291022c9589df0e8","first_computed_at":"2026-05-18T00:59:34.152046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:34.152046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9savCc3U3FzoKIMw2ALBn0w/PjbBv7ll2jU7PDMkXJ69ieqVsG66nWEDD5gwsh2cZoZlZI//ra3rXodrNlWXCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:34.152745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.06995","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc5838edcd4feee3a234ac5f9fdeedc54254f249dfa64fe112731505e84c5a46","sha256:513a33f7768124f1fbdadeb4b3ed1fae909653efe91b7c348d17755458bf9539"],"state_sha256":"15b09bdb8009f42e78418c86cfe1b6130ac3b34a2c9bdfba7f921395e5b822a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nm0J8pVKjPsOZR+q7C7hp+NfTYKQ4VtMr282XZj61F//6ZmZTsI5d8LzFjrXXGdWYrnmmG/IERdzxN0sPnhBBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:11:13.113452Z","bundle_sha256":"1c2d7e83786c0ca52f6ef3ae15990b3b78060f08dd34ee35b13d96ea27b5c7e8"}}