{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TAYZMYSOXGHZL5OCWZPUB63TNO","short_pith_number":"pith:TAYZMYSO","schema_version":"1.0","canonical_sha256":"983196624eb98f95f5c2b65f40fb736b96de3dcf2ec2fd6fba9c84f46caf86ec","source":{"kind":"arxiv","id":"1811.03289","version":1},"attestation_state":"computed","paper":{"title":"Interference Exploitation Precoding for Multi-Level Modulations: Closed-Form Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"A. Lee Swindlehurst, Ang Li, Branka Vucetic, Christos Masouros, Yonghui Li","submitted_at":"2018-11-08T06:33:26Z","abstract_excerpt":"In this paper, we study closed-form interference-exploitation precoding for multi-level modulations in the downlink of multi-user multiple-input single-output (MU-MISO) systems. We consider two distinct cases: first, for the case where the number of served users is not larger than the number of transmit antennas at the base station (BS), we mathematically derive the optimal precoding structure based on the Karush-Kuhn-Tucker (KKT) conditions. By formulating the dual problem, the precoding problem for multi-level modulations is transformed into a pre-scaling operation using quadratic programmin"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1811.03289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-08T06:33:26Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"98e427410bf25ecf856f9b78ba94bc364a45722bd55d6b931f8405974bb98d43","abstract_canon_sha256":"ffdfcc99c68be84da1340fe4c2c99b0f29b6be00be8a8dbbc6137b5c80d01025"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:17.047921Z","signature_b64":"hvTrqGT+juyWcDrU8H9gOpJUM+EYDiDPeTpswIaiEV0sJfts1BpLKEc/4s9RcAhq9t4ZcmSPf7h/WryiITghAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"983196624eb98f95f5c2b65f40fb736b96de3dcf2ec2fd6fba9c84f46caf86ec","last_reissued_at":"2026-05-18T00:01:17.047525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:17.047525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interference Exploitation Precoding for Multi-Level Modulations: Closed-Form Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"A. Lee Swindlehurst, Ang Li, Branka Vucetic, Christos Masouros, Yonghui Li","submitted_at":"2018-11-08T06:33:26Z","abstract_excerpt":"In this paper, we study closed-form interference-exploitation precoding for multi-level modulations in the downlink of multi-user multiple-input single-output (MU-MISO) systems. We consider two distinct cases: first, for the case where the number of served users is not larger than the number of transmit antennas at the base station (BS), we mathematically derive the optimal precoding structure based on the Karush-Kuhn-Tucker (KKT) conditions. By formulating the dual problem, the precoding problem for multi-level modulations is transformed into a pre-scaling operation using quadratic programmin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03289","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.03289","created_at":"2026-05-18T00:01:17.047584+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03289v1","created_at":"2026-05-18T00:01:17.047584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03289","created_at":"2026-05-18T00:01:17.047584+00:00"},{"alias_kind":"pith_short_12","alias_value":"TAYZMYSOXGHZ","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TAYZMYSOXGHZL5OC","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TAYZMYSO","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05530","citing_title":"Interference Exploitation via Symbol-Level Precoding: Overview, State-of-the-Art and Future Directions","ref_index":145,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TAYZMYSOXGHZL5OCWZPUB63TNO","json":"https://pith.science/pith/TAYZMYSOXGHZL5OCWZPUB63TNO.json","graph_json":"https://pith.science/api/pith-number/TAYZMYSOXGHZL5OCWZPUB63TNO/graph.json","events_json":"https://pith.science/api/pith-number/TAYZMYSOXGHZL5OCWZPUB63TNO/events.json","paper":"https://pith.science/paper/TAYZMYSO"},"agent_actions":{"view_html":"https://pith.science/pith/TAYZMYSOXGHZL5OCWZPUB63TNO","download_json":"https://pith.science/pith/TAYZMYSOXGHZL5OCWZPUB63TNO.json","view_paper":"https://pith.science/paper/TAYZMYSO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03289&json=true","fetch_graph":"https://pith.science/api/pith-number/TAYZMYSOXGHZL5OCWZPUB63TNO/graph.json","fetch_events":"https://pith.science/api/pith-number/TAYZMYSOXGHZL5OCWZPUB63TNO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TAYZMYSOXGHZL5OCWZPUB63TNO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TAYZMYSOXGHZL5OCWZPUB63TNO/action/storage_attestation","attest_author":"https://pith.science/pith/TAYZMYSOXGHZL5OCWZPUB63TNO/action/author_attestation","sign_citation":"https://pith.science/pith/TAYZMYSOXGHZL5OCWZPUB63TNO/action/citation_signature","submit_replication":"https://pith.science/pith/TAYZMYSOXGHZL5OCWZPUB63TNO/action/replication_record"}},"created_at":"2026-05-18T00:01:17.047584+00:00","updated_at":"2026-05-18T00:01:17.047584+00:00"}