{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IMKPACKNJ3622I76G2Q2RNKIUD","short_pith_number":"pith:IMKPACKN","schema_version":"1.0","canonical_sha256":"4314f0094d4efdad23fe36a1a8b548a0f74952a36d5ff2be4ba9bc4f00b536d7","source":{"kind":"arxiv","id":"1903.03377","version":1},"attestation_state":"computed","paper":{"title":"An Approximate Solution for Symbol-Level Multiuser Precoding Using Support Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Alireza Haqiqatnejad, Bjorn Ottersten, Farbod Kayhan","submitted_at":"2019-03-08T11:33:13Z","abstract_excerpt":"In this paper, we propose a low-complexity method to approximately solve the SINR-constrained optimization problem of symbol-level precoding (SLP). First, assuming a generic modulation scheme, the precoding optimization problem is recast as a standard non-negative least squares (NNLS). Then, we improve an existing closed-form SLP (CF-SLP) scheme using the conditions for nearly perfect recovery of the optimal solution support, followed by solving a reduced system of linear equations. We show through simulation results that in comparison with the CF-SLP method, the improved approximate solution "},"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":"1903.03377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-03-08T11:33:13Z","cross_cats_sorted":[],"title_canon_sha256":"791083957d837ee689342946cd39a3100a1e944f2fc88c42bfa731a696674964","abstract_canon_sha256":"00f3e32d6277d82702b4976a1195f272e07a5df23f9161e77f9b2bdca24b7870"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:45.673342Z","signature_b64":"P4H10ljQhT9/IxWXEbb/TrfCcj/p3boOmNotFllCbR8XpnLBP4PXQ9F36uPuuv7OIdjIn2MGCKvgdYksDgLdCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4314f0094d4efdad23fe36a1a8b548a0f74952a36d5ff2be4ba9bc4f00b536d7","last_reissued_at":"2026-05-17T23:51:45.672742Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:45.672742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Approximate Solution for Symbol-Level Multiuser Precoding Using Support Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Alireza Haqiqatnejad, Bjorn Ottersten, Farbod Kayhan","submitted_at":"2019-03-08T11:33:13Z","abstract_excerpt":"In this paper, we propose a low-complexity method to approximately solve the SINR-constrained optimization problem of symbol-level precoding (SLP). First, assuming a generic modulation scheme, the precoding optimization problem is recast as a standard non-negative least squares (NNLS). Then, we improve an existing closed-form SLP (CF-SLP) scheme using the conditions for nearly perfect recovery of the optimal solution support, followed by solving a reduced system of linear equations. We show through simulation results that in comparison with the CF-SLP method, the improved approximate solution "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03377","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":"1903.03377","created_at":"2026-05-17T23:51:45.672836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.03377v1","created_at":"2026-05-17T23:51:45.672836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03377","created_at":"2026-05-17T23:51:45.672836+00:00"},{"alias_kind":"pith_short_12","alias_value":"IMKPACKNJ362","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IMKPACKNJ3622I76","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IMKPACKN","created_at":"2026-05-18T12:33:18.533446+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/IMKPACKNJ3622I76G2Q2RNKIUD","json":"https://pith.science/pith/IMKPACKNJ3622I76G2Q2RNKIUD.json","graph_json":"https://pith.science/api/pith-number/IMKPACKNJ3622I76G2Q2RNKIUD/graph.json","events_json":"https://pith.science/api/pith-number/IMKPACKNJ3622I76G2Q2RNKIUD/events.json","paper":"https://pith.science/paper/IMKPACKN"},"agent_actions":{"view_html":"https://pith.science/pith/IMKPACKNJ3622I76G2Q2RNKIUD","download_json":"https://pith.science/pith/IMKPACKNJ3622I76G2Q2RNKIUD.json","view_paper":"https://pith.science/paper/IMKPACKN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.03377&json=true","fetch_graph":"https://pith.science/api/pith-number/IMKPACKNJ3622I76G2Q2RNKIUD/graph.json","fetch_events":"https://pith.science/api/pith-number/IMKPACKNJ3622I76G2Q2RNKIUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IMKPACKNJ3622I76G2Q2RNKIUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IMKPACKNJ3622I76G2Q2RNKIUD/action/storage_attestation","attest_author":"https://pith.science/pith/IMKPACKNJ3622I76G2Q2RNKIUD/action/author_attestation","sign_citation":"https://pith.science/pith/IMKPACKNJ3622I76G2Q2RNKIUD/action/citation_signature","submit_replication":"https://pith.science/pith/IMKPACKNJ3622I76G2Q2RNKIUD/action/replication_record"}},"created_at":"2026-05-17T23:51:45.672836+00:00","updated_at":"2026-05-17T23:51:45.672836+00:00"}