{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OTUICRYJB2FZHST53LKRG34ARM","short_pith_number":"pith:OTUICRYJ","canonical_record":{"source":{"id":"1410.5579","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-21T09:04:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4285b8e15aee629b28a7d28c0232f05cbcd4a6ee0fc32321178b3cf48a009034","abstract_canon_sha256":"2790c494948e1e3a6aa4cb1594afe9b26dfa3fbc3eb54a5bd4e20b8b91dd3ce8"},"schema_version":"1.0"},"canonical_sha256":"74e88147090e8b93ca7ddad5136f808b0149cafb03f9bf2e145f61076aea929c","source":{"kind":"arxiv","id":"1410.5579","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5579","created_at":"2026-05-18T02:28:31Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5579v2","created_at":"2026-05-18T02:28:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5579","created_at":"2026-05-18T02:28:31Z"},{"alias_kind":"pith_short_12","alias_value":"OTUICRYJB2FZ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OTUICRYJB2FZHST5","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OTUICRYJ","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OTUICRYJB2FZHST53LKRG34ARM","target":"record","payload":{"canonical_record":{"source":{"id":"1410.5579","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-21T09:04:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4285b8e15aee629b28a7d28c0232f05cbcd4a6ee0fc32321178b3cf48a009034","abstract_canon_sha256":"2790c494948e1e3a6aa4cb1594afe9b26dfa3fbc3eb54a5bd4e20b8b91dd3ce8"},"schema_version":"1.0"},"canonical_sha256":"74e88147090e8b93ca7ddad5136f808b0149cafb03f9bf2e145f61076aea929c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:31.323184Z","signature_b64":"3AjcK8ldJ3KJDvK8qNT2TI6Gevoh6ZZi8m/t3rdBkKeMIbhor4Vftm7kqzbszBxi/JwT+W0EU7q6ZWkxzkvKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74e88147090e8b93ca7ddad5136f808b0149cafb03f9bf2e145f61076aea929c","last_reissued_at":"2026-05-18T02:28:31.322545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:31.322545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.5579","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-18T02:28:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EQrEX39TG5n7JtoKteKRqM1/7MoPiqw4zScApmw6W2Eo3bTonbbaWo1amj1b3LSL8PYX7VnxcJIJzCS4ruWQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:12:39.774171Z"},"content_sha256":"fe748eb7c0a1dc5e3a1d3d829d3c90abcd5097f7a1b850767a45d848aaaa347d","schema_version":"1.0","event_id":"sha256:fe748eb7c0a1dc5e3a1d3d829d3c90abcd5097f7a1b850767a45d848aaaa347d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OTUICRYJB2FZHST53LKRG34ARM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Orthogonal Multiple Access for Degraded Broadcast Channels: RA-CEMA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alberto G. Perotti, Branislav M. Popovic","submitted_at":"2014-10-21T09:04:26Z","abstract_excerpt":"A new non-orthogonal multiple access scheme performing simultaneous transmission to multiple users characterized by different signal-to-noise ratios is proposed. Different users are multiplexed by storing their codewords into a multiplexing matrix according to properly designed patterns and then mapping the columns of the matrix onto the symbols of a higher-order constellation. At the receiver, an interference cancellation algorithm is employed in order to achieve a higher spectral efficiency than orthogonal user multiplexing. Rate-Adaptive Constellation Expansion Multiple Access (RA-CEMA) is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5579","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-18T02:28:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+N7NBrqBy/lOqva9VKR0MBcufgRSa8aUfZtlMaMqr/fXd4ZYcjv6WL5JiYQP04sMoRNtiF1p1bQL/Qnq6e2ODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:12:39.774965Z"},"content_sha256":"7b82cc8aa9db54191dcdb1cd70ee7afe49e330e4b50b51061c7e4cd5c96d1d8a","schema_version":"1.0","event_id":"sha256:7b82cc8aa9db54191dcdb1cd70ee7afe49e330e4b50b51061c7e4cd5c96d1d8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTUICRYJB2FZHST53LKRG34ARM/bundle.json","state_url":"https://pith.science/pith/OTUICRYJB2FZHST53LKRG34ARM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTUICRYJB2FZHST53LKRG34ARM/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-07T16:12:39Z","links":{"resolver":"https://pith.science/pith/OTUICRYJB2FZHST53LKRG34ARM","bundle":"https://pith.science/pith/OTUICRYJB2FZHST53LKRG34ARM/bundle.json","state":"https://pith.science/pith/OTUICRYJB2FZHST53LKRG34ARM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTUICRYJB2FZHST53LKRG34ARM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OTUICRYJB2FZHST53LKRG34ARM","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":"2790c494948e1e3a6aa4cb1594afe9b26dfa3fbc3eb54a5bd4e20b8b91dd3ce8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-21T09:04:26Z","title_canon_sha256":"4285b8e15aee629b28a7d28c0232f05cbcd4a6ee0fc32321178b3cf48a009034"},"schema_version":"1.0","source":{"id":"1410.5579","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5579","created_at":"2026-05-18T02:28:31Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5579v2","created_at":"2026-05-18T02:28:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5579","created_at":"2026-05-18T02:28:31Z"},{"alias_kind":"pith_short_12","alias_value":"OTUICRYJB2FZ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OTUICRYJB2FZHST5","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OTUICRYJ","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:7b82cc8aa9db54191dcdb1cd70ee7afe49e330e4b50b51061c7e4cd5c96d1d8a","target":"graph","created_at":"2026-05-18T02:28:31Z","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":"A new non-orthogonal multiple access scheme performing simultaneous transmission to multiple users characterized by different signal-to-noise ratios is proposed. Different users are multiplexed by storing their codewords into a multiplexing matrix according to properly designed patterns and then mapping the columns of the matrix onto the symbols of a higher-order constellation. At the receiver, an interference cancellation algorithm is employed in order to achieve a higher spectral efficiency than orthogonal user multiplexing. Rate-Adaptive Constellation Expansion Multiple Access (RA-CEMA) is ","authors_text":"Alberto G. Perotti, Branislav M. Popovic","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-21T09:04:26Z","title":"Non-Orthogonal Multiple Access for Degraded Broadcast Channels: RA-CEMA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5579","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:fe748eb7c0a1dc5e3a1d3d829d3c90abcd5097f7a1b850767a45d848aaaa347d","target":"record","created_at":"2026-05-18T02:28:31Z","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":"2790c494948e1e3a6aa4cb1594afe9b26dfa3fbc3eb54a5bd4e20b8b91dd3ce8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-21T09:04:26Z","title_canon_sha256":"4285b8e15aee629b28a7d28c0232f05cbcd4a6ee0fc32321178b3cf48a009034"},"schema_version":"1.0","source":{"id":"1410.5579","kind":"arxiv","version":2}},"canonical_sha256":"74e88147090e8b93ca7ddad5136f808b0149cafb03f9bf2e145f61076aea929c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74e88147090e8b93ca7ddad5136f808b0149cafb03f9bf2e145f61076aea929c","first_computed_at":"2026-05-18T02:28:31.322545Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:31.322545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3AjcK8ldJ3KJDvK8qNT2TI6Gevoh6ZZi8m/t3rdBkKeMIbhor4Vftm7kqzbszBxi/JwT+W0EU7q6ZWkxzkvKCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:31.323184Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.5579","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe748eb7c0a1dc5e3a1d3d829d3c90abcd5097f7a1b850767a45d848aaaa347d","sha256:7b82cc8aa9db54191dcdb1cd70ee7afe49e330e4b50b51061c7e4cd5c96d1d8a"],"state_sha256":"dbef3bc7827c465582ebd58b80bc01724775c6b8ca1134ad85d45fc5940e928a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VVChFq5TzOL/O6hxyH4v79LXf2x5RUqNkiZY9n94DTw+9XdnX0syN0pySXNVkl/33IIKUKGhfHD9kZfD0qHvAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:12:39.778721Z","bundle_sha256":"9c82f3d6227004987f17481fb74161007eb1b5d8e146a25e4a9bfa4236a27bcb"}}