{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JY7BOUSPB6Z2B6ZDM4ZC45EQGG","short_pith_number":"pith:JY7BOUSP","schema_version":"1.0","canonical_sha256":"4e3e17524f0fb3a0fb2367322e749031b3ee4f8a784656c36298e9e301824907","source":{"kind":"arxiv","id":"1712.08735","version":2},"attestation_state":"computed","paper":{"title":"Quantized Precoding for Multi-Antenna Downlink Channels with MAGIQ","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrei Nedelcu, Fabian Steiner, Gerhard Kramer, Markus Staudacher, Paolo Baracca, Rakash SivaSiva Ganesan, Stefan Wesemann, Wolfgang Zirwas","submitted_at":"2017-12-23T08:24:44Z","abstract_excerpt":"A multi-antenna, greedy, iterative, and quantized (MAGIQ) precoding algorithm is proposed for downlink channels. MAGIQ allows a straightforward integration with orthogonal frequency-division multiplexing (OFDM). MAGIQ is compared to three existing algorithms in terms of information rates and complexity: quantized linear precoding (QLP), SQUID, and an ADMM-based algorithm. The information rate is measured by using a lower bound for finite modulation sets, and the complexity is measured by the number of multiplications and comparisons. MAGIQ and ADMM achieve similar information rates with simila"},"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":"1712.08735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-23T08:24:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7fb273afccc9baa8bdf80ff121374e1a9b8faf5fa0c0aff940b2e2fdaa1d6545","abstract_canon_sha256":"11abe8bcbb8516c2ab49377fe7efa3481e503b6e112cec893762149ecd1ccfa8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:10.437671Z","signature_b64":"pMgdG+qN3b/TM3GHLLkOJv7WgObU26dA7WrhkroLqxVfLgcaDIYRgPMejiM/sLolkXdP0VO4b8AmVczAwCuRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e3e17524f0fb3a0fb2367322e749031b3ee4f8a784656c36298e9e301824907","last_reissued_at":"2026-05-18T00:22:10.436986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:10.436986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantized Precoding for Multi-Antenna Downlink Channels with MAGIQ","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrei Nedelcu, Fabian Steiner, Gerhard Kramer, Markus Staudacher, Paolo Baracca, Rakash SivaSiva Ganesan, Stefan Wesemann, Wolfgang Zirwas","submitted_at":"2017-12-23T08:24:44Z","abstract_excerpt":"A multi-antenna, greedy, iterative, and quantized (MAGIQ) precoding algorithm is proposed for downlink channels. MAGIQ allows a straightforward integration with orthogonal frequency-division multiplexing (OFDM). MAGIQ is compared to three existing algorithms in terms of information rates and complexity: quantized linear precoding (QLP), SQUID, and an ADMM-based algorithm. The information rate is measured by using a lower bound for finite modulation sets, and the complexity is measured by the number of multiplications and comparisons. MAGIQ and ADMM achieve similar information rates with simila"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08735","kind":"arxiv","version":2},"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":"1712.08735","created_at":"2026-05-18T00:22:10.437069+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.08735v2","created_at":"2026-05-18T00:22:10.437069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08735","created_at":"2026-05-18T00:22:10.437069+00:00"},{"alias_kind":"pith_short_12","alias_value":"JY7BOUSPB6Z2","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JY7BOUSPB6Z2B6ZD","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JY7BOUSP","created_at":"2026-05-18T12:31:24.725408+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/JY7BOUSPB6Z2B6ZDM4ZC45EQGG","json":"https://pith.science/pith/JY7BOUSPB6Z2B6ZDM4ZC45EQGG.json","graph_json":"https://pith.science/api/pith-number/JY7BOUSPB6Z2B6ZDM4ZC45EQGG/graph.json","events_json":"https://pith.science/api/pith-number/JY7BOUSPB6Z2B6ZDM4ZC45EQGG/events.json","paper":"https://pith.science/paper/JY7BOUSP"},"agent_actions":{"view_html":"https://pith.science/pith/JY7BOUSPB6Z2B6ZDM4ZC45EQGG","download_json":"https://pith.science/pith/JY7BOUSPB6Z2B6ZDM4ZC45EQGG.json","view_paper":"https://pith.science/paper/JY7BOUSP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.08735&json=true","fetch_graph":"https://pith.science/api/pith-number/JY7BOUSPB6Z2B6ZDM4ZC45EQGG/graph.json","fetch_events":"https://pith.science/api/pith-number/JY7BOUSPB6Z2B6ZDM4ZC45EQGG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JY7BOUSPB6Z2B6ZDM4ZC45EQGG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JY7BOUSPB6Z2B6ZDM4ZC45EQGG/action/storage_attestation","attest_author":"https://pith.science/pith/JY7BOUSPB6Z2B6ZDM4ZC45EQGG/action/author_attestation","sign_citation":"https://pith.science/pith/JY7BOUSPB6Z2B6ZDM4ZC45EQGG/action/citation_signature","submit_replication":"https://pith.science/pith/JY7BOUSPB6Z2B6ZDM4ZC45EQGG/action/replication_record"}},"created_at":"2026-05-18T00:22:10.437069+00:00","updated_at":"2026-05-18T00:22:10.437069+00:00"}