{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XKJHMLHM4X7MQ5OJ6BF4AF7QJF","short_pith_number":"pith:XKJHMLHM","schema_version":"1.0","canonical_sha256":"ba92762cece5fec875c9f04bc017f04945b96b9928804535bd57a36f17f74c3e","source":{"kind":"arxiv","id":"1804.03233","version":1},"attestation_state":"computed","paper":{"title":"MSE-optimal 1-bit Precoding for Multiuser MIMO via Branch and Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christoph Studer, Giuseppe Durisi, Sven Jacobsson, Weiyu Xu","submitted_at":"2018-04-09T20:53:51Z","abstract_excerpt":"In this paper, we solve the sum mean-squared error (MSE)-optimal 1-bit quantized precoding problem exactly for small-to-moderate sized multiuser multiple-input multiple-output (MU-MIMO) systems via branch and bound. To this end, we reformulate the original NP-hard precoding problem as a tree search and deploy a number of strategies that improve the pruning efficiency without sacrificing optimality. We evaluate the error-rate performance and the complexity of the resulting 1-bit branch-and-bound (BB-1) precoder, and compare its efficacy to that of existing, suboptimal algorithms for 1-bit preco"},"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":"1804.03233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-09T20:53:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"04dc5c2a7e206e80e3a4a6670b5d800c7385c04e5b91e34fbcf62245c75f96f1","abstract_canon_sha256":"46915fce5bbc75ea467961f8bdab58c4da1c95551132f06393174131c4347428"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:56.598823Z","signature_b64":"46cmhXaL3jBA5nMety6QosyGFI72xB/OnJfqQGTo4vvUFlndppkfBF2GcGELiTITKci++n95IY/419oiqMAEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba92762cece5fec875c9f04bc017f04945b96b9928804535bd57a36f17f74c3e","last_reissued_at":"2026-05-18T00:18:56.598283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:56.598283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MSE-optimal 1-bit Precoding for Multiuser MIMO via Branch and Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christoph Studer, Giuseppe Durisi, Sven Jacobsson, Weiyu Xu","submitted_at":"2018-04-09T20:53:51Z","abstract_excerpt":"In this paper, we solve the sum mean-squared error (MSE)-optimal 1-bit quantized precoding problem exactly for small-to-moderate sized multiuser multiple-input multiple-output (MU-MIMO) systems via branch and bound. To this end, we reformulate the original NP-hard precoding problem as a tree search and deploy a number of strategies that improve the pruning efficiency without sacrificing optimality. We evaluate the error-rate performance and the complexity of the resulting 1-bit branch-and-bound (BB-1) precoder, and compare its efficacy to that of existing, suboptimal algorithms for 1-bit preco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03233","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":"1804.03233","created_at":"2026-05-18T00:18:56.598380+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.03233v1","created_at":"2026-05-18T00:18:56.598380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03233","created_at":"2026-05-18T00:18:56.598380+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKJHMLHM4X7M","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKJHMLHM4X7MQ5OJ","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKJHMLHM","created_at":"2026-05-18T12:33:01.666342+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/XKJHMLHM4X7MQ5OJ6BF4AF7QJF","json":"https://pith.science/pith/XKJHMLHM4X7MQ5OJ6BF4AF7QJF.json","graph_json":"https://pith.science/api/pith-number/XKJHMLHM4X7MQ5OJ6BF4AF7QJF/graph.json","events_json":"https://pith.science/api/pith-number/XKJHMLHM4X7MQ5OJ6BF4AF7QJF/events.json","paper":"https://pith.science/paper/XKJHMLHM"},"agent_actions":{"view_html":"https://pith.science/pith/XKJHMLHM4X7MQ5OJ6BF4AF7QJF","download_json":"https://pith.science/pith/XKJHMLHM4X7MQ5OJ6BF4AF7QJF.json","view_paper":"https://pith.science/paper/XKJHMLHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.03233&json=true","fetch_graph":"https://pith.science/api/pith-number/XKJHMLHM4X7MQ5OJ6BF4AF7QJF/graph.json","fetch_events":"https://pith.science/api/pith-number/XKJHMLHM4X7MQ5OJ6BF4AF7QJF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKJHMLHM4X7MQ5OJ6BF4AF7QJF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKJHMLHM4X7MQ5OJ6BF4AF7QJF/action/storage_attestation","attest_author":"https://pith.science/pith/XKJHMLHM4X7MQ5OJ6BF4AF7QJF/action/author_attestation","sign_citation":"https://pith.science/pith/XKJHMLHM4X7MQ5OJ6BF4AF7QJF/action/citation_signature","submit_replication":"https://pith.science/pith/XKJHMLHM4X7MQ5OJ6BF4AF7QJF/action/replication_record"}},"created_at":"2026-05-18T00:18:56.598380+00:00","updated_at":"2026-05-18T00:18:56.598380+00:00"}