{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IMKPACKNJ3622I76G2Q2RNKIUD","short_pith_number":"pith:IMKPACKN","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"},"canonical_sha256":"4314f0094d4efdad23fe36a1a8b548a0f74952a36d5ff2be4ba9bc4f00b536d7","source":{"kind":"arxiv","id":"1903.03377","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03377","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03377v1","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03377","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"pith_short_12","alias_value":"IMKPACKNJ362","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IMKPACKNJ3622I76","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IMKPACKN","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IMKPACKNJ3622I76G2Q2RNKIUD","target":"record","payload":{"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"},"canonical_sha256":"4314f0094d4efdad23fe36a1a8b548a0f74952a36d5ff2be4ba9bc4f00b536d7","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"},"source_kind":"arxiv","source_id":"1903.03377","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fIis/nMAPsVEMqnnVcVG2ag6gZdtEjd18uLznujQMwxXlk8+3adxvTnEarlXP/w40vz7HKUOXXjFvknZCR5fCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:42:56.780629Z"},"content_sha256":"b22cfae46e7b797a35f1391416696af79f1308415ffdec646baedc37351f2072","schema_version":"1.0","event_id":"sha256:b22cfae46e7b797a35f1391416696af79f1308415ffdec646baedc37351f2072"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IMKPACKNJ3622I76G2Q2RNKIUD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E11fwGSFZpTKmorWXi07cpdKzGYP7kb0mWZlnqF7GPyl9Wo2iF481Mofb748LfLIXN/n6RR3qgmF64DGMf4QCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:42:56.780981Z"},"content_sha256":"353569c701cc880055c057d9a2ddb04b78cdbd3b85a230036aa7da7aa3eeecf7","schema_version":"1.0","event_id":"sha256:353569c701cc880055c057d9a2ddb04b78cdbd3b85a230036aa7da7aa3eeecf7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IMKPACKNJ3622I76G2Q2RNKIUD/bundle.json","state_url":"https://pith.science/pith/IMKPACKNJ3622I76G2Q2RNKIUD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IMKPACKNJ3622I76G2Q2RNKIUD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T19:42:56Z","links":{"resolver":"https://pith.science/pith/IMKPACKNJ3622I76G2Q2RNKIUD","bundle":"https://pith.science/pith/IMKPACKNJ3622I76G2Q2RNKIUD/bundle.json","state":"https://pith.science/pith/IMKPACKNJ3622I76G2Q2RNKIUD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IMKPACKNJ3622I76G2Q2RNKIUD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IMKPACKNJ3622I76G2Q2RNKIUD","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":"00f3e32d6277d82702b4976a1195f272e07a5df23f9161e77f9b2bdca24b7870","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-03-08T11:33:13Z","title_canon_sha256":"791083957d837ee689342946cd39a3100a1e944f2fc88c42bfa731a696674964"},"schema_version":"1.0","source":{"id":"1903.03377","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03377","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03377v1","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03377","created_at":"2026-05-17T23:51:45Z"},{"alias_kind":"pith_short_12","alias_value":"IMKPACKNJ362","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IMKPACKNJ3622I76","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IMKPACKN","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:353569c701cc880055c057d9a2ddb04b78cdbd3b85a230036aa7da7aa3eeecf7","target":"graph","created_at":"2026-05-17T23:51:45Z","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"},"paper":{"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 ","authors_text":"Alireza Haqiqatnejad, Bjorn Ottersten, Farbod Kayhan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-03-08T11:33:13Z","title":"An Approximate Solution for Symbol-Level Multiuser Precoding Using Support Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03377","kind":"arxiv","version":1},"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:b22cfae46e7b797a35f1391416696af79f1308415ffdec646baedc37351f2072","target":"record","created_at":"2026-05-17T23:51:45Z","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":"00f3e32d6277d82702b4976a1195f272e07a5df23f9161e77f9b2bdca24b7870","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-03-08T11:33:13Z","title_canon_sha256":"791083957d837ee689342946cd39a3100a1e944f2fc88c42bfa731a696674964"},"schema_version":"1.0","source":{"id":"1903.03377","kind":"arxiv","version":1}},"canonical_sha256":"4314f0094d4efdad23fe36a1a8b548a0f74952a36d5ff2be4ba9bc4f00b536d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4314f0094d4efdad23fe36a1a8b548a0f74952a36d5ff2be4ba9bc4f00b536d7","first_computed_at":"2026-05-17T23:51:45.672742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:45.672742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P4H10ljQhT9/IxWXEbb/TrfCcj/p3boOmNotFllCbR8XpnLBP4PXQ9F36uPuuv7OIdjIn2MGCKvgdYksDgLdCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:45.673342Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.03377","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b22cfae46e7b797a35f1391416696af79f1308415ffdec646baedc37351f2072","sha256:353569c701cc880055c057d9a2ddb04b78cdbd3b85a230036aa7da7aa3eeecf7"],"state_sha256":"d3e30aa64fcf13cf20caf6c1b2e8709faca42a4b2468970f29765d181f7c6de5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nyMjYhCCcQRFIrcKwLTCF5BtYOlIdG32UpGHR/seXjNARzKNAwLq9rxlmyZQRYueo0WTIo0nZc9CKZLKyzYLBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:42:56.782921Z","bundle_sha256":"171de8adac9010e9164ec4de06ebcf26dd5168d6af1215973a84b9bcffdd27ea"}}