{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:I3M5PEAXCO6E7UN2CAP54GXWFP","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":"89cca90d06614b6aed41daf4331ada1917e8d5cb64c39f4d6c843a2022a653a3","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-08-24T12:52:49Z","title_canon_sha256":"4d93e256e33b8dfe0d658fe766b41eda4e07f0b245969a2841b90080df6a170d"},"schema_version":"1.0","source":{"id":"2308.12749","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.12749","created_at":"2026-07-05T06:46:07Z"},{"alias_kind":"arxiv_version","alias_value":"2308.12749v2","created_at":"2026-07-05T06:46:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.12749","created_at":"2026-07-05T06:46:07Z"},{"alias_kind":"pith_short_12","alias_value":"I3M5PEAXCO6E","created_at":"2026-07-05T06:46:07Z"},{"alias_kind":"pith_short_16","alias_value":"I3M5PEAXCO6E7UN2","created_at":"2026-07-05T06:46:07Z"},{"alias_kind":"pith_short_8","alias_value":"I3M5PEAX","created_at":"2026-07-05T06:46:07Z"}],"graph_snapshots":[{"event_id":"sha256:c4b2e03b8074664b65419433b076b47aa21f4727e74cdc2e0abdc36429afc226","target":"graph","created_at":"2026-07-05T06:46:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.12749/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Ang Li, Christos Masouros, Xiaoyan Hu, Yiran Wang, Yunsi Wen","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-08-24T12:52:49Z","title":"Block-Level Interference Exploitation Precoding for MU-MISO: An ADMM Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.12749","kind":"arxiv","version":2},"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:082f0ec3a1dd4225b470facea8512d73313bcc9a5a9fc138a30acfddb82eba06","target":"record","created_at":"2026-07-05T06:46:07Z","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":"89cca90d06614b6aed41daf4331ada1917e8d5cb64c39f4d6c843a2022a653a3","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-08-24T12:52:49Z","title_canon_sha256":"4d93e256e33b8dfe0d658fe766b41eda4e07f0b245969a2841b90080df6a170d"},"schema_version":"1.0","source":{"id":"2308.12749","kind":"arxiv","version":2}},"canonical_sha256":"46d9d7901713bc4fd1ba101fde1af62bef6cd197ed11eb9b4a1ba09d3abcb5ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46d9d7901713bc4fd1ba101fde1af62bef6cd197ed11eb9b4a1ba09d3abcb5ba","first_computed_at":"2026-07-05T06:46:07.721119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:46:07.721119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Jbe87oIpLyMLimoJoBrVzopxdkYLD9L/tdQryiVwTHdWyNeeHTeGtwubuxExbfG7AwqYwWXF9KgWXgwcSYqBA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:46:07.721553Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.12749","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:082f0ec3a1dd4225b470facea8512d73313bcc9a5a9fc138a30acfddb82eba06","sha256:c4b2e03b8074664b65419433b076b47aa21f4727e74cdc2e0abdc36429afc226"],"state_sha256":"a8a7a20e68bed81bed712d5f38f73028fb7e67c1a6a98677714d40ab438bf85d"}