{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KISNPGYP3F2HUMMY2KHYC7NRJA","short_pith_number":"pith:KISNPGYP","canonical_record":{"source":{"id":"1608.03663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-12T03:07:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1ab8306ed4b1a700d6f2743b7aeed4481d8536e9c0b7ca0aef626f6f4ad13618","abstract_canon_sha256":"e5175aa90e3c69a2e71894443d9385f15e0f30d4375c02f808cd209608dceebc"},"schema_version":"1.0"},"canonical_sha256":"5224d79b0fd9747a3198d28f817db148148c09833eccb95dbdacf1e560901b0e","source":{"kind":"arxiv","id":"1608.03663","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03663","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03663v1","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03663","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"KISNPGYP3F2H","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KISNPGYP3F2HUMMY","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KISNPGYP","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KISNPGYP3F2HUMMY2KHYC7NRJA","target":"record","payload":{"canonical_record":{"source":{"id":"1608.03663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-12T03:07:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1ab8306ed4b1a700d6f2743b7aeed4481d8536e9c0b7ca0aef626f6f4ad13618","abstract_canon_sha256":"e5175aa90e3c69a2e71894443d9385f15e0f30d4375c02f808cd209608dceebc"},"schema_version":"1.0"},"canonical_sha256":"5224d79b0fd9747a3198d28f817db148148c09833eccb95dbdacf1e560901b0e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:12.177867Z","signature_b64":"s39LoW694D7jPCPa33i7U+sgG3lYjGIAdMlVhbTQ9wCEIytAtMIuwCCWuGsFME33aSunfg1zQJhXHa9eihItCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5224d79b0fd9747a3198d28f817db148148c09833eccb95dbdacf1e560901b0e","last_reissued_at":"2026-05-18T01:09:12.177184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:12.177184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.03663","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-18T01:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OKa+3jNmME+tASsPp1AyKYQwDZfovaxaA29Q662KxhQV47T9fyygLsRnUB3GPLEi/2WU+VRecrKjwNOJRcN+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T17:58:36.290547Z"},"content_sha256":"49ff2a6d30a7d8e972c6ea0338ea155ed97975f24d856d53e7b892f6209d456a","schema_version":"1.0","event_id":"sha256:49ff2a6d30a7d8e972c6ea0338ea155ed97975f24d856d53e7b892f6209d456a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KISNPGYP3F2HUMMY2KHYC7NRJA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithm to Realize Rate-Splitting in Gaussian Multi-access Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Huifang Chen, Peiliang Qiu, Xiaomao Mao","submitted_at":"2016-08-12T03:07:12Z","abstract_excerpt":"Rate Splitting Multiple Access (RSMA) is a code division multi-access technique which can achieve any base in the multi-access capacity polymatroid without high coding complexity or synchronization among the transmitting users. In this paper, a practical algorithm is proposed to compute the splitting coefficients and the successive decoding order of virtual users in Gaussian RSMA transmission. Based on the proposed algorithm, a deterministic mapping is built between the system parameters and the objective rate tuple for RSMA. As a result, the application of the RSMA technique becomes possible "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03663","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-18T01:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"750h8e+NYGU+EhTYKKE1xAlIPjipo6cbF9Tb1Y5RisOldRdbQ46gUAvs6v8Y6hvp7riqcCCwIRnEbKyMqI8YCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T17:58:36.290898Z"},"content_sha256":"5e4affb028ec9c951478cd0f0f4d91536bede6d087f390a49b9e29e3efdda1d5","schema_version":"1.0","event_id":"sha256:5e4affb028ec9c951478cd0f0f4d91536bede6d087f390a49b9e29e3efdda1d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KISNPGYP3F2HUMMY2KHYC7NRJA/bundle.json","state_url":"https://pith.science/pith/KISNPGYP3F2HUMMY2KHYC7NRJA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KISNPGYP3F2HUMMY2KHYC7NRJA/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-10T17:58:36Z","links":{"resolver":"https://pith.science/pith/KISNPGYP3F2HUMMY2KHYC7NRJA","bundle":"https://pith.science/pith/KISNPGYP3F2HUMMY2KHYC7NRJA/bundle.json","state":"https://pith.science/pith/KISNPGYP3F2HUMMY2KHYC7NRJA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KISNPGYP3F2HUMMY2KHYC7NRJA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KISNPGYP3F2HUMMY2KHYC7NRJA","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":"e5175aa90e3c69a2e71894443d9385f15e0f30d4375c02f808cd209608dceebc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-12T03:07:12Z","title_canon_sha256":"1ab8306ed4b1a700d6f2743b7aeed4481d8536e9c0b7ca0aef626f6f4ad13618"},"schema_version":"1.0","source":{"id":"1608.03663","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03663","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03663v1","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03663","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"KISNPGYP3F2H","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KISNPGYP3F2HUMMY","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KISNPGYP","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:5e4affb028ec9c951478cd0f0f4d91536bede6d087f390a49b9e29e3efdda1d5","target":"graph","created_at":"2026-05-18T01:09:12Z","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":"Rate Splitting Multiple Access (RSMA) is a code division multi-access technique which can achieve any base in the multi-access capacity polymatroid without high coding complexity or synchronization among the transmitting users. In this paper, a practical algorithm is proposed to compute the splitting coefficients and the successive decoding order of virtual users in Gaussian RSMA transmission. Based on the proposed algorithm, a deterministic mapping is built between the system parameters and the objective rate tuple for RSMA. As a result, the application of the RSMA technique becomes possible ","authors_text":"Huifang Chen, Peiliang Qiu, Xiaomao Mao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-12T03:07:12Z","title":"An Algorithm to Realize Rate-Splitting in Gaussian Multi-access Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03663","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:49ff2a6d30a7d8e972c6ea0338ea155ed97975f24d856d53e7b892f6209d456a","target":"record","created_at":"2026-05-18T01:09:12Z","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":"e5175aa90e3c69a2e71894443d9385f15e0f30d4375c02f808cd209608dceebc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-12T03:07:12Z","title_canon_sha256":"1ab8306ed4b1a700d6f2743b7aeed4481d8536e9c0b7ca0aef626f6f4ad13618"},"schema_version":"1.0","source":{"id":"1608.03663","kind":"arxiv","version":1}},"canonical_sha256":"5224d79b0fd9747a3198d28f817db148148c09833eccb95dbdacf1e560901b0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5224d79b0fd9747a3198d28f817db148148c09833eccb95dbdacf1e560901b0e","first_computed_at":"2026-05-18T01:09:12.177184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:12.177184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s39LoW694D7jPCPa33i7U+sgG3lYjGIAdMlVhbTQ9wCEIytAtMIuwCCWuGsFME33aSunfg1zQJhXHa9eihItCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:12.177867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03663","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49ff2a6d30a7d8e972c6ea0338ea155ed97975f24d856d53e7b892f6209d456a","sha256:5e4affb028ec9c951478cd0f0f4d91536bede6d087f390a49b9e29e3efdda1d5"],"state_sha256":"1227210339d49376a60c553823069b9c8589ebf0517856aa55f43b17b32a1279"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mh2BQ0vm/QDC2kTzYhBzMJ1Titf1doSatWQ5TzrXAWT+OxGRoho8Ygc62MGDCvqGh0B+MgF66SACGwKUw9/ECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T17:58:36.292881Z","bundle_sha256":"fc7b2362316ed77461e17314c7372377c9648573005041d8e6bb633a49d11c33"}}