{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EIBBYFXP7R6DEYAG2GXIVNVEA2","short_pith_number":"pith:EIBBYFXP","canonical_record":{"source":{"id":"1602.04345","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-13T15:45:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4eeea994787402f5b71d76e8db4e121f9cbde7ce4ebfed38e7625a4ea35a5e68","abstract_canon_sha256":"47ad1a2b23dad3ae6c02ca6b507d50464bc193dcab42de2535862be13b360764"},"schema_version":"1.0"},"canonical_sha256":"22021c16effc7c326006d1ae8ab6a406be4f1cda9e2f8e1bb894479616c1fed1","source":{"kind":"arxiv","id":"1602.04345","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04345","created_at":"2026-05-18T01:00:39Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04345v3","created_at":"2026-05-18T01:00:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04345","created_at":"2026-05-18T01:00:39Z"},{"alias_kind":"pith_short_12","alias_value":"EIBBYFXP7R6D","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EIBBYFXP7R6DEYAG","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EIBBYFXP","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EIBBYFXP7R6DEYAG2GXIVNVEA2","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04345","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-13T15:45:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4eeea994787402f5b71d76e8db4e121f9cbde7ce4ebfed38e7625a4ea35a5e68","abstract_canon_sha256":"47ad1a2b23dad3ae6c02ca6b507d50464bc193dcab42de2535862be13b360764"},"schema_version":"1.0"},"canonical_sha256":"22021c16effc7c326006d1ae8ab6a406be4f1cda9e2f8e1bb894479616c1fed1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:39.701663Z","signature_b64":"mMz219WYQ38mcoof7ukrUiCrHll3S+asVaRYf6ALy6i6TQKdUuMliKzwv9gKQkyAxQ9N/BWVFvrarj8j+VG+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22021c16effc7c326006d1ae8ab6a406be4f1cda9e2f8e1bb894479616c1fed1","last_reissued_at":"2026-05-18T01:00:39.700984Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:39.700984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04345","source_version":3,"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:00:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uyhYEP0jP25U3SoTYWYe5QC+Komzz/VhygMbvIAiPaYDf2UEgdu2Pr6BC+97HoM1SlbXxiSQe8OCOXqctQX7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T16:44:37.468462Z"},"content_sha256":"551e66406246282d2d73ae5365805ede2979464b764ecbd8601e95ecfa4fa0f8","schema_version":"1.0","event_id":"sha256:551e66406246282d2d73ae5365805ede2979464b764ecbd8601e95ecfa4fa0f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EIBBYFXP7R6DEYAG2GXIVNVEA2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Transmission in Downlink Multiuser MISO Systems: A Rate-Splitting Approach","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-02-13T15:45:05Z","abstract_excerpt":"We consider a downlink multiuser MISO system with bounded errors in the Channel State Information at the Transmitter (CSIT). We first look at the robust design problem of achieving max-min fairness amongst users (in the worst-case sense). Contrary to the conventional approach adopted in literature, we propose a rather unorthodox design based on a Rate-Splitting (RS) strategy. Each user's message is split into two parts, a common part and a private part. All common parts are packed into one super common message encoded using a public codebook, while private parts are independently encoded. The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04345","kind":"arxiv","version":3},"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:00:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1aTetNfr3OV6dcHEcY8xTC6kF8jXEh6p6v2UilZKEj+LO2wxeMtsUioYRKwIyJquiQLXcnHllqBlbXYGPh9DDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T16:44:37.469245Z"},"content_sha256":"a04718f7d182ca6a4288b1dbdc333b014bde47aa79f2b9282a63592dc0a6eda3","schema_version":"1.0","event_id":"sha256:a04718f7d182ca6a4288b1dbdc333b014bde47aa79f2b9282a63592dc0a6eda3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIBBYFXP7R6DEYAG2GXIVNVEA2/bundle.json","state_url":"https://pith.science/pith/EIBBYFXP7R6DEYAG2GXIVNVEA2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIBBYFXP7R6DEYAG2GXIVNVEA2/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-23T16:44:37Z","links":{"resolver":"https://pith.science/pith/EIBBYFXP7R6DEYAG2GXIVNVEA2","bundle":"https://pith.science/pith/EIBBYFXP7R6DEYAG2GXIVNVEA2/bundle.json","state":"https://pith.science/pith/EIBBYFXP7R6DEYAG2GXIVNVEA2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIBBYFXP7R6DEYAG2GXIVNVEA2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EIBBYFXP7R6DEYAG2GXIVNVEA2","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":"47ad1a2b23dad3ae6c02ca6b507d50464bc193dcab42de2535862be13b360764","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-13T15:45:05Z","title_canon_sha256":"4eeea994787402f5b71d76e8db4e121f9cbde7ce4ebfed38e7625a4ea35a5e68"},"schema_version":"1.0","source":{"id":"1602.04345","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04345","created_at":"2026-05-18T01:00:39Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04345v3","created_at":"2026-05-18T01:00:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04345","created_at":"2026-05-18T01:00:39Z"},{"alias_kind":"pith_short_12","alias_value":"EIBBYFXP7R6D","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EIBBYFXP7R6DEYAG","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EIBBYFXP","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:a04718f7d182ca6a4288b1dbdc333b014bde47aa79f2b9282a63592dc0a6eda3","target":"graph","created_at":"2026-05-18T01:00:39Z","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":"We consider a downlink multiuser MISO system with bounded errors in the Channel State Information at the Transmitter (CSIT). We first look at the robust design problem of achieving max-min fairness amongst users (in the worst-case sense). Contrary to the conventional approach adopted in literature, we propose a rather unorthodox design based on a Rate-Splitting (RS) strategy. Each user's message is split into two parts, a common part and a private part. All common parts are packed into one super common message encoded using a public codebook, while private parts are independently encoded. The ","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-02-13T15:45:05Z","title":"Robust Transmission in Downlink Multiuser MISO Systems: A Rate-Splitting Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04345","kind":"arxiv","version":3},"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:551e66406246282d2d73ae5365805ede2979464b764ecbd8601e95ecfa4fa0f8","target":"record","created_at":"2026-05-18T01:00:39Z","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":"47ad1a2b23dad3ae6c02ca6b507d50464bc193dcab42de2535862be13b360764","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-13T15:45:05Z","title_canon_sha256":"4eeea994787402f5b71d76e8db4e121f9cbde7ce4ebfed38e7625a4ea35a5e68"},"schema_version":"1.0","source":{"id":"1602.04345","kind":"arxiv","version":3}},"canonical_sha256":"22021c16effc7c326006d1ae8ab6a406be4f1cda9e2f8e1bb894479616c1fed1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22021c16effc7c326006d1ae8ab6a406be4f1cda9e2f8e1bb894479616c1fed1","first_computed_at":"2026-05-18T01:00:39.700984Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:39.700984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mMz219WYQ38mcoof7ukrUiCrHll3S+asVaRYf6ALy6i6TQKdUuMliKzwv9gKQkyAxQ9N/BWVFvrarj8j+VG+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:39.701663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04345","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:551e66406246282d2d73ae5365805ede2979464b764ecbd8601e95ecfa4fa0f8","sha256:a04718f7d182ca6a4288b1dbdc333b014bde47aa79f2b9282a63592dc0a6eda3"],"state_sha256":"c91095f28098a1c62aa919200b2426a25ea2ac22655b18d9ed5d126c576cc0f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+H59bobWOsttEBPq6cygR0B27kt5Z5vG0yk8K6bFMOtIkTpe2KyX35cw3uQf57aOcQDXCDUSCZQVabP36jmJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T16:44:37.472515Z","bundle_sha256":"8a286be31391dca7d36613daafd220e7de024318e49000e28a192250e231d447"}}