{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XKJHMLHM4X7MQ5OJ6BF4AF7QJF","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":"46915fce5bbc75ea467961f8bdab58c4da1c95551132f06393174131c4347428","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-09T20:53:51Z","title_canon_sha256":"04dc5c2a7e206e80e3a4a6670b5d800c7385c04e5b91e34fbcf62245c75f96f1"},"schema_version":"1.0","source":{"id":"1804.03233","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03233","created_at":"2026-05-18T00:18:56Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03233v1","created_at":"2026-05-18T00:18:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03233","created_at":"2026-05-18T00:18:56Z"},{"alias_kind":"pith_short_12","alias_value":"XKJHMLHM4X7M","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XKJHMLHM4X7MQ5OJ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XKJHMLHM","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:5a1d86bfa9cd4f4aa468b35b7852e8a294e67cba60cf2390a0b280e454a304a4","target":"graph","created_at":"2026-05-18T00:18:56Z","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 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","authors_text":"Christoph Studer, Giuseppe Durisi, Sven Jacobsson, Weiyu Xu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-09T20:53:51Z","title":"MSE-optimal 1-bit Precoding for Multiuser MIMO via Branch and Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03233","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:4f980d398fec3c6c28d49d83376e23c07f04a34fff00e799b93c671ba94f9ea0","target":"record","created_at":"2026-05-18T00:18:56Z","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":"46915fce5bbc75ea467961f8bdab58c4da1c95551132f06393174131c4347428","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-09T20:53:51Z","title_canon_sha256":"04dc5c2a7e206e80e3a4a6670b5d800c7385c04e5b91e34fbcf62245c75f96f1"},"schema_version":"1.0","source":{"id":"1804.03233","kind":"arxiv","version":1}},"canonical_sha256":"ba92762cece5fec875c9f04bc017f04945b96b9928804535bd57a36f17f74c3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba92762cece5fec875c9f04bc017f04945b96b9928804535bd57a36f17f74c3e","first_computed_at":"2026-05-18T00:18:56.598283Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:56.598283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"46cmhXaL3jBA5nMety6QosyGFI72xB/OnJfqQGTo4vvUFlndppkfBF2GcGELiTITKci++n95IY/419oiqMAEBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:56.598823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03233","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f980d398fec3c6c28d49d83376e23c07f04a34fff00e799b93c671ba94f9ea0","sha256:5a1d86bfa9cd4f4aa468b35b7852e8a294e67cba60cf2390a0b280e454a304a4"],"state_sha256":"9522b619d4ddbcb4ad6ba2ab16a04306822b4c0b560d52f78c430e07d462285b"}