{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SK3WDDJLHEPEHFDTV564UHFQ4Q","short_pith_number":"pith:SK3WDDJL","canonical_record":{"source":{"id":"1905.08037","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2019-05-14T08:57:33Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"a6ab200ecd282a62a56ab0f5cb4f4b3c6ad9b441281cb142d97971df16d6c686","abstract_canon_sha256":"42e5bb2210717e543ff409315f29cd2067ac7b60ba795060caac18e885fc6ef1"},"schema_version":"1.0"},"canonical_sha256":"92b7618d2b391e439473af7dca1cb0e4327c99e1aa60708e175fb2c821383c88","source":{"kind":"arxiv","id":"1905.08037","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08037","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08037v1","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08037","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"SK3WDDJLHEPE","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SK3WDDJLHEPEHFDT","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SK3WDDJL","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SK3WDDJLHEPEHFDTV564UHFQ4Q","target":"record","payload":{"canonical_record":{"source":{"id":"1905.08037","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2019-05-14T08:57:33Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"a6ab200ecd282a62a56ab0f5cb4f4b3c6ad9b441281cb142d97971df16d6c686","abstract_canon_sha256":"42e5bb2210717e543ff409315f29cd2067ac7b60ba795060caac18e885fc6ef1"},"schema_version":"1.0"},"canonical_sha256":"92b7618d2b391e439473af7dca1cb0e4327c99e1aa60708e175fb2c821383c88","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:47.776899Z","signature_b64":"NLXNQ4J8XpzwkF1ioIybW5FUMqZK3OS4n5Xj1gix/gPn9c/ibwsPZzR7HAmyQmC7R8qXpHHkbOsH9YZEGVGWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92b7618d2b391e439473af7dca1cb0e4327c99e1aa60708e175fb2c821383c88","last_reissued_at":"2026-05-17T23:45:47.776372Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:47.776372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.08037","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-17T23:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BTlnRm14TLfc4ly0HyPjfuU+ZVxU5Xh8Mcr6PzEWbLCoQ/NWIgn6Y1qlHQRUQJ+7bWJqjbbQKaczbOPHHcUeCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T00:55:13.718850Z"},"content_sha256":"c750c2037286d710ea57148d817baa8ef314277b02c261f9a3f637d66ac39e27","schema_version":"1.0","event_id":"sha256:c750c2037286d710ea57148d817baa8ef314277b02c261f9a3f637d66ac39e27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SK3WDDJLHEPEHFDTV564UHFQ4Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Estimating Maximum Sum Rate of MIMO Systems with Successive Zero-Forcing Dirty Paper Coding and Per-antenna Power Constraint","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Le-Nam Tran, Ronan Farrell, Thuy M. Pham","submitted_at":"2019-05-14T08:57:33Z","abstract_excerpt":"In this paper, we study the sum rate maximization for successive zero-forcing dirty-paper coding (SZFDPC) with per-antenna power constraint (PAPC). Although SZFDPC is a low-complexity alternative to the optimal dirty paper coding (DPC), efficient algorithms to compute its sum rate are still open problems especially under practical PAPC. The existing solution to the considered problem is computationally inefficient due to employing high-complexity interior-point method. In this study, we propose two new low-complexity approaches to this important problem. More specifically, the first algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08037","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-17T23:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x9+1hu4wh3ApFRbyUjqqsm1aZdl4u4C3/hGU1ZKHgl247fvc3c/P3fpUDaMXMXJh1gCfYQODoMmDVc+u91fsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T00:55:13.719358Z"},"content_sha256":"b4697eac747d5264f2fe9291ede388fd98beeeee35c18bbcccf6a60cceef28c2","schema_version":"1.0","event_id":"sha256:b4697eac747d5264f2fe9291ede388fd98beeeee35c18bbcccf6a60cceef28c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SK3WDDJLHEPEHFDTV564UHFQ4Q/bundle.json","state_url":"https://pith.science/pith/SK3WDDJLHEPEHFDTV564UHFQ4Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SK3WDDJLHEPEHFDTV564UHFQ4Q/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-08-14T00:55:13Z","links":{"resolver":"https://pith.science/pith/SK3WDDJLHEPEHFDTV564UHFQ4Q","bundle":"https://pith.science/pith/SK3WDDJLHEPEHFDTV564UHFQ4Q/bundle.json","state":"https://pith.science/pith/SK3WDDJLHEPEHFDTV564UHFQ4Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SK3WDDJLHEPEHFDTV564UHFQ4Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SK3WDDJLHEPEHFDTV564UHFQ4Q","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":"42e5bb2210717e543ff409315f29cd2067ac7b60ba795060caac18e885fc6ef1","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2019-05-14T08:57:33Z","title_canon_sha256":"a6ab200ecd282a62a56ab0f5cb4f4b3c6ad9b441281cb142d97971df16d6c686"},"schema_version":"1.0","source":{"id":"1905.08037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08037","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08037v1","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08037","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"SK3WDDJLHEPE","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SK3WDDJLHEPEHFDT","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SK3WDDJL","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:b4697eac747d5264f2fe9291ede388fd98beeeee35c18bbcccf6a60cceef28c2","target":"graph","created_at":"2026-05-17T23:45:47Z","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":"In this paper, we study the sum rate maximization for successive zero-forcing dirty-paper coding (SZFDPC) with per-antenna power constraint (PAPC). Although SZFDPC is a low-complexity alternative to the optimal dirty paper coding (DPC), efficient algorithms to compute its sum rate are still open problems especially under practical PAPC. The existing solution to the considered problem is computationally inefficient due to employing high-complexity interior-point method. In this study, we propose two new low-complexity approaches to this important problem. More specifically, the first algorithm ","authors_text":"Le-Nam Tran, Ronan Farrell, Thuy M. Pham","cross_cats":["cs.LG","math.IT","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2019-05-14T08:57:33Z","title":"On Estimating Maximum Sum Rate of MIMO Systems with Successive Zero-Forcing Dirty Paper Coding and Per-antenna Power Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08037","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:c750c2037286d710ea57148d817baa8ef314277b02c261f9a3f637d66ac39e27","target":"record","created_at":"2026-05-17T23:45:47Z","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":"42e5bb2210717e543ff409315f29cd2067ac7b60ba795060caac18e885fc6ef1","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2019-05-14T08:57:33Z","title_canon_sha256":"a6ab200ecd282a62a56ab0f5cb4f4b3c6ad9b441281cb142d97971df16d6c686"},"schema_version":"1.0","source":{"id":"1905.08037","kind":"arxiv","version":1}},"canonical_sha256":"92b7618d2b391e439473af7dca1cb0e4327c99e1aa60708e175fb2c821383c88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92b7618d2b391e439473af7dca1cb0e4327c99e1aa60708e175fb2c821383c88","first_computed_at":"2026-05-17T23:45:47.776372Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:47.776372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NLXNQ4J8XpzwkF1ioIybW5FUMqZK3OS4n5Xj1gix/gPn9c/ibwsPZzR7HAmyQmC7R8qXpHHkbOsH9YZEGVGWBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:47.776899Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c750c2037286d710ea57148d817baa8ef314277b02c261f9a3f637d66ac39e27","sha256:b4697eac747d5264f2fe9291ede388fd98beeeee35c18bbcccf6a60cceef28c2"],"state_sha256":"187e972df110f940b383d140659475178bb08c05e6997c660f6c916fa73e8d23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nvK0Q5AOC8NXebdEBsjc4bTsh6w+3ho6Bh4g037O4cBMRdQA3PcqQBvVHPkitc+XvKUvDIdxkVLr1q/DtPb5Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T00:55:13.799009Z","bundle_sha256":"658149fadb98f102a4ba2fbe4ed937b6431cf84f27f76d50a84f37651d0eb213"}}