{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:I3M5PEAXCO6E7UN2CAP54GXWFP","short_pith_number":"pith:I3M5PEAX","schema_version":"1.0","canonical_sha256":"46d9d7901713bc4fd1ba101fde1af62bef6cd197ed11eb9b4a1ba09d3abcb5ba","source":{"kind":"arxiv","id":"2308.12749","version":2},"attestation_state":"computed","paper":{"title":"Block-Level Interference Exploitation Precoding for MU-MISO: An ADMM Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Ang Li, Christos Masouros, Xiaoyan Hu, Yiran Wang, Yunsi Wen","submitted_at":"2023-08-24T12:52:49Z","abstract_excerpt":"We study constructive interference based block-level precoding (CI-BLP) in the downlink of multi-user multiple-input single-output (MU-MISO) systems. Specifically, our aim is to extend the analysis on CI-BLP to the case where the considered number of symbol slots is smaller than that of the users. To this end, we mathematically prove the feasibility of using the pseudo-inverse to obtain the optimal CI-BLP precoding matrix in a closed form. Similar to the case when the number of users is small, we show that a quadratic programming (QP) optimization on simplex can be constructed. We also design "},"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":"2308.12749","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-08-24T12:52:49Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"4d93e256e33b8dfe0d658fe766b41eda4e07f0b245969a2841b90080df6a170d","abstract_canon_sha256":"89cca90d06614b6aed41daf4331ada1917e8d5cb64c39f4d6c843a2022a653a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:46:07.721553Z","signature_b64":"4Jbe87oIpLyMLimoJoBrVzopxdkYLD9L/tdQryiVwTHdWyNeeHTeGtwubuxExbfG7AwqYwWXF9KgWXgwcSYqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46d9d7901713bc4fd1ba101fde1af62bef6cd197ed11eb9b4a1ba09d3abcb5ba","last_reissued_at":"2026-07-05T06:46:07.721119Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:46:07.721119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Block-Level Interference Exploitation Precoding for MU-MISO: An ADMM Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Ang Li, Christos Masouros, Xiaoyan Hu, Yiran Wang, Yunsi Wen","submitted_at":"2023-08-24T12:52:49Z","abstract_excerpt":"We study constructive interference based block-level precoding (CI-BLP) in the downlink of multi-user multiple-input single-output (MU-MISO) systems. Specifically, our aim is to extend the analysis on CI-BLP to the case where the considered number of symbol slots is smaller than that of the users. To this end, we mathematically prove the feasibility of using the pseudo-inverse to obtain the optimal CI-BLP precoding matrix in a closed form. Similar to the case when the number of users is small, we show that a quadratic programming (QP) optimization on simplex can be constructed. We also design "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.12749","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.12749/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2308.12749","created_at":"2026-07-05T06:46:07.721175+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.12749v2","created_at":"2026-07-05T06:46:07.721175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.12749","created_at":"2026-07-05T06:46:07.721175+00:00"},{"alias_kind":"pith_short_12","alias_value":"I3M5PEAXCO6E","created_at":"2026-07-05T06:46:07.721175+00:00"},{"alias_kind":"pith_short_16","alias_value":"I3M5PEAXCO6E7UN2","created_at":"2026-07-05T06:46:07.721175+00:00"},{"alias_kind":"pith_short_8","alias_value":"I3M5PEAX","created_at":"2026-07-05T06:46:07.721175+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I3M5PEAXCO6E7UN2CAP54GXWFP","json":"https://pith.science/pith/I3M5PEAXCO6E7UN2CAP54GXWFP.json","graph_json":"https://pith.science/api/pith-number/I3M5PEAXCO6E7UN2CAP54GXWFP/graph.json","events_json":"https://pith.science/api/pith-number/I3M5PEAXCO6E7UN2CAP54GXWFP/events.json","paper":"https://pith.science/paper/I3M5PEAX"},"agent_actions":{"view_html":"https://pith.science/pith/I3M5PEAXCO6E7UN2CAP54GXWFP","download_json":"https://pith.science/pith/I3M5PEAXCO6E7UN2CAP54GXWFP.json","view_paper":"https://pith.science/paper/I3M5PEAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.12749&json=true","fetch_graph":"https://pith.science/api/pith-number/I3M5PEAXCO6E7UN2CAP54GXWFP/graph.json","fetch_events":"https://pith.science/api/pith-number/I3M5PEAXCO6E7UN2CAP54GXWFP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I3M5PEAXCO6E7UN2CAP54GXWFP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I3M5PEAXCO6E7UN2CAP54GXWFP/action/storage_attestation","attest_author":"https://pith.science/pith/I3M5PEAXCO6E7UN2CAP54GXWFP/action/author_attestation","sign_citation":"https://pith.science/pith/I3M5PEAXCO6E7UN2CAP54GXWFP/action/citation_signature","submit_replication":"https://pith.science/pith/I3M5PEAXCO6E7UN2CAP54GXWFP/action/replication_record"}},"created_at":"2026-07-05T06:46:07.721175+00:00","updated_at":"2026-07-05T06:46:07.721175+00:00"}