{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OFGJSQQ67NWL6RFIEPSWERIFUW","short_pith_number":"pith:OFGJSQQ6","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"},"canonical_sha256":"714c99421efb6cbf44a823e5624505a5acbcf7cadc877c1d37a33c0a416e57d4","source":{"kind":"arxiv","id":"1807.10619","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10619","created_at":"2026-05-18T00:09:39Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10619v1","created_at":"2026-05-18T00:09:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10619","created_at":"2026-05-18T00:09:39Z"},{"alias_kind":"pith_short_12","alias_value":"OFGJSQQ67NWL","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OFGJSQQ67NWL6RFI","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OFGJSQQ6","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OFGJSQQ67NWL6RFIEPSWERIFUW","target":"record","payload":{"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"},"canonical_sha256":"714c99421efb6cbf44a823e5624505a5acbcf7cadc877c1d37a33c0a416e57d4","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"},"source_kind":"arxiv","source_id":"1807.10619","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-18T00:09:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5IpfY3BHVD1TG/UkUDuhw+ciYIlja0a/CMd9mwVlzYedsMdlUO7C3sOZAA+iInMPmcAJa0UB/WTy65y+ds6mCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:44:29.526548Z"},"content_sha256":"4da1d7a4b1fcc5f061851d24469f234f1555c793f0ff3620b7de9c0fa123289c","schema_version":"1.0","event_id":"sha256:4da1d7a4b1fcc5f061851d24469f234f1555c793f0ff3620b7de9c0fa123289c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OFGJSQQ67NWL6RFIEPSWERIFUW","target":"graph","payload":{"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"},"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-18T00:09:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5efyCkHaROxBCZCyPIMcsHT+FA42jfadY7mdueLnvtbx6cZA+sEjenX79x/Kn3ANyK6VFAJ355qvnT2dHfU7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:44:29.527248Z"},"content_sha256":"b06d0eb1d3fe38c51219f97395bb1e75a8e8951906854180730e6e281c8d3dd4","schema_version":"1.0","event_id":"sha256:b06d0eb1d3fe38c51219f97395bb1e75a8e8951906854180730e6e281c8d3dd4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFGJSQQ67NWL6RFIEPSWERIFUW/bundle.json","state_url":"https://pith.science/pith/OFGJSQQ67NWL6RFIEPSWERIFUW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFGJSQQ67NWL6RFIEPSWERIFUW/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-05-25T15:44:29Z","links":{"resolver":"https://pith.science/pith/OFGJSQQ67NWL6RFIEPSWERIFUW","bundle":"https://pith.science/pith/OFGJSQQ67NWL6RFIEPSWERIFUW/bundle.json","state":"https://pith.science/pith/OFGJSQQ67NWL6RFIEPSWERIFUW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFGJSQQ67NWL6RFIEPSWERIFUW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OFGJSQQ67NWL6RFIEPSWERIFUW","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":"52a69d65695f28532ffb8dfb4de2e38db90821c90946046b2ec8bd24d5e0382d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-07-27T13:41:00Z","title_canon_sha256":"c5464b8c43b695f457b3cc62508dfa66f8208f20227fcef1099e8a7adc14180d"},"schema_version":"1.0","source":{"id":"1807.10619","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10619","created_at":"2026-05-18T00:09:39Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10619v1","created_at":"2026-05-18T00:09:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10619","created_at":"2026-05-18T00:09:39Z"},{"alias_kind":"pith_short_12","alias_value":"OFGJSQQ67NWL","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OFGJSQQ67NWL6RFI","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OFGJSQQ6","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:b06d0eb1d3fe38c51219f97395bb1e75a8e8951906854180730e6e281c8d3dd4","target":"graph","created_at":"2026-05-18T00:09:39Z","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 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","authors_text":"A. Haqiqatnejad, B. Ottersten, F. Kayhan","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-07-27T13:41:00Z","title":"Power Minimizer Symbol-Level Precoding: A Closed-Form Sub-Optimal Solution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10619","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:4da1d7a4b1fcc5f061851d24469f234f1555c793f0ff3620b7de9c0fa123289c","target":"record","created_at":"2026-05-18T00:09:39Z","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":"52a69d65695f28532ffb8dfb4de2e38db90821c90946046b2ec8bd24d5e0382d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-07-27T13:41:00Z","title_canon_sha256":"c5464b8c43b695f457b3cc62508dfa66f8208f20227fcef1099e8a7adc14180d"},"schema_version":"1.0","source":{"id":"1807.10619","kind":"arxiv","version":1}},"canonical_sha256":"714c99421efb6cbf44a823e5624505a5acbcf7cadc877c1d37a33c0a416e57d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"714c99421efb6cbf44a823e5624505a5acbcf7cadc877c1d37a33c0a416e57d4","first_computed_at":"2026-05-18T00:09:39.988458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:39.988458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jnKuUeyhLjWt2FQpSNWOhBTeA6Xz9hQaBWNGj+dVPN3WQxRJFPUIHexZ0Lkn5lvmDPLvGUX9coZ+vY0F1ml6Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:39.989122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.10619","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4da1d7a4b1fcc5f061851d24469f234f1555c793f0ff3620b7de9c0fa123289c","sha256:b06d0eb1d3fe38c51219f97395bb1e75a8e8951906854180730e6e281c8d3dd4"],"state_sha256":"9db0228a53f9e4cb2d676c65be82e7c2e11f5c887f25d389a9d8590ed0b5d717"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mOcsWVHzKnpHiRdT+VuxXy9qoMj85IN7Pkl4UrmX+VW5Inqeidj6YP2fHpSvCzNWuIMQVhzr8DOQrG3J/YUMCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:44:29.531160Z","bundle_sha256":"9b1c5936ed4f10b1c3700681b119f46f396b704621b9e467747e8662edc85a6d"}}