{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OFGJSQQ67NWL6RFIEPSWERIFUW","short_pith_number":"pith:OFGJSQQ6","schema_version":"1.0","canonical_sha256":"714c99421efb6cbf44a823e5624505a5acbcf7cadc877c1d37a33c0a416e57d4","source":{"kind":"arxiv","id":"1807.10619","version":1},"attestation_state":"computed","paper":{"title":"Power Minimizer Symbol-Level Precoding: A Closed-Form Sub-Optimal Solution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"A. Haqiqatnejad, B. Ottersten, F. Kayhan","submitted_at":"2018-07-27T13:41:00Z","abstract_excerpt":"In this letter, we study the optimal solution of the multiuser symbol-level precoding (SLP) for minimization of the total transmit power under given signal-to-interference-plus-noise ratio (SINR) constraints. Adopting the distance preserving constructive interference regions (DPCIR), we first derive a simplified reformulation of the problem. Then, we analyze the structure of the optimal solution using the Karush-Kuhn-Tucker (KKT) optimality conditions, thereby we obtain the necessary and sufficient condition under which the power minimizer SLP is equivalent to the conventional zero-forcing bea"},"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":"1807.10619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-07-27T13:41:00Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c5464b8c43b695f457b3cc62508dfa66f8208f20227fcef1099e8a7adc14180d","abstract_canon_sha256":"52a69d65695f28532ffb8dfb4de2e38db90821c90946046b2ec8bd24d5e0382d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:39.989122Z","signature_b64":"jnKuUeyhLjWt2FQpSNWOhBTeA6Xz9hQaBWNGj+dVPN3WQxRJFPUIHexZ0Lkn5lvmDPLvGUX9coZ+vY0F1ml6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"714c99421efb6cbf44a823e5624505a5acbcf7cadc877c1d37a33c0a416e57d4","last_reissued_at":"2026-05-18T00:09:39.988458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:39.988458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Power Minimizer Symbol-Level Precoding: A Closed-Form Sub-Optimal Solution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"A. Haqiqatnejad, B. Ottersten, F. Kayhan","submitted_at":"2018-07-27T13:41:00Z","abstract_excerpt":"In this letter, we study the optimal solution of the multiuser symbol-level precoding (SLP) for minimization of the total transmit power under given signal-to-interference-plus-noise ratio (SINR) constraints. Adopting the distance preserving constructive interference regions (DPCIR), we first derive a simplified reformulation of the problem. Then, we analyze the structure of the optimal solution using the Karush-Kuhn-Tucker (KKT) optimality conditions, thereby we obtain the necessary and sufficient condition under which the power minimizer SLP is equivalent to the conventional zero-forcing bea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10619","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":"1807.10619","created_at":"2026-05-18T00:09:39.988565+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.10619v1","created_at":"2026-05-18T00:09:39.988565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10619","created_at":"2026-05-18T00:09:39.988565+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFGJSQQ67NWL","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFGJSQQ67NWL6RFI","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFGJSQQ6","created_at":"2026-05-18T12:32:43.782077+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/OFGJSQQ67NWL6RFIEPSWERIFUW","json":"https://pith.science/pith/OFGJSQQ67NWL6RFIEPSWERIFUW.json","graph_json":"https://pith.science/api/pith-number/OFGJSQQ67NWL6RFIEPSWERIFUW/graph.json","events_json":"https://pith.science/api/pith-number/OFGJSQQ67NWL6RFIEPSWERIFUW/events.json","paper":"https://pith.science/paper/OFGJSQQ6"},"agent_actions":{"view_html":"https://pith.science/pith/OFGJSQQ67NWL6RFIEPSWERIFUW","download_json":"https://pith.science/pith/OFGJSQQ67NWL6RFIEPSWERIFUW.json","view_paper":"https://pith.science/paper/OFGJSQQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.10619&json=true","fetch_graph":"https://pith.science/api/pith-number/OFGJSQQ67NWL6RFIEPSWERIFUW/graph.json","fetch_events":"https://pith.science/api/pith-number/OFGJSQQ67NWL6RFIEPSWERIFUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFGJSQQ67NWL6RFIEPSWERIFUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFGJSQQ67NWL6RFIEPSWERIFUW/action/storage_attestation","attest_author":"https://pith.science/pith/OFGJSQQ67NWL6RFIEPSWERIFUW/action/author_attestation","sign_citation":"https://pith.science/pith/OFGJSQQ67NWL6RFIEPSWERIFUW/action/citation_signature","submit_replication":"https://pith.science/pith/OFGJSQQ67NWL6RFIEPSWERIFUW/action/replication_record"}},"created_at":"2026-05-18T00:09:39.988565+00:00","updated_at":"2026-05-18T00:09:39.988565+00:00"}