{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:COZYJOYT3TZVHEH7KYSMLNYLVY","short_pith_number":"pith:COZYJOYT","canonical_record":{"source":{"id":"1601.05105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-19T21:34:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"715606475f3b78a529bec72660a4579179b757523eaea1ddd8000fa7196720d5","abstract_canon_sha256":"a37290e78038ac90975fc54076058fc967b22b1553a9ad4249ec18d1b9e946c7"},"schema_version":"1.0"},"canonical_sha256":"13b384bb13dcf35390ff5624c5b70bae2c4bda6038d595588083a73765fb8c50","source":{"kind":"arxiv","id":"1601.05105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05105","created_at":"2026-05-18T01:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05105v1","created_at":"2026-05-18T01:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05105","created_at":"2026-05-18T01:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"COZYJOYT3TZV","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"COZYJOYT3TZVHEH7","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"COZYJOYT","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:COZYJOYT3TZVHEH7KYSMLNYLVY","target":"record","payload":{"canonical_record":{"source":{"id":"1601.05105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-19T21:34:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"715606475f3b78a529bec72660a4579179b757523eaea1ddd8000fa7196720d5","abstract_canon_sha256":"a37290e78038ac90975fc54076058fc967b22b1553a9ad4249ec18d1b9e946c7"},"schema_version":"1.0"},"canonical_sha256":"13b384bb13dcf35390ff5624c5b70bae2c4bda6038d595588083a73765fb8c50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:16.158080Z","signature_b64":"6NEDanT583xd6VBaz2mQmuuJddOGBXPASa/yqPerfIoRZj+aysFn5tkKKgYyhJ/RLfWht5wpi2pIoN27vIGrBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13b384bb13dcf35390ff5624c5b70bae2c4bda6038d595588083a73765fb8c50","last_reissued_at":"2026-05-18T01:22:16.157175Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:16.157175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.05105","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:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+DOkcSccRjVJT6oAJaEWpygcWhP69l2FGD9wX78DBAAY5/0LPavF+yTsRTksyCsURbERhFS+Ea/mWN0TCoQoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:12:22.472464Z"},"content_sha256":"38e2c32d7bfb2867cfb2b70c256afbff56148797bc2e60caebf9e5ac51f73347","schema_version":"1.0","event_id":"sha256:38e2c32d7bfb2867cfb2b70c256afbff56148797bc2e60caebf9e5ac51f73347"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:COZYJOYT3TZVHEH7KYSMLNYLVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Rate-Splitting Approach To Robust Multiuser MISO Transmission","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bruno Clerckx, Hamdi Joudeh","submitted_at":"2016-01-19T21:34:44Z","abstract_excerpt":"For multiuser MISO systems with bounded uncertainties in the Channel State Information (CSI), we consider two classical robust design problems: maximizing the minimum rate subject to a transmit power constraint, and power minimization under a rate constraint. Contrary to conventional strategies, we propose a Rate-Splitting (RS) strategy where each message is divided into two parts, a common part and a private part. All common parts are packed into one super common message encoded using a shared codebook and decoded by all users, while private parts are independently encoded and retrieved by th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05105","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:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O0xd89XiUVForWxYoEpa/B4Uksj4/C0+f6sWY0jnaEsH3brruuse9m9yaZHG0Xfhe4BHnWMtVSMAxXXq4TvHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:12:22.472820Z"},"content_sha256":"205333f98693dec6d0ffc051c2e419e79e5e7ef0e3e843cf12faf6023dfd5205","schema_version":"1.0","event_id":"sha256:205333f98693dec6d0ffc051c2e419e79e5e7ef0e3e843cf12faf6023dfd5205"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/COZYJOYT3TZVHEH7KYSMLNYLVY/bundle.json","state_url":"https://pith.science/pith/COZYJOYT3TZVHEH7KYSMLNYLVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/COZYJOYT3TZVHEH7KYSMLNYLVY/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-26T03:12:22Z","links":{"resolver":"https://pith.science/pith/COZYJOYT3TZVHEH7KYSMLNYLVY","bundle":"https://pith.science/pith/COZYJOYT3TZVHEH7KYSMLNYLVY/bundle.json","state":"https://pith.science/pith/COZYJOYT3TZVHEH7KYSMLNYLVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/COZYJOYT3TZVHEH7KYSMLNYLVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:COZYJOYT3TZVHEH7KYSMLNYLVY","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":"a37290e78038ac90975fc54076058fc967b22b1553a9ad4249ec18d1b9e946c7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-19T21:34:44Z","title_canon_sha256":"715606475f3b78a529bec72660a4579179b757523eaea1ddd8000fa7196720d5"},"schema_version":"1.0","source":{"id":"1601.05105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05105","created_at":"2026-05-18T01:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05105v1","created_at":"2026-05-18T01:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05105","created_at":"2026-05-18T01:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"COZYJOYT3TZV","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"COZYJOYT3TZVHEH7","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"COZYJOYT","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:205333f98693dec6d0ffc051c2e419e79e5e7ef0e3e843cf12faf6023dfd5205","target":"graph","created_at":"2026-05-18T01:22:16Z","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":"For multiuser MISO systems with bounded uncertainties in the Channel State Information (CSI), we consider two classical robust design problems: maximizing the minimum rate subject to a transmit power constraint, and power minimization under a rate constraint. Contrary to conventional strategies, we propose a Rate-Splitting (RS) strategy where each message is divided into two parts, a common part and a private part. All common parts are packed into one super common message encoded using a shared codebook and decoded by all users, while private parts are independently encoded and retrieved by th","authors_text":"Bruno Clerckx, Hamdi Joudeh","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-19T21:34:44Z","title":"A Rate-Splitting Approach To Robust Multiuser MISO Transmission"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05105","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:38e2c32d7bfb2867cfb2b70c256afbff56148797bc2e60caebf9e5ac51f73347","target":"record","created_at":"2026-05-18T01:22:16Z","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":"a37290e78038ac90975fc54076058fc967b22b1553a9ad4249ec18d1b9e946c7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-19T21:34:44Z","title_canon_sha256":"715606475f3b78a529bec72660a4579179b757523eaea1ddd8000fa7196720d5"},"schema_version":"1.0","source":{"id":"1601.05105","kind":"arxiv","version":1}},"canonical_sha256":"13b384bb13dcf35390ff5624c5b70bae2c4bda6038d595588083a73765fb8c50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13b384bb13dcf35390ff5624c5b70bae2c4bda6038d595588083a73765fb8c50","first_computed_at":"2026-05-18T01:22:16.157175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:16.157175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6NEDanT583xd6VBaz2mQmuuJddOGBXPASa/yqPerfIoRZj+aysFn5tkKKgYyhJ/RLfWht5wpi2pIoN27vIGrBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:16.158080Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38e2c32d7bfb2867cfb2b70c256afbff56148797bc2e60caebf9e5ac51f73347","sha256:205333f98693dec6d0ffc051c2e419e79e5e7ef0e3e843cf12faf6023dfd5205"],"state_sha256":"7e0c1e55e2739a6199077e77f7f3a4ba4dd22adc01ccdf1c00e48a607fd92d9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OZmm9wP8oWNUsYLqT3eQ8WOgEMqNNruUibVAx+dYPq7BfxWuTpEDPUH1ItefkXcYhfHFpwIZqToafM/r5uuFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T03:12:22.474791Z","bundle_sha256":"af622bcdbc9f6d9131d4a01b093a32c20c85098b89cc01fef69ffa01942fc2f4"}}